Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward
- URL: http://arxiv.org/abs/2501.02929v1
- Date: Mon, 06 Jan 2025 11:08:55 GMT
- Title: Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward
- Authors: Hyeonjun Yeo, Ha Eum Kim, IlKwon Sohn, Kabgyun Jeong,
- Abstract summary: Mid-circuit measurement and feedforward have been shown to significantly reduce the depth of quantum circuits.
We propose several parallelization strategies that reduce quantum circuit depth at the expense of increasing width.
- Score: 0.0
- License:
- Abstract: Reducing circuit depth and identifying an optimal trade-off between circuit depth and width is crucial for successful quantum computation. In this context, mid-circuit 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 coordinate Bethe ansatz, 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.
Related papers
- SuperEncoder: Towards Universal Neural Approximate Quantum State Preparation [12.591173729459427]
We show that it is possible to leverage a pre-trained neural network to directly generate the QSP circuit for arbitrary quantum state.
Our study makes a steady step towards a universal neural designer for approximate QSP.
arXiv Detail & Related papers (2024-08-10T04:39:05Z) - Symmetry-Based Quantum Circuit Mapping [2.51705778594846]
We introduce a quantum circuit remapping algorithm that leverages the intrinsic symmetries in quantum processors.
This algorithm identifies all topologically equivalent circuit mappings by constraining the search space using symmetries and accelerates the scoring of each mapping using vector computation.
arXiv Detail & Related papers (2023-10-27T10:04:34Z) - Efficient Quantum Circuits based on the Quantum Natural Gradient [0.0]
Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation.
We propose symmetry-conserving modified quantum approximate optimization algorithm(SCom-QAOA) circuits.
The proposed scheme enlarges the set of the initial states accessible for variational quantum algorithms and widens the scope of investigation of non-equilibrium phenomena in quantum simulators.
arXiv Detail & Related papers (2023-10-16T16:08:57Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Simultaneous estimation of multiple eigenvalues with short-depth quantum
circuit on early fault-tolerant quantum computers [5.746732081406236]
We introduce a multi-modal, multi-level quantum complex exponential least squares (MM-QCELS) method to simultaneously estimate multiple eigenvalues of a quantum Hamiltonian on early fault-tolerant quantum computers.
Our theoretical analysis demonstrates that the algorithm exhibits Heisenberg-limited scaling in terms of circuit depth and total cost.
arXiv Detail & Related papers (2023-03-10T05:42:26Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Linear-depth quantum circuits for multiqubit controlled gates [3.0001636668817606]
We present a systematic procedure to decompose multiqubit controlled unitary gates.
We show the advantage of our algorithm with proof-of-principle experiments on the IBM quantum cloud platform.
arXiv Detail & Related papers (2022-03-22T16:57:59Z) - Escaping from the Barren Plateau via Gaussian Initializations in Deep Variational Quantum Circuits [63.83649593474856]
Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.
However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.
This result leads to a general standpoint that deep quantum circuits would not be feasible for practical tasks.
arXiv Detail & Related papers (2022-03-17T15:06:40Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
We propose that quantum circuits can be modeled as queuing networks.
Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
arXiv Detail & Related papers (2021-06-26T10:55:52Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.