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:1903.11999 · Physical Review A

Quantum algorithm for spectral projection by measuring an ancilla iteratively

Yanzhu Chen, Tzu-Chieh Wei

Published Mar 23, 2020• 9 citations
arXivHTMLPDF

Abstract

We propose a quantum algorithm for projecting a quantum system to eigenstates of any Hermitian operator, provided one can access the associated control-unitary evolution for the ancilla and the system, as well as the measurement of the controlling ancillary qubit. Such a Hadamard-test-like primitive is iterated so as to achieve the spectral projection, and the distribution of the projected eigenstates obeys the Born rule. This algorithm can be used as a subroutine in the quantum annealing procedure by measurement to drive the system to the ground state of a final Hamiltonian, and we simulate this for quantum many-body spin chains.

DOI
10.1103/physreva.101.032339

Related papers

Quantum algorithm for preparing the ground state of a system via resonance transition

Hefeng Wang

Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary qubit, by introducing a resonance mechanism between the ancilla qubit and the system, and combined with measurements performed on the ancilla qubit, the system can be evolved to monotonically converge to its ground state through an iterative procedure. We have simulated the application of this algorithm for the Afflect-Kennedy-Lieb-Tasaki model, whose ground state can be used as resource state in one-way quantum computation.

arXiv:1706.08644•Scientific Reports•Nov 21, 2017•13 citations

Arbitrary State Creation via Controlled Measurement

Alexander Ivanovich Zenchuk, Wentao Qi, Junde Wu

Abstract We propose an algorithm to create an arbitrary n -qubit pure quantum superposition state with precision of m -decimals (binary representation) for each probability amplitude. The algorithm uses one-qubit rotations, Hadamard transformations and, C-NOT operations with multi-qubit controls. The depth of the circuit is O (2 n n ), its space is O ( n ). We emphasize that the parameters of the utilized unitary transformations are predicted in advance by the required precision and therefore there is no classical calculation supplementing this quantum algorithm. Finalizing the state-creation we perform the measurement of the ancilla state with a certain desired output with the purpose of removing all the garbage from the created superposition state. If n and m are independent and n ≫ m , the probability of access to the desired ancilla-state (success probability) is ~ 2 −n , which requires O (2 n ) runs of the algorithm and leads to the overall depth O (4 n n ). However, the situation can be significantly improved by replacing the usual measurement with the controlled measurement of the ancilla state that, first of all, removes the garbage part of the superposition state and, second (and most important), allows to avoid both the problem of small success probability to the desired ancilla state and multiple runs of the algorithm. As a consequence, the depth of the algorithm is O (2 n n ) in this case. If m serves to provide the required fidelity of state approximation, then the above parameters increase. This algorithm can be a subroutine generating the required input state in various algorithms, in particular, in matrix-manipulation algorithms developed earlier.

arXiv:2504.09462•Quantum Information and Computation•Mar 1, 2026•3 citations

Channel-based framework for phase estimation of multiple eigenvalues

Yuan-De Jin, Shiyu Zhang, Wen-Long Ma

Quantum phase estimation (QPE) is a crucial subroutine in many quantum algorithms. It is used to estimate the eigenvalues of a unitary operator acting on a target quantum system. Conventional QPE is often expensive to implement because it requires a large number of ancilla qubits and the ability to perform quantum Fourier transform. Recent developments in iterative QPE reduce the implementation cost by repetitive uses of a single ancilla and classical postprocessing. However, both conventional and iterative schemes often require preparation of the target system in an eigenstate of the unitary operator, while it remains ambiguous to achieve QPE of multiple eigenvalues with no need of initial-state preparation. Here we clarify this issue by developing a theoretical framework based on sequential quantum channels for iterative QPE. We find that QPE of multiple eigenvalues can be efficiently realized for arbitrary initial target system state by actively utilizing the measurement backaction of iterative QPE on the target system with a long coherence time. Specifically, we investigate two iterative QPE schemes based on sequential Ramsey interferometry measurements (RIMs) of an ancilla qubit: (a) the repetitive scheme, which conducts repetitive RIMs to achieve the standard quantum limit in estimating the eigenvalues; (b) the adaptive scheme, which adjusts the parameters of each RIM based on prior measurement outcomes to attain the Heisenberg limit. In both schemes, sequential ancilla measurements generate sequential quantum channels on the target system, gradually steering it to the eigenstates of the estimated unitary operator, while the measurement statistics of the ancilla can reveal the embedded information about its eigenvalues with proper postprocessing. We demonstrate the analysis by simulating a central spin model and evaluate the performance and noise resilience of both schemes.

