Quantiki

We prove that the optimal strategy to store an unknown group transformation into a quantum memory is to apply the available uses in parallel on a suitable entangled state. The optimal retrieving strategy is the incoherent, ``measure-and-rotate'' strategy, in which the quantum memory is measured and a unitary depending on the outcome is performed. The same result holds for approximate re-alignment of reference frames for quantum communication.

We introduce the quantum stochastic walk (QSW), which determines the evolution of generalized quantum mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all possible quantum, classical and quantum-stochastic transitions of a vertex as defined from its connectivity. We show how the family of possible QSW encompasses both the classical random walk (CRW) and the quantum walks (QW) as special cases, but also includes more general probability distributions.

The difficulty in producing precisely timed and controlled quantum gates is a significant source of error in many physical implementations of quantum computers. Here we introduce a simple universal primitive, adiabatic gate teleportation, which is robust to timing errors and many control errors and maintains a constant energy gap throughout the computation above a degenerate ground state space. Notably this construction allows for geometric robustness based upon the control of two independent qubit interactions.

We consider the possibility of adding noise to a quantum circuit to make it efficiently simulatable classically. In previous works this approach has been used to derive upper bounds to fault tolerance thresholds - usually by identifying a privileged resource, such as an entangling gate or a non-Clifford operation, and then deriving the noise levels required to make it `unprivileged'. In this work we consider extensions of this approach where noise is added to Clifford gates too, and then `commuted' around until it concentrates on attacking the non-Clifford resource.