On The Power Of Coherently Controlled Quantum Adiabatic Evolutions
arXiv:1403.6545 · doi:10.1088/1367-2630/16/12/123034
Abstract
A major challenge facing adiabatic quantum computing is that algorithm design and error correction can be difficult for adiabatic quantum computing. Recent work has considered addressing his challenge by using coherently controlled adiabatic evolutions in the place of classically controlled evolution. An important question remains: what is the relative power of controlled adiabatic evolution to traditional adiabatic evolutions? We address this by showing that coherent control and measurement provides a way to average different adiabatic evolutions in ways that cause their diabatic errors to cancel, allowing for adiabatic evolutions to combine the best characteristics of existing adiabatic optimizations strategies that are mutually exclusive in conventional adiabatic QIP. This result shows that coherent control and measurement can provide advantages for adiabatic state preparation. We also provide upper bounds on the complexity of simulating such evolutions on a circuit based quantum computer and provide sufficiency conditions for the equivalence of controlled adiabatic evolutions to adiabatic quantum computing.
arXiv comment20 pages, 7 figures
References in corpus (27)
- Holonomic Quantum Computation
- Geometric Manipulation of Trapped Ions for Quantum Computation
- Quantum Search by Local Adiabatic Evolution
- Quantum Computation by Adiabatic Evolution
- Quantum Algorithms for Quantum Field Theories
- Controlled exchange interaction between pairs of neutral atoms in an optical lattice
- Bounds for the adiabatic approximation with applications to quantum computation
- Adiabatic approximation in open quantum systems
- Inconsistency in the application of the adiabatic theorem
- Fast adiabatic qubit gates using only control
- Quantum Speedup by Quantum Annealing
- How Powerful is Adiabatic Quantum Computation?
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Improving frequency selection of driven pulses using derivative-based transition suppression
- High-fidelity CZ gate for resonator-based superconducting quantum computers
- Simulating Quantum Dynamics On A Quantum Computer
- Demon-like Algorithmic Quantum Cooling and its Realization with Quantum Optics
- Improved Error-Scaling for Adiabatic Quantum State Transfer
- Accuracy vs run time in adiabatic quantum search
- Adiabatic Quantum Simulators
- A new perturbative approach to the adiabatic approximation
- Floating Point Representations in Quantum Circuit Synthesis
- Improved Error Bounds for the Adiabatic Approximation
- Entanglement of group-II-like atoms with fast measurement for quantum information processing
- Faster annealing schedules for quantum annealing
- Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
- Gate-efficient discrete simulations of continuous-time quantum query algorithms
Cited by in corpus (16)
- Quantum Chemistry in the Age of Quantum Computing
- Shortcuts to adiabaticity: concepts, methods, and applications
- Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
- Shortcut to adiabatic gate teleportation
- Energy consumption for Shortcuts To Adiabaticity
- Quantum search with hybrid adiabatic-quantum walk algorithms and realistic noise
- Generalized Shortcuts to Adiabaticity and Enhanced Robustness Against Decoherence
- Experimental Implementation of Generalized Transitionless Quantum Driving
- Quantum Gates with Controlled Adiabatic Evolutions
- Energetic cost of superadiabatic quantum computation
- Energy consumption for ion transport in a segmented Paul trap
- Randomized gap and amplitude estimation
- Dynamics of the quantum search and quench-induced first-order phase transitions
- Reservoir-engineering shortcuts to adiabaticity
- Shortcuts to adiabaticity and applications to Quantum Computation
- Adiabatic Dynamics and Shortcuts to Adiabaticity: Fundamentals and Applications