arXiv:2308.02307•Physical Review A•Feb 6, 2025•4 citations

Multi-step evolution and measurement control of finite-dimensional quantum systems

Wenfeng Liu, Chenbin Zhang, Zonghai Chen

For finite-dimensional quantum systems, we propose a quantum control scheme based on a multi-step unitary evolution and quantum projective measurements. The objective is to design a control law to steer the system to a target eigenstate of the measurement operator in the least number of steps. Within each control step, unitary evolution and quantum projective measurement are performed in turn until the system reaches the target state. The control process can be modeled as a finite-state Markov chain with an absorbing state. We prove that the controlled system will converge to the target eigenstate with probability one after a finite number of control steps and find a minimal-step-number condition that would steer the system to the target eigenstate in the least number of steps.

Chinese Science Bulletin•Apr 22, 2012•5 citations

Fourier-based quantum signal processing

Thais de Lima Silva, Borges, Lucas, Leandro Aolita

Implementing general functions of operators is a powerful tool in quantum computation. It can be used as the basis for a variety of quantum algorithms including matrix inversion, real and imaginary-time evolution, and matrix powers. Quantum signal processing is the state of the art for this aim, assuming that the operator to be transformed is given as a block of a unitary matrix acting on an enlarged Hilbert space. Here we present an algorithm for Hermitian-operator function design from an oracle given by the unitary evolution with respect to that operator at a fixed time. Our algorithm implements a Fourier approximation of the target function based on the iteration of a basic sequence of single-qubit gates, for which we prove the expressibility. In addition, we present an efficient classical algorithm for calculating its parameters from the Fourier series coefficients. Our algorithm uses only one qubit ancilla regardless the degree of the approximating series. This contrasts with previous proposals, which required an ancillary register of size growing with the expansion degree. Our methods are compatible with Trotterised Hamiltonian simulations schemes and hybrid digital-analog approaches.

