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:2302.13518 · IEEE Transactions on Quantum Engineering

State Preparation on Quantum Computers via Quantum Steering

Daniel Volya, Prabhat Mishra

Published Jan 1, 2024• 48 citations
arXivHTMLPDF

Abstract

Quantum computers present a compelling platform for the study of open quantum systems, namely the non-unitary dynamics of a system. Here, we investigate and report digital simulations of Markovian, non-unitary dynamics that converge to a unique steady state. The steady state is programmed as a desired target state, yielding semblance to a quantum state preparation protocol. By delegating ancilla qubits and systems qubits, the system state is driven to the target state by repeatedly performing the following steps: (1) executing a designated system-ancilla entangling circuit, (2) measuring the ancilla qubits, and (3) re-initializing ancilla qubits to known states through active reset. While the ancilla qubits are measured and reinitialized to known states, the system qubits undergo a non-unitary evolution and are steered from arbitrary initial states to desired target states. We show results of the method by preparing arbitrary qubit states and qutrit (three-level) states on contemporary quantum computers. We also demonstrate that the state convergence can be accelerated by utilizing the readouts of the ancilla qubits to guide the protocol in a non-blind manner. Our work serves as a nontrivial example that incorporates and characterizes essential operations such as qubit reuse (qubit reset), entangling circuits, and measurement. These operations are not only vital for near-term noisy intermediate-scale quantum (NISQ) applications but are also crucial for realizing future error-correcting codes.

DOI
10.1109/tqe.2024.3358193

Related papers

Quantum Steering of Surface Error Correcting Codes

Daniel Volya, Prabhat Mishra

Surface codes provide a promising path towards large-scale fault-tolerant quantum computers. However, outside the difficulty in engineering qubits, their theoretical realization is hindered by a number of technical implementation details, including the initialization of an encoded quantum state on contemporary quantum computers. We propose a solution to overcome these challenges by utilizing recent theoretical developments in measurement-induced quantum steering. An encoded quantum state is prepared by repeatedly performing the following steps: (1) entangling qubits via a specifically chosen operation, (2) performing measurement on some of the qubits, and (3) resetting the measured qubits' states. We demonstrate our results using numerical simulations of surface codes, noting convergence of state fidelity, and commenting on choices for parameter selection.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•7 citations

Quantum state preparation via engineered ancilla resetting

Daniel Alcalde Puente, Felix Motzoi, Tommaso Calarco +2 more

In this theoretical investigation, we examine the effectiveness of a protocol incorporating periodic quantum resetting for preparing ground states of frustration-free parent Hamiltonians. This protocol uses a steering Hamiltonian that enables local coupling between the system and ancillary degrees of freedom. At periodic intervals, the ancillary system is reset to its initial state. For infinitesimally short reset times, the dynamics can be approximated by a Lindbladian whose steady state is the target state. For finite reset times, however, the spin chain and the ancilla become entangled between reset operations. To evaluate the protocol, we employ Matrix Product State simulations and quantum trajectory techniques, focusing on the preparation of the spin-1 Affleck-Kennedy-Lieb-Tasaki state. Our analysis considers convergence time, fidelity, and energy evolution under different reset intervals. Our numerical results show that ancilla system entanglement is essential for faster convergence. In particular, there exists an optimal reset time at which the protocol performs best. Using a simple approximation, we provide insights into how to optimally choose the mapping operators applied to the system during the reset procedure. Furthermore, the protocol shows remarkable resilience to small deviations in reset time and dephasing noise. Our study suggests that stroboscopic maps using quantum resetting may offer advantages over alternative methods, such as quantum reservoir engineering and quantum state steering protocols, which rely on Markovian dynamics.

arXiv:2305.08641•Quantum•Mar 27, 2024•26 citations

Engineering unsteerable quantum states with active feedback

Samuel Morales, Yuval Gefen, Igor Gornyi +2 more

