We assess the prospects for algorithms within the general framework of quantum annealing (QA) to achieve a quantum speedup relative to classical state of the art methods in combinatorial optimization and related sampling tasks. We argue for continued
exploration and interest in the QA framework on the basis that improved coherence times and control capabilities will enable the near-term exploration of several heuristic quantum optimization algorithms that have been introduced in the literature. These continuous-time Hamiltonian computation algorithms rely on control protocols that are more advanced than those in traditional ground-state QA, while still being considerably simpler than those used in gate-model implementations. The inclusion of coherent diabatic transitions to excited states results in a generalization called diabatic quantum annealing (DQA), which we argue for as the most promising route to quantum enhancement within this framework. Other promising variants of traditional QA include reverse annealing and continuous-time quantum walks, as well as analog analogues of parameterized quantum circuit ansatzes for machine learning. Most of these algorithms have no known (or likely to be discovered) efficient classical simulations, and in many cases have promising (but limited) early signs for the possibility of quantum speedups, making them worthy of further investigation with quantum hardware in the intermediate-scale regime. We argue that all of these protocols can be explored in a state-of-the-art manner by embracing the full range of novel out-of-equilibrium quantum dynamics generated by time-dependent effective transverse-field Ising Hamiltonians that can be natively implemented by, e.g., inductively-coupled flux qubits, both existing and projected at application scale.
We analyze numerically the performance of the near-optimal quadratic dynamical decoupling (QDD) single-qubit decoherence errors suppression method [J. West et al., Phys. Rev. Lett. 104, 130501 (2010)]. The QDD sequence is formed by nesting two optima
l Uhrig dynamical decoupling sequences for two orthogonal axes, comprising N1 and N2 pulses, respectively. Varying these numbers, we study the decoherence suppression properties of QDD directly by isolating the errors associated with each system basis operator present in the system-bath interaction Hamiltonian. Each individual error scales with the lowest order of the Dyson series, therefore immediately yielding the order of decoherence suppression. We show that the error suppression properties of QDD are dependent upon the parities of N1 and N2, and near-optimal performance is achieved for general single-qubit interactions when N1=N2.
We calculate the entanglement-assisted and unassisted channel capacities of an exactly solvable spin star system, which models the quantum dephasing channel. The capacities for this non-Markovian model exhibit a strong dependence on the coupling stre
ngths of the bath spins with the system, the bath temperature, and the number of bath spins. For equal couplings and bath frequencies, the channel becomes periodically noiseless.
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic quantum computation, where it is reasonable to assume that the adiabatic interpolation between the initial and final Hamiltonians is controllable. As
suming that the Hamiltonian is analytic in a finite strip around the real time axis, that some number of its time-derivatives vanish at the initial and final times, and that the target adiabatic eigenstate is non-degenerate and separated by a gap from the rest of the spectrum, we show that one can obtain an error between the final adiabatic eigenstate and the actual time-evolved state which is exponentially small in the evolution time, where this time itself scales as the square of the norm of the time-derivative of the Hamiltonian, divided by the cube of the minimal gap.
We exploit a recently constructed mapping between quantum circuits and graphs in order to prove that circuits corresponding to certain planar graphs can be efficiently simulated classically. The proof uses an expression for the Ising model partition
function in terms of quadratically signed weight enumerators (QWGTs), which are polynomials that arise naturally in an expansion of quantum circuits in terms of rotations involving Pauli matrices. We combine this expression with a known efficient classical algorithm for the Ising partition function of any planar graph in the absence of an external magnetic field, and the Robertson-Seymour theorem from graph theory. We give as an example a set of quantum circuits with a small number of non-nearest neighbor gates which admit an efficient classical simulation.
We show that quantum subdynamics of an open quantum system can always be described by a Hermitian map, irrespective of the form of the initial total system state. Since the theory of quantum error correction was developed based on the assumption of c
ompletely positive (CP) maps, we present a generalized theory of linear quantum error correction, which applies to any linear map describing the open system evolution. In the physically relevant setting of Hermitian maps, we show that the CP-map based version of quantum error correction theory applies without modifications. However, we show that a more general scenario is also possible, where the recovery map is Hermitian but not CP. Since non-CP maps have non-positive matrices in their range, we provide a geometric characterization of the positivity domain of general linear maps. In particular, we show that this domain is convex, and that this implies a simple algorithm for finding its boundary.
Two long standing open problems in quantum theory are to characterize the class of initial system-bath states for which quantum dynamics is equivalent to (1) a map between the initial and final system states, and (2) a completely positive (CP) map. T
he CP map problem is especially important, due to the widespread use of such maps in quantum information processing and open quantum systems theory. Here we settle both these questions by showing that the answer to the first is all, with the resulting map being Hermitian, and that the answer to the second is that CP maps arise exclusively from the class of separable states with vanishing quantum discord.
We study dynamical decoupling in a multi-qubit setting, where it is combined with quantum logic gates. This is illustrated in terms of computation using Heisenberg interactions only, where global decoupling pulses commute with the computation. We der
ive a rigorous error bound on the trace distance or fidelity between the desired computational state and the actual time-evolved state, for a system subject to coupling to a bounded-strength bath. The bound is expressed in terms of the operator norm of the effective Hamiltonian generating the evolution in the presence of decoupling and logic operations. We apply the bound to the case of periodic pulse sequences and find that in order maintain a constant trace distance or fidelity, the number of cycles -- at fixed pulse interval and width -- scales in inverse proportion to the square of the number of qubits. This sets a scalability limit on the protection of quantum computation using periodic dynamical decoupling.
55 -
D.A. Lidar
, P. Zanardi
, K. Khodjasteh (Center for Quantum Informationn Science & Technology
2008
We derive rigorous upper bounds on the distance between quantum states in an open system setting, in terms of the operator norm between the Hamiltonians describing their evolution. We illustrate our results with an example taken from protection against decoherence using dynamical decoupling.
We critically examine the internal consistency of a set of minimal assumptions entering the theory of fault-tolerant quantum error correction for Markovian noise. These assumptions are: fast gates, a constant supply of fresh and cold ancillas, and a
Markovian bath. We point out that these assumptions may not be mutually consistent in light of rigorous formulations of the Markovian approximation. Namely, Markovian dynamics requires either the singular coupling limit (high temperature), or the weak coupling limit (weak system-bath interaction). The former is incompatible with the assumption of a constant and fresh supply of cold ancillas, while the latter is inconsistent with fast gates. We discuss ways to resolve these inconsistencies. As part of our discussion we derive, in the weak coupling limit, a new master equation for a system subject to periodic driving.
