Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward
arXiv:2501.02929 · doi:10.1103/PhysRevApplied.23.054066
Abstract
Reducing circuit depth and identifying an optimal trade-off between circuit depth and width is crucial for successful quantum computation. In this context, midcircuit measurement and feedforward have been shown to significantly reduce the depth of quantum circuits, particularly in implementing logical gates. By leveraging these techniques, we propose several parallelization strategies that reduce quantum circuit depth at the expense of increasing width in preparing various quantum states relevant to quantum simulation. With measurements and feedforward, we demonstrate that utilizing unary encoding as a bridge between two quantum states substantially reduces the circuit depth required for preparing quantum states, such as sparse quantum states and sums of Slater determinants within the first quantization framework, while maintaining an efficient circuit width. Additionally, we show that a Bethe wave function, characterized by its high degree of freedom in its phase, can be probabilistically prepared in a constant-depth quantum circuit using measurements and feedforward. We anticipate that our study will contribute to the reduction of circuit depth in initial state preparation, particularly for quantum simulation, which is a critical step toward achieving quantum advantage.
23 pages, 3 figures
References in corpus (48)
- Quantum Teleportation is a Universal Computational Primitive
- Adiabatic Quantum Computing
- Fermionic quantum computation
- Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Quantum Algorithms for Fermionic Simulations
- Solving strongly correlated electron models on a quantum computer
- Low Depth Quantum Simulation of Electronic Structure
- Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
- Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
- Quantum algorithms to simulate many-body physics of correlated fermions
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
- Measurement as a shortcut to long-range entangled quantum matter
- Hierarchy of topological order from finite-depth unitaries, measurement and feedforward
- Quantum Circuits assisted by LOCC: Transformations and Phases of Matter
- Efficient Long-Range Entanglement using Dynamic Circuits
- Preparation of matrix product states with log-depth quantum circuits
- Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
- Quantum Circuits with Unbounded Fan-out
- Trading T gates for dirty qubits in state preparation and unitary synthesis
- Counterdiabatic Optimised Local Driving
- Deterministic constant-depth preparation of the AKLT state on a quantum processor using fusion measurements
- Towards adiabatic quantum computing using compressed quantum circuits
- Lectures on the Bethe Ansatz
- Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
- Quantum computing applied to calculations of molecular energies: CH2 benchmark
- Constant-depth preparation of matrix product states with adaptive quantum circuits
- Quantum unary approach to option pricing
- Introduction to the thermodynamic Bethe ansatz
- Efficient quantum algorithm for preparing molecular-system-like states on a quantum computer
- Initial state preparation for quantum chemistry on quantum computers
- Algebraic Bethe Circuits
- Approximating many-body quantum states with quantum circuits and measurements
- Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods
- State preparation by shallow circuits using feed forward
- Preparing exact eigenstates of the open XXZ chain on a quantum computer
- Bosonic field digitization for quantum computers
- Measurement-Based Long-Range Entangling Gates in Constant Depth
- Bethe states on a quantum computer: success probability and correlation functions
- Circuit complexity of quantum access models for encoding classical data
- Quantum Simulations of Chemistry in First Quantization with any Basis Set
- The Bethe Ansatz as a Quantum Circuit
- Efficient option pricing with unary-based photonic computing chip and generative adversarial learning
- Deterministic Bethe state preparation
- Estimating Bethe roots with VQE
- Quantum encoder for fixed Hamming-weight subspaces
- Shallow quantum circuits for efficient preparation of Slater determinants and correlated states on a quantum computer