Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2009.06601 · Quantum

The Efficient Preparation of Normal Distributions in Quantum Registers

Arthur G. Rattew, Yue Sun, Pierre Minssen, Marco Pistoia

Published Dec 23, 2021• 48 citations
arXivHTMLPDF

Abstract

The efficient preparation of input distributions is an important problem in obtaining quantum advantage in a wide range of domains. We propose a novel quantum algorithm for the efficient preparation of arbitrary normal distributions in quantum registers. To the best of our knowledge, our work is the first to leverage the power of Mid-Circuit Measurement and Reuse (MCMR), in a way that is broadly applicable to a range of state-preparation problems. Specifically, our algorithm employs a repeat-until-success scheme, and only requires a constant-bounded number of repetitions in expectation. In the experiments presented, the use of MCMR enables up to a 862.6x reduction in required qubits. Furthermore, the algorithm is provably resistant to both phase-flip and bit-flip errors, leading to a first-of-its-kind empirical demonstration on real quantum hardware, the MCMR-enabled Honeywell System Models H0 and H1-2.

DOI
10.22331/q-2021-12-23-609

Related papers

Qubit-Reuse Compilation with Mid-Circuit Measurement and Reset

Matthew P. DeCross, Eli Chertkov, Megan Kohagen +1 more

A number of commercially available quantum computers, such as those based on trapped-ion or superconducting qubits, can now perform mid-circuit measurements and resets.In addition to being crucial for quantum error correction, this capability can help reduce the number of qubits needed to execute many types of quantum algorithms by measuring qubits as early as possible, resetting them, and reusing them elsewhere in the circuit.In this work, we introduce the idea of qubit-reuse compilation, which takes as input a quantum circuit and produces as output a compiled circuit that requires fewer qubits to execute due to qubit reuse.We present two algorithms for performing qubit-reuse compilation: an exact constraint programming optimization model and a greedy heuristic.We introduce the concept of dual circuits, obtained by exchanging state preparations with measurements and vice versa and reversing time, and show that optimal qubit-reuse compilation requires the same number of qubits to execute a circuit as its dual.We illustrate the performance of these algorithms on a variety of relevant near-term quantum circuits, such as one-dimensional and two-dimensional time-evolution circuits, and numerically benchmark their performance on the quantum adiabatic optimization algorithm (QAOA) applied to the MaxCut problem on random three-regular graphs.To demonstrate the practical benefit of these techniques, we experimentally realize an 80-qubit QAOA MaxCut circuit on the 20-qubit Quantinuum H1-1 trapped-ion quantum processor using qubit-reuse compilation algorithms.

arXiv:2210.08039•Physical Review X•Dec 22, 2023•116 citations

Efficient state preparation for a register of quantum bits

Andrei N. Soklakov, Rüdiger Schack

We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably bounded amplitudes, the algorithm requires resources that are polynomial in the number of qubits. Such sequences of states occur naturally in the problem of encoding a classical probability distribution in a quantum register.

arXiv:quant-ph/0408045•Physical Review A•Jan 9, 2006•125 citations

Exploiting Qubit Reuse through Mid-circuit Measurement and Reset

Hua, Fei, Yuwei Jin, Yanhao Chen +6 more

Quantum measurement is important to quantum computing as it extracts the outcome of the circuit at the end of the computation. Previously, all measurements have to be done at the end of the circuit. Otherwise, it will incur significant errors. But it is not the case now. Recently IBM started supporting dynamic circuits through hardware (instead of software by simulator). With mid-circuit hardware measurement, we can improve circuit efficacy and fidelity from three aspects: (a) reduced qubit usage, (b) reduced swap insertion, and (c) improved fidelity. We demonstrate this using real-world applications Bernstein Verizani on real hardware and show that circuit resource usage can be improved by 60\%, and circuit fidelity can be improved by 15\%. We design a compiler-assisted tool that can find and exploit the tradeoff between qubit reuse, fidelity, gate count, and circuit duration. We also developed a method for identifying whether qubit reuse will be beneficial for a given application. We evaluated our method on a representative set of essential applications. We can reduce resource usage by up to 80\% and circuit fidelity by up to 20\%.

arXiv:2211.01925•Nov 3, 2022•39 citations

Q-MERGE: Parallelising Quantum State Preparation for Large-Scale Classical Data

Archie Butterworth, Jens Renders, Jingbo Wang