arXiv:2206.02826•Jun 6, 2022•24 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
We propose a quantum algorithm for projecting a quantum system to eigenstates of any Hermitian operator, provided one can access the associated control-unitary evolution for the ancilla and the system, as well as the measurement of the controlling ancillary qubit. Such a Hadamard-test-like primitive is iterated so as to achieve the spectral projection, and the distribution of the projected eigenstates obeys the Born rule. This algorithm can be used as a subroutine in the quantum annealing procedure by measurement to drive the system to the ground state of a final Hamiltonian, and we simulate this for quantum many-body spin chains.
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary qubit, by introducing a resonance mechanism between the ancilla qubit and the system, and combined with measurements performed on the ancilla qubit, the system can be evolved to monotonically converge to its ground state through an iterative procedure. We have simulated the application of this algorithm for the Afflect-Kennedy-Lieb-Tasaki model, whose ground state can be used as resource state in one-way quantum computation.
Abstract We propose an algorithm to create an arbitrary n -qubit pure quantum superposition state with precision of m -decimals (binary representation) for each probability amplitude. The algorithm uses one-qubit rotations, Hadamard transformations and, C-NOT operations with multi-qubit controls. The depth of the circuit is O (2 n n ), its space is O ( n ). We emphasize that the parameters of the utilized unitary transformations are predicted in advance by the required precision and therefore there is no classical calculation supplementing this quantum algorithm. Finalizing the state-creation we perform the measurement of the ancilla state with a certain desired output with the purpose of removing all the garbage from the created superposition state. If n and m are independent and n ≫ m , the probability of access to the desired ancilla-state (success probability) is ~ 2 −n , which requires O (2 n ) runs of the algorithm and leads to the overall depth O (4 n n ). However, the situation can be significantly improved by replacing the usual measurement with the controlled measurement of the ancilla state that, first of all, removes the garbage part of the superposition state and, second (and most important), allows to avoid both the problem of small success probability to the desired ancilla state and multiple runs of the algorithm. As a consequence, the depth of the algorithm is O (2 n n ) in this case. If m serves to provide the required fidelity of state approximation, then the above parameters increase. This algorithm can be a subroutine generating the required input state in various algorithms, in particular, in matrix-manipulation algorithms developed earlier.
Quantum phase estimation (QPE) is a crucial subroutine in many quantum algorithms. It is used to estimate the eigenvalues of a unitary operator acting on a target quantum system. Conventional QPE is often expensive to implement because it requires a large number of ancilla qubits and the ability to perform quantum Fourier transform. Recent developments in iterative QPE reduce the implementation cost by repetitive uses of a single ancilla and classical postprocessing. However, both conventional and iterative schemes often require preparation of the target system in an eigenstate of the unitary operator, while it remains ambiguous to achieve QPE of multiple eigenvalues with no need of initial-state preparation. Here we clarify this issue by developing a theoretical framework based on sequential quantum channels for iterative QPE. We find that QPE of multiple eigenvalues can be efficiently realized for arbitrary initial target system state by actively utilizing the measurement backaction of iterative QPE on the target system with a long coherence time. Specifically, we investigate two iterative QPE schemes based on sequential Ramsey interferometry measurements (RIMs) of an ancilla qubit: (a) the repetitive scheme, which conducts repetitive RIMs to achieve the standard quantum limit in estimating the eigenvalues; (b) the adaptive scheme, which adjusts the parameters of each RIM based on prior measurement outcomes to attain the Heisenberg limit. In both schemes, sequential ancilla measurements generate sequential quantum channels on the target system, gradually steering it to the eigenstates of the estimated unitary operator, while the measurement statistics of the ancilla can reveal the embedded information about its eigenvalues with proper postprocessing. We demonstrate the analysis by simulating a central spin model and evaluate the performance and noise resilience of both schemes.
For finite-dimensional quantum systems, we propose a quantum control scheme based on a multi-step unitary evolution and quantum projective measurements. The objective is to design a control law to steer the system to a target eigenstate of the measurement operator in the least number of steps. Within each control step, unitary evolution and quantum projective measurement are performed in turn until the system reaches the target state. The control process can be modeled as a finite-state Markov chain with an absorbing state. We prove that the controlled system will converge to the target eigenstate with probability one after a finite number of control steps and find a minimal-step-number condition that would steer the system to the target eigenstate in the least number of steps.
Implementing general functions of operators is a powerful tool in quantum computation. It can be used as the basis for a variety of quantum algorithms including matrix inversion, real and imaginary-time evolution, and matrix powers. Quantum signal processing is the state of the art for this aim, assuming that the operator to be transformed is given as a block of a unitary matrix acting on an enlarged Hilbert space. Here we present an algorithm for Hermitian-operator function design from an oracle given by the unitary evolution with respect to that operator at a fixed time. Our algorithm implements a Fourier approximation of the target function based on the iteration of a basic sequence of single-qubit gates, for which we prove the expressibility. In addition, we present an efficient classical algorithm for calculating its parameters from the Fourier series coefficients. Our algorithm uses only one qubit ancilla regardless the degree of the approximating series. This contrasts with previous proposals, which required an ancillary register of size growing with the expansion degree. Our methods are compatible with Trotterised Hamiltonian simulations schemes and hybrid digital-analog approaches.
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.