We propose active steering protocols for quantum state preparation in quantum circuits where each system qubit is connected to a single detector qubit, employing a simple coupling selected from a small set of steering operators. The decision is made such that the expected cost-function gain in one time step is maximized. We apply these protocols to several many-qubit models. Our results are underlined by three remarkable insights. First, we show that the standard fidelity does not give a useful cost function; instead, successful steering is achieved by including local fidelity terms. Second, although the steering dynamics acts on each system qubit separately, entanglement in the generated target state is introduced, and can be tuned at will, by performing Bell measurements on detector qubit pairs after every time step. This implements a weak-measurement variant of entanglement swapping. Third, numerical simulations suggest that the active steering protocol can reach arbitrarily designated target states, including passively unsteerable states such as the $N$-qubit W state.

quant-pharXiv:2308.00384•Physical Review Research•Aug 2, 2023•20 citations

Measurement-induced steering of quantum systems

Sthitadhi Roy, J. T. Chalker, I. V. Gornyi +1 more

We set out a general protocol for steering the state of a quantum system from an arbitrary initial state toward a chosen target state by coupling it to auxiliary quantum degrees of freedom.The protocol requires multiple repetitions of an elementary step: During each step, the system evolves for a fixed time while coupled to auxiliary degrees of freedom (which we term "detector qubits") that have been prepared in a specified initial state.The detectors are discarded at the end of the step, or equivalently, their state is determined by a projective measurement with an unbiased average over all outcomes.The steering harnesses backaction of the detector qubits on the system, arising from entanglement generated during the coupled evolution.We establish principles for the design of the system-detector coupling that ensure steering of a desired form.We illustrate our general ideas using both few-body examples (including a pair of spins-1/2 steered to the singlet state) and a many-body example (a spin-1 chain steered to the Affleck-Kennedy-Lieb-Tasaki state).We study the continuous time limit in our approach and discuss similarities to (and differences from) drive-and-dissipation protocols for quantum state engineering.Our protocols are amenable to implementations using present-day technology.Obvious extensions of our analysis include engineering of other many-body phases in one and higher spatial dimensions, adiabatic manipulations of the target states, and the incorporation of active error correction steps.

arXiv:1912.04292•Physical Review Research•Sep 1, 2020•114 citations

Probabilistic nonunitary quantum computing

Colin P. Williams

In [1] Gingrich and Williams extended the standard quantum circuit model of quantum computation to include gates that perform arbitrary linear, yet non-unitary, transformations of their input state. In this paper we use this theory to construct quantum circuits that perform desired non-unitary state transformations of the sort arising in lattice-based quantum search. Such n-qubit non-unitary gates cannot be achieved deterministically, but they can be achieved probabilistically using a single ancilla. Our approach is to use the n-qubit non-unitary gate to design an (n+1)-qubit Hamiltonian that can be seen to induce a suitable conditional dynamics such that whenever the output value of the ancilla qubit is measured and found to be |O>, then the remaining (unmeasured) n qubits will contain the desired non-unitary transform of the n-qubit input state. The scheme is necessarily probabilistic because we cannot force the measurement on the ancilla qubit to return the value we want. Fortunately, however, failed attempts are found to disturb the n-qubit input state very little. This allows us to re-use the result of successive “failed” attempts until the success condition is finally attained, and we give analytic expressions for the success probability and net fidelity in this case. By using our previous method for designing a quantum circuit for an arbitrary n-qubit gate in conjunction with our new probabilistic non-unitary procedure we are able to compute an explicit quantum circuit sufficient to implement an arbitrary linear, yet non-unitary, transformation of an input pure or mixed n-qubit state, using only a single copy of the input state. This allows us to extend the repertoire of computations that may be performed on a quantum computer, and in particular, gives the first explicit construction of the quantum circuits needed to perform some of the key operations arising in quantum lattice search.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 24, 2004•9 citations

Measurement-driven Quantum Approximate Optimization

Tobias Stollenwerk, Stuart Hadfield

Algorithms based on non-unitary evolution have attracted much interest for ground state preparation on quantum computers. One recently proposed method makes use of ancilla qubits and controlled unitary operators to implement weak measurements related to imaginary-time evolution. In this work we specialize and extend this approach to the setting of combinatorial optimization. We first generalize the algorithm from exact to approximate optimization, taking advantage of several properties unique to classical problems. In particular we show how to select parameters such that the success probability of each measurement step is bounded away from $1/2$. We then show how to adapt our paradigm to the setting of constrained optimization for a number of important classes of hard problem constraints. For this we compare and contrast both penalty-based and feasibility-preserving approaches, elucidating the significant advantages of the latter approach. Our approach is general and may be applied to easy-to-prepare initial states as a standalone algorithm, or deployed as a quantum postprocessing stage to improve performance of a given parameterized quantum circuit. We then propose a more sophisticated variant of our algorithm that adaptively applies a mixing operator or not, based on the measurement outcomes seen so far, as to speeds up the algorithm and helps the system evolution avoid slowing down or getting stuck suboptimally. In particular, we show that mixing operators from the quantum alternating operator ansatz can be imported directly, both for the necessary eigenstate scrambling operator and for initial state preparation, and discuss quantum resource tradeoffs.