Quantum processing of classical data fundamentally relies on efficiently mapping classical datasets onto the amplitudes of quantum states. Preparing large amplitude-encoded states, however, remains a major bottleneck in quantum computing. In this paper, we introduce a novel state-preparation framework we call Q-MERGE, that addresses this bottleneck by partitioning a large target state into $M$ $n$-qubit segments, preparing these segments independently and in parallel, and then coherently combining them into a single amplitude-encoded state using SELECT-SWAP operations and measurement. Q-MERGE is agnostic to the segment-level preparation method, allowing existing techniques to be applied to smaller subproblems while providing a tunable trade-off between circuit depth and qubit count. With mid-circuit measurement and preparation-register reuse, the required ancilla qubits can be reduced from O(Mn) to O(n). Applied to a real-world $32 x 1024$ ultrasound dataset, Q-MERGE achieves an infidelity of $3.5 x 10^{-9}$, compared with $6.2 x 10^{-3}$ for direct preparation using the same underlying method, a more than six orders of magnitude improvement at equal CNOT circuit depth. We demonstrate its feasibility experimentally with a 53 qubit circuit comprised of 954 1-qubit gates and 478 2-qubit gates, on the Quantinuum System Model H2 trapped-ion quantum computer. The prepared state is validated using shadow-overlap tomography. Numerical analysis of Haar-random states indicates consistent success probability for up to $M=10^7$ segments, supporting the scalability of Q-MERGE for encoding massive classical datasets.

quant-pharXiv:2610.04247•Oct 6, 2026•0 citations

Reducing Mid-Circuit Measurements via Probabilistic Circuits

Yanbin Chen, Innocenzo Fulginiti, Christian B. Mendl

Mid-circuit measurements and measurement-controlled gates are supported by an increasing number of quantum hardware platforms and will become more relevant as an essential building block for quantum error correction. However, mid-circuit measurements impose significant demands on the quantum hardware due to the required signal analysis and classical feedback loop. This work presents a static circuit optimization algorithm that can substitute some of these measurements with an equivalent circuit with stochastic applications of gates. Our method uses ideas from constant propagation to classically precompute measurement outcome probabilities. Our proposed optimization is efficient, as its runtime scales polynomially on the number of qubits and gates of the circuit.

arXiv:2405.13747•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•9 citations

Efficient State Preparation for Quantum Amplitude Estimation

Almudena Carrera Vazquez, Stefan Woerner

Quantum amplitude estimation (QAE) can achieve a quadratic speedup for applications classically solved by Monte Carlo simulation. A key requirement to realize this advantage is efficient state preparation. If state preparation is too expensive, it can diminish the quantum advantage. Preparing arbitrary quantum states has exponential complexity with respect to the number of qubits, and thus, is not applicable. Currently known efficient techniques require problems based on log-concave probability distributions, involve learning an unknown distribution from empirical data, or fully rely on quantum arithmetic. In this paper, we introduce an approach to simplify state preparation, together with a circuit optimization technique, both of which can help reduce the circuit complexity for QAE state preparation significantly. We demonstrate the introduced techniques for a numerical integration example on real quantum hardware, as well as for option pricing under the Heston model, i.e., based on a stochastic volatility process, using simulation.

arXiv:2005.07711•Physical Review Applied•Mar 9, 2021•72 citations
The efficient preparation of input distributions is an important problem in obtaining quantum advantage in a wide range of domains. We propose a novel quantum algorithm for the efficient preparation of arbitrary normal distributions in quantum registers. To the best of our knowledge, our work is the first to leverage the power of Mid-Circuit Measurement and Reuse (MCMR), in a way that is broadly applicable to a range of state-preparation problems. Specifically, our algorithm employs a repeat-until-success scheme, and only requires a constant-bounded number of repetitions in expectation. In the experiments presented, the use of MCMR enables up to a 862.6x reduction in required qubits. Furthermore, the algorithm is provably resistant to both phase-flip and bit-flip errors, leading to a first-of-its-kind empirical demonstration on real quantum hardware, the MCMR-enabled Honeywell System Models H0 and H1-2.
A number of commercially available quantum computers, such as those based on trapped-ion or superconducting qubits, can now perform mid-circuit measurements and resets.In addition to being crucial for quantum error correction, this capability can help reduce the number of qubits needed to execute many types of quantum algorithms by measuring qubits as early as possible, resetting them, and reusing them elsewhere in the circuit.In this work, we introduce the idea of qubit-reuse compilation, which takes as input a quantum circuit and produces as output a compiled circuit that requires fewer qubits to execute due to qubit reuse.We present two algorithms for performing qubit-reuse compilation: an exact constraint programming optimization model and a greedy heuristic.We introduce the concept of dual circuits, obtained by exchanging state preparations with measurements and vice versa and reversing time, and show that optimal qubit-reuse compilation requires the same number of qubits to execute a circuit as its dual.We illustrate the performance of these algorithms on a variety of relevant near-term quantum circuits, such as one-dimensional and two-dimensional time-evolution circuits, and numerically benchmark their performance on the quantum adiabatic optimization algorithm (QAOA) applied to the MaxCut problem on random three-regular graphs.To demonstrate the practical benefit of these techniques, we experimentally realize an 80-qubit QAOA MaxCut circuit on the 20-qubit Quantinuum H1-1 trapped-ion quantum processor using qubit-reuse compilation algorithms.
Quantum measurement is important to quantum computing as it extracts the outcome of the circuit at the end of the computation. Previously, all measurements have to be done at the end of the circuit. Otherwise, it will incur significant errors. But it is not the case now. Recently IBM started supporting dynamic circuits through hardware (instead of software by simulator). With mid-circuit hardware measurement, we can improve circuit efficacy and fidelity from three aspects: (a) reduced qubit usage, (b) reduced swap insertion, and (c) improved fidelity. We demonstrate this using real-world applications Bernstein Verizani on real hardware and show that circuit resource usage can be improved by 60\%, and circuit fidelity can be improved by 15\%. We design a compiler-assisted tool that can find and exploit the tradeoff between qubit reuse, fidelity, gate count, and circuit duration. We also developed a method for identifying whether qubit reuse will be beneficial for a given application. We evaluated our method on a representative set of essential applications. We can reduce resource usage by up to 80\% and circuit fidelity by up to 20\%.
Quantum processing of classical data fundamentally relies on efficiently mapping classical datasets onto the amplitudes of quantum states. Preparing large amplitude-encoded states, however, remains a major bottleneck in quantum computing. In this paper, we introduce a novel state-preparation framework we call Q-MERGE, that addresses this bottleneck by partitioning a large target state into MMM nnn-qubit segments, preparing these segments independently and in parallel, and then coherently combining them into a single amplitude-encoded state using SELECT-SWAP operations and measurement. Q-MERGE is agnostic to the segment-level preparation method, allowing existing techniques to be applied to smaller subproblems while providing a tunable trade-off between circuit depth and qubit count. With mid-circuit measurement and preparation-register reuse, the required ancilla qubits can be reduced from O(Mn) to O(n). Applied to a real-world 32x102432 x 102432x1024 ultrasound dataset, Q-MERGE achieves an infidelity of 3.5x10−93.5 x 10^{-9}3.5x10−9, compared with 6.2x10−36.2 x 10^{-3}6.2x10−3 for direct preparation using the same underlying method, a more than six orders of magnitude improvement at equal CNOT circuit depth. We demonstrate its feasibility experimentally with a 53 qubit circuit comprised of 954 1-qubit gates and 478 2-qubit gates, on the Quantinuum System Model H2 trapped-ion quantum computer. The prepared state is validated using shadow-overlap tomography. Numerical analysis of Haar-random states indicates consistent success probability for up to M=107M=10^7M=107 segments, supporting the scalability of Q-MERGE for encoding massive classical datasets.
Mid-circuit measurements and measurement-controlled gates are supported by an increasing number of quantum hardware platforms and will become more relevant as an essential building block for quantum error correction. However, mid-circuit measurements impose significant demands on the quantum hardware due to the required signal analysis and classical feedback loop. This work presents a static circuit optimization algorithm that can substitute some of these measurements with an equivalent circuit with stochastic applications of gates. Our method uses ideas from constant propagation to classically precompute measurement outcome probabilities. Our proposed optimization is efficient, as its runtime scales polynomially on the number of qubits and gates of the circuit.
Quantum amplitude estimation (QAE) can achieve a quadratic speedup for applications classically solved by Monte Carlo simulation. A key requirement to realize this advantage is efficient state preparation. If state preparation is too expensive, it can diminish the quantum advantage. Preparing arbitrary quantum states has exponential complexity with respect to the number of qubits, and thus, is not applicable. Currently known efficient techniques require problems based on log-concave probability distributions, involve learning an unknown distribution from empirical data, or fully rely on quantum arithmetic. In this paper, we introduce an approach to simplify state preparation, together with a circuit optimization technique, both of which can help reduce the circuit complexity for QAE state preparation significantly. We demonstrate the introduced techniques for a numerical integration example on real quantum hardware, as well as for option pricing under the Heston model, i.e., based on a stochastic volatility process, using simulation.