Self-protected adiabatic quantum computation
arXiv:2203.09695 · doi:10.1103/PhysRevA.106.012420
Abstract
Recent experiments show the existence of collective decoherence in quantum systems. We study the possibility of quantum computation in decoherence free subspace which is robust against such kind of decoherence processes. This passive protection protocol can be especially advantageous for continuous quantum computation such as quantum annealers. As an example we propose to use decoherence protected adiabatic quantum computation for the Grover search problem. Our proposal contains only two-body interactions, making it feasible in near-term quantum devices.
References in corpus (25)
- Dynamical Decoupling of Open Quantum Systems
- Multiple Particle Interference and Quantum Error Correction
- Quantum Simulation of Antiferromagnetic Spin Chains in an Optical Lattice
- A Theory of Quantum Error-Correcting Codes
- Quantum Search by Local Adiabatic Evolution
- Quantum computers can search rapidly by using almost any transformation
- Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation
- Nonlocal properties of two-qubit gates and mixed states and optimization of quantum computations
- Spin transport in a tunable Heisenberg model realized with ultracold atoms
- Simulating quantum many-body dynamics on a current digital quantum computer
- Correlated Charge Noise and Relaxation Errors in Superconducting Qubits
- Complete 3-Qubit Grover Search on a Programmable Quantum Computer
- Natural two-qubit gate for quantum computation using the XY interaction
- Stabilizing Quantum Information
- Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits
- Colloquium: Atomic spin chains on surfaces
- Loading a Bose-Einstein Condensate onto an Optical Lattice: an Application of Optimal Control Theory to The Non Linear Schrödinger Equation
- Near-optimal quantum circuit for Grover's unstructured search using a transverse field
- Atomic spin chain realization of a model for quantum criticality
- Quantum computers as universal quantum simulators: state-of-art and perspectives
- Polynomial-Time Simulation of Pairing Models on a Quantum Computer
- Effects of Noisy Oracle on Search Algorithm Complexity
- Power of Anisotropic Exchange Interactions: Universality and Efficient Codes for Quantum Computing
- Memory-induced geometric phase in non-Markovian open systems
- Geometric decoherence in diffusive open quantum systems