quant-pharXiv:2512.21046•Physical Review A•Dec 25, 2025•3 citations
Quantum computers present a compelling platform for the study of open quantum systems, namely the non-unitary dynamics of a system. Here, we investigate and report digital simulations of Markovian, non-unitary dynamics that converge to a unique steady state. The steady state is programmed as a desired target state, yielding semblance to a quantum state preparation protocol. By delegating ancilla qubits and systems qubits, the system state is driven to the target state by repeatedly performing the following steps: (1) executing a designated system-ancilla entangling circuit, (2) measuring the ancilla qubits, and (3) re-initializing ancilla qubits to known states through active reset. While the ancilla qubits are measured and reinitialized to known states, the system qubits undergo a non-unitary evolution and are steered from arbitrary initial states to desired target states. We show results of the method by preparing arbitrary qubit states and qutrit (three-level) states on contemporary quantum computers. We also demonstrate that the state convergence can be accelerated by utilizing the readouts of the ancilla qubits to guide the protocol in a non-blind manner. Our work serves as a nontrivial example that incorporates and characterizes essential operations such as qubit reuse (qubit reset), entangling circuits, and measurement. These operations are not only vital for near-term noisy intermediate-scale quantum (NISQ) applications but are also crucial for realizing future error-correcting codes.
Surface codes provide a promising path towards large-scale fault-tolerant quantum computers. However, outside the difficulty in engineering qubits, their theoretical realization is hindered by a number of technical implementation details, including the initialization of an encoded quantum state on contemporary quantum computers. We propose a solution to overcome these challenges by utilizing recent theoretical developments in measurement-induced quantum steering. An encoded quantum state is prepared by repeatedly performing the following steps: (1) entangling qubits via a specifically chosen operation, (2) performing measurement on some of the qubits, and (3) resetting the measured qubits' states. We demonstrate our results using numerical simulations of surface codes, noting convergence of state fidelity, and commenting on choices for parameter selection.
In this theoretical investigation, we examine the effectiveness of a protocol incorporating periodic quantum resetting for preparing ground states of frustration-free parent Hamiltonians. This protocol uses a steering Hamiltonian that enables local coupling between the system and ancillary degrees of freedom. At periodic intervals, the ancillary system is reset to its initial state. For infinitesimally short reset times, the dynamics can be approximated by a Lindbladian whose steady state is the target state. For finite reset times, however, the spin chain and the ancilla become entangled between reset operations. To evaluate the protocol, we employ Matrix Product State simulations and quantum trajectory techniques, focusing on the preparation of the spin-1 Affleck-Kennedy-Lieb-Tasaki state. Our analysis considers convergence time, fidelity, and energy evolution under different reset intervals. Our numerical results show that ancilla system entanglement is essential for faster convergence. In particular, there exists an optimal reset time at which the protocol performs best. Using a simple approximation, we provide insights into how to optimally choose the mapping operators applied to the system during the reset procedure. Furthermore, the protocol shows remarkable resilience to small deviations in reset time and dephasing noise. Our study suggests that stroboscopic maps using quantum resetting may offer advantages over alternative methods, such as quantum reservoir engineering and quantum state steering protocols, which rely on Markovian dynamics.
We propose active steering protocols for quantum state preparation in quantum circuits where each system qubit is connected to a single detector qubit, employing a simple coupling selected from a small set of steering operators. The decision is made such that the expected cost-function gain in one time step is maximized. We apply these protocols to several many-qubit models. Our results are underlined by three remarkable insights. First, we show that the standard fidelity does not give a useful cost function; instead, successful steering is achieved by including local fidelity terms. Second, although the steering dynamics acts on each system qubit separately, entanglement in the generated target state is introduced, and can be tuned at will, by performing Bell measurements on detector qubit pairs after every time step. This implements a weak-measurement variant of entanglement swapping. Third, numerical simulations suggest that the active steering protocol can reach arbitrarily designated target states, including passively unsteerable states such as the NNN-qubit W state.
We set out a general protocol for steering the state of a quantum system from an arbitrary initial state toward a chosen target state by coupling it to auxiliary quantum degrees of freedom.The protocol requires multiple repetitions of an elementary step: During each step, the system evolves for a fixed time while coupled to auxiliary degrees of freedom (which we term "detector qubits") that have been prepared in a specified initial state.The detectors are discarded at the end of the step, or equivalently, their state is determined by a projective measurement with an unbiased average over all outcomes.The steering harnesses backaction of the detector qubits on the system, arising from entanglement generated during the coupled evolution.We establish principles for the design of the system-detector coupling that ensure steering of a desired form.We illustrate our general ideas using both few-body examples (including a pair of spins-1/2 steered to the singlet state) and a many-body example (a spin-1 chain steered to the Affleck-Kennedy-Lieb-Tasaki state).We study the continuous time limit in our approach and discuss similarities to (and differences from) drive-and-dissipation protocols for quantum state engineering.Our protocols are amenable to implementations using present-day technology.Obvious extensions of our analysis include engineering of other many-body phases in one and higher spatial dimensions, adiabatic manipulations of the target states, and the incorporation of active error correction steps.
In [1] Gingrich and Williams extended the standard quantum circuit model of quantum computation to include gates that perform arbitrary linear, yet non-unitary, transformations of their input state. In this paper we use this theory to construct quantum circuits that perform desired non-unitary state transformations of the sort arising in lattice-based quantum search. Such n-qubit non-unitary gates cannot be achieved deterministically, but they can be achieved probabilistically using a single ancilla. Our approach is to use the n-qubit non-unitary gate to design an (n+1)-qubit Hamiltonian that can be seen to induce a suitable conditional dynamics such that whenever the output value of the ancilla qubit is measured and found to be |O>, then the remaining (unmeasured) n qubits will contain the desired non-unitary transform of the n-qubit input state. The scheme is necessarily probabilistic because we cannot force the measurement on the ancilla qubit to return the value we want. Fortunately, however, failed attempts are found to disturb the n-qubit input state very little. This allows us to re-use the result of successive “failed” attempts until the success condition is finally attained, and we give analytic expressions for the success probability and net fidelity in this case. By using our previous method for designing a quantum circuit for an arbitrary n-qubit gate in conjunction with our new probabilistic non-unitary procedure we are able to compute an explicit quantum circuit sufficient to implement an arbitrary linear, yet non-unitary, transformation of an input pure or mixed n-qubit state, using only a single copy of the input state. This allows us to extend the repertoire of computations that may be performed on a quantum computer, and in particular, gives the first explicit construction of the quantum circuits needed to perform some of the key operations arising in quantum lattice search.
Algorithms based on non-unitary evolution have attracted much interest for ground state preparation on quantum computers. One recently proposed method makes use of ancilla qubits and controlled unitary operators to implement weak measurements related to imaginary-time evolution. In this work we specialize and extend this approach to the setting of combinatorial optimization. We first generalize the algorithm from exact to approximate optimization, taking advantage of several properties unique to classical problems. In particular we show how to select parameters such that the success probability of each measurement step is bounded away from 1/21/21/2. We then show how to adapt our paradigm to the setting of constrained optimization for a number of important classes of hard problem constraints. For this we compare and contrast both penalty-based and feasibility-preserving approaches, elucidating the significant advantages of the latter approach. Our approach is general and may be applied to easy-to-prepare initial states as a standalone algorithm, or deployed as a quantum postprocessing stage to improve performance of a given parameterized quantum circuit. We then propose a more sophisticated variant of our algorithm that adaptively applies a mixing operator or not, based on the measurement outcomes seen so far, as to speeds up the algorithm and helps the system evolution avoid slowing down or getting stuck suboptimally. In particular, we show that mixing operators from the quantum alternating operator ansatz can be imported directly, both for the necessary eigenstate scrambling operator and for initial state preparation, and discuss quantum resource tradeoffs.