State preparation by shallow circuits using feed forward

Abstract

In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the qubits. Third, perform a fast classical computation to establish which errors have occurred (if any). Fourth, depending on the errors, we apply a correction step. Then the procedure repeats with the next sequence of gates. In order for these four steps to succeed, we need the error rate of the gates to be below a certain threshold. Unfortunately, the error rates of current quantum hardware are still too high. On the other hand, current quantum hardware platforms are designed with these four steps in mind. In this work we make use of this four-step scheme not to carry out fault-tolerant computations, but to enhance short, constant-depth, quantum circuits that perform 1 qubit gates and nearest-neighbor 2 qubit gates. To explore how this can be useful, we study a computational model which we call Local Alternating Quantum Classical Computations (LAQCC). In this model, qubits are placed in a grid allowing nearest neighbor interactions; the quantum circuits are of constant depth with intermediate measurements; a classical controller can perform log-depth computations on these intermediate measurement outcomes to control future quantum operations. This model fits naturally between quantum algorithms in the NISQ era and full fledged fault-tolerant quantum computation. We show that LAQCC circuits can create long-ranged interactions, which constant-depth quantum circuits cannot achieve, and use it to construct a range of useful multi-qubit gates. With these gates, we create three new state preparation protocols for a uniform superposition over an arbitrary number of states, W-states, Dicke states and may-body scar states.

32 pages, 3 pages appendix, 9 figures

References in corpus (38)

• Scalable multi-particle entanglement of trapped ions
• Quantum many-body scars
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Multipartite entanglement and high precision metrology
• Instantaneous non-local computation of low T-depth quantum circuits
• Grover Algorithm with zero theoretical failure rate
• Generation of Three-Qubit Entangled States using Superconducting Phase Qubits
• Entanglement of Exact Excited States of AKLT Models: Exact Results, Many-Body Scars and the Violation of Strong ETH
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Experimental realization of Dicke states of up to six qubits for multiparty quantum networking
• Weak Ergodicity Breaking and Quantum Many-Body Scars in Spin-1 XY Magnets
• Exact Excited States of Non-Integrable Models
• Quantum Many-Body Scar States with Emergent Kinetic Constraints and Finite-Entanglement Revivals
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Instantaneous Quantum Computation
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Excited-State Quantum Phase Transitions in Dicke Superradiance Models
• Hierarchy of topological order from finite-depth unitaries, measurement and feedforward
• An introduction to measurement based quantum computation
• Quantum Circuits assisted by LOCC: Transformations and Phases of Matter
• Large Classes of Quantum Scarred Hamiltonians from Matrix Product States
• Deterministic Preparation of Dicke States
• Long-range entanglement from measuring symmetry-protected topological phases
• Benchmarking the performance of portfolio optimization with QAOA
• Permutation-invariant quantum codes
• Quantum Circuits with Unbounded Fan-out
• Shortest Route to Non-Abelian Topological Order on a Quantum Processor
• Deterministic constant-depth preparation of the AKLT state on a quantum processor using fusion measurements
• A necessary and sufficient condition to play games in quantum mechanical settings
• Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
• The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
• Efficient compression of quantum information
• Short-Depth Circuits for Dicke State Preparation
• Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
• Diagonal quantum circuits: their computational power and applications
• Three Lectures on Complexity and Black Holes
• Preparing quantum many-body scar states on quantum computers
• Poor man's derivation of the Bethe-Ansatz equations for the Dicke model

Cited by in corpus (22)

• Realizing the Nishimori transition across the error threshold for constant-depth quantum circuits
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Measurement-Based Long-Range Entangling Gates in Constant Depth
• Classifying One-Dimensional Quantum States Prepared by a Single Round of Measurements
• Global Variational Quantum Circuits for Arbitrary Symmetric State Preparation
• Efficient preparation of Dicke states
• Efficient preparation of entangled states in cavity QED with Grover's algorithm
• Parity-dependent state transfer for direct entanglement generation
• Realization of Constant-Depth Fan-Out with Real-Time Feedforward on a Superconducting Quantum Processor
• Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward
• Phases of Matrix Product States with Symmetric Quantum Circuits and Symmetric Measurements with Feedforward
• Variational LOCC-assisted quantum circuits for long-range entangled states
• Deterministic carving of quantum states with Grover's algorithm
• Efficient Generation of Multi-partite Entanglement between Non-local Superconducting Qubits using Classical Feedback
• Non-onsite symmetry breaking: topological phase coexistence and criticality
• Simple ways of preparing qudit Dicke states
• Error Mitigation in Dynamic Circuits for Hamiltonian Simulation
• Disambiguating Pauli noise in quantum computers
• Scaling Laws of Quantum Information Lifetime in Monitored Quantum Dynamics
• Long-ranged gates in quantum computation architectures with limited connectivity
• Quantum Circuits for Matrix-Product Unitaries
• Spin-$s$ $U(1)$-eigenstate preparation