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:quant-ph/0108052 · Quantum Information and Computation

Quantum algorithm for measuring the energy of n qubits with unknown pair-interactions

Dominik Janzing

Published Apr 1, 2002• 11 citations
arXivHTMLPDF

Abstract

The well-known algorithm for quantum phase estimation requires that the considered unitary is available as a conditional transformation depending on the quantum state of an ancilla register. We present an algorithm converting an unknown n-qubit pair-interaction Hamiltonian into a conditional one such that standard phase estimation can be applied to measure the energy. Our essential assumption is that the considered system can be brought into interaction with a quantum computer. For large n the algorithm could still be applicable for estimating the density of energy states and might therefore be useful for finding energy gaps in solid states.

DOI
10.26421/qic2.3-3

Related papers

Quantum algorithm for finding periodicities in the spectrum of a black-box Hamiltonian or unitary transformation

Dominik Janzing, Thomas Beth

Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure eigenvalues of U\otimes U^\dagger even in this case. Running the algorithm several times allows therefore to estimate the autocorrelation function of the density of eigenstates of U. This can be applied to find periodicities in the energy spectrum of a quantum system with unknown Hamiltonian if it can be coupled to a quantum computer.

arXiv:quant-ph/0108053•Aug 10, 2001•6 citations

Quantum algorithm for measuring the eigenvalues of UÄU-1 for a black-box unitary transformation U

Dominik Janzing, T. Beth

Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure eigenvalues of U\otimesU^\deggar even in this case. Running the algorithm several times allows therefore to estimate the autocorrelation function of the density of eigenstates of U. This can be applied to find periodicities in the energy spectrum of a quantum system with unknown Hamiltonian if it can be coupled to a quantum computer.

Quantum Information and Computation•Apr 1, 2002•1 citation

Quantum phase processing and its applications in estimating phase and entropies

Youle Wang, Lei Zhang, Zhan Yu +1 more

Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates and make quantum algorithms fundamentally different from their classical counterparts. Based on this unique principle of quantum computing, we develop an algorithmic toolbox, quantum phase processing, that can directly apply arbitrary trigonometric transformations to eigenphases of a unitary operator. The quantum phase processing circuit is constructed simply, consisting of single-qubit rotations and controlled unitaries, typically using only one ancilla qubit. Besides the capability of phase transformation, quantum phase processing in particular can extract the eigeninformation of quantum systems by simply measuring the ancilla qubit, making it naturally compatible with indirect measurement. Quantum phase processing complements another powerful framework known as quantum singular value transformation and leads to more intuitive and efficient quantum algorithms for solving problems that are particularly phase related. As a notable application, we propose a quantum phase estimation algorithm without quantum Fourier transform, which requires the fewest ancilla qubits and matches the best performance so far. We further exploit the power of our method by investigating a plethora of applications in Hamiltonian simulation, entanglement spectroscopy, and quantum entropy estimation, demonstrating improvements or optimality for almost all cases.

arXiv:2209.14278•Physical Review A•Dec 13, 2023•50 citations

Faster ground state preparation and high-precision ground energy estimation with fewer qubits

Yimin Ge, Jordi Tura, J. I. Cirac

We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear system problem. We show that, compared to algorithms based on phase estimation, the runtime of our algorithm is exponentially better as a function of the allowed error, and at least quadratically better as a function of the overlap with the trial state. We also show that our algorithm requires fewer ancilla qubits than existing algorithms, making it attractive for early applications of small quantum computers. Additionally, it can be used to determine an unknown ground energy faster than with phase estimation if a very high precision is required.

arXiv:1712.03193•Journal of Mathematical Physics•Feb 1, 2019•187 citations

Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude Estimation

Patrick Rall

We consider performing phase estimation under the following conditions: we are given only one copy of the input state, the input state does not have to be an eigenstate of the unitary, and the state must not be measured. Most quantum estimation algorithms make assumptions that make them unsuitable for this 'coherent' setting, leaving only the textbook approach. We present novel algorithms for phase, energy, and amplitude estimation that are both conceptually and computationally simpler than the textbook method, featuring both a smaller query complexity and ancilla footprint. They do not require a quantum Fourier transform, and they do not require a quantum sorting network to compute the median of several estimates. Instead, they use block-encoding techniques to compute the estimate one bit at a time, performing all amplification via singular value transformation. These improved subroutines accelerate the performance of quantum Metropolis sampling and quantum Bayesian inference.

arXiv:2103.09717•Quantum•Oct 19, 2021•57 citations

Theory of quantum measurement of energy : Quantum algorithm and its evaluation

Shojun Nakayama

According to the axioms of quantum mechanics, there exists a quantum measurement corresponding to each observable.Energy is one of such observables, and the operator of the energy is called Hamiltonian.The Hamiltonian specifies the dynamics of closed quantum systems and it also characterizes the property of the equilibrium state in contact with a heat bath.Therefore the energy is an essential quantity in quantum mechanics, which characterizes behavior of a quantum system.On the other hand, since the Hamiltonian is not a local observable in general, a concrete construction of how to apply the quantum measurement of energy is not trivial.Thus various measurement models of energies have been proposed, and also discussions have been made on whether the time is a resource to be consumed to increase the precision of energy measurement in connection with the time-energy uncertainty relationship.Constructing a way to implement the energy measurement on an unknown Hamiltonian system is important, since it avoids constructing a new measurement scheme for each new quantum system.On the other hand, among measurements of energy, the projective measurement of energy has useful properties for applications.The projective measurement is a measurement which satisfies the condition so-called repeatable hypothesis that when we measure the state immediately after obtaining an outcome from the same measurement, we obtain the same outcome again.In this thesis, we consider two schemes to implement the projective measurement of energy for an unknown Hamiltonian system.One is a tomography based method, which is a construction suggested in the paper of Aharanov et.al. (2002).The other is the phase estimation based method, which utilizes the Hamiltonian dynamics of the system as a resource for the quantum algorithm, and realizes the projective measurement of energy on the system without identifying all parameters of the Hamiltonian.In this thesis, we assume there is a finite dimensional quantum system (quantum computer) which is able to apply any interaction between the target system and the finite dimensional system although the interaction should not depend on the target system Hamiltonian.To evaluate the performance of the measurements implemented by the two schemes, we formulate two evaluation functions called fluctuation of measurement value and non-repeatability, which can evaluate how much a measurement is different from the ideal projective measurement of an observable.We calculate a sufficient time to guarantee the fluctuation of measurement value below some small value ε, for each of the two measurement schemes.We find that the tomography based method takes the time proportional to O(d 4 ∆ max /ε), while the phase estimation based method takes O(∆ 3 max /ε 2 ), where d is the dimension of the target system and ∆ max is the difference between the largest energy eigenvalue and the smallest energy eigenvalue.We show that the phase estimation based method performs better for large particle systems.

•Mar 24, 2014•0 citations
The well-known algorithm for quantum phase estimation requires that the considered unitary is available as a conditional transformation depending on the quantum state of an ancilla register. We present an algorithm converting an unknown n-qubit pair-interaction Hamiltonian into a conditional one such that standard phase estimation can be applied to measure the energy. Our essential assumption is that the considered system can be brought into interaction with a quantum computer. For large n the algorithm could still be applicable for estimating the density of energy states and might therefore be useful for finding energy gaps in solid states.
Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure eigenvalues of U\otimes U^\dagger even in this case. Running the algorithm several times allows therefore to estimate the autocorrelation function of the density of eigenstates of U. This can be applied to find periodicities in the energy spectrum of a quantum system with unknown Hamiltonian if it can be coupled to a quantum computer.
Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure eigenvalues of U\otimesU^\deggar even in this case. Running the algorithm several times allows therefore to estimate the autocorrelation function of the density of eigenstates of U. This can be applied to find periodicities in the energy spectrum of a quantum system with unknown Hamiltonian if it can be coupled to a quantum computer.
Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates and make quantum algorithms fundamentally different from their classical counterparts. Based on this unique principle of quantum computing, we develop an algorithmic toolbox, quantum phase processing, that can directly apply arbitrary trigonometric transformations to eigenphases of a unitary operator. The quantum phase processing circuit is constructed simply, consisting of single-qubit rotations and controlled unitaries, typically using only one ancilla qubit. Besides the capability of phase transformation, quantum phase processing in particular can extract the eigeninformation of quantum systems by simply measuring the ancilla qubit, making it naturally compatible with indirect measurement. Quantum phase processing complements another powerful framework known as quantum singular value transformation and leads to more intuitive and efficient quantum algorithms for solving problems that are particularly phase related. As a notable application, we propose a quantum phase estimation algorithm without quantum Fourier transform, which requires the fewest ancilla qubits and matches the best performance so far. We further exploit the power of our method by investigating a plethora of applications in Hamiltonian simulation, entanglement spectroscopy, and quantum entropy estimation, demonstrating improvements or optimality for almost all cases.
We propose a general-purpose quantum algorithm for preparing ground states of quantum Hamiltonians from a given trial state. The algorithm is based on techniques recently developed in the context of solving the quantum linear system problem. We show that, compared to algorithms based on phase estimation, the runtime of our algorithm is exponentially better as a function of the allowed error, and at least quadratically better as a function of the overlap with the trial state. We also show that our algorithm requires fewer ancilla qubits than existing algorithms, making it attractive for early applications of small quantum computers. Additionally, it can be used to determine an unknown ground energy faster than with phase estimation if a very high precision is required.
We consider performing phase estimation under the following conditions: we are given only one copy of the input state, the input state does not have to be an eigenstate of the unitary, and the state must not be measured. Most quantum estimation algorithms make assumptions that make them unsuitable for this 'coherent' setting, leaving only the textbook approach. We present novel algorithms for phase, energy, and amplitude estimation that are both conceptually and computationally simpler than the textbook method, featuring both a smaller query complexity and ancilla footprint. They do not require a quantum Fourier transform, and they do not require a quantum sorting network to compute the median of several estimates. Instead, they use block-encoding techniques to compute the estimate one bit at a time, performing all amplification via singular value transformation. These improved subroutines accelerate the performance of quantum Metropolis sampling and quantum Bayesian inference.
According to the axioms of quantum mechanics, there exists a quantum measurement corresponding to each observable.Energy is one of such observables, and the operator of the energy is called Hamiltonian.The Hamiltonian specifies the dynamics of closed quantum systems and it also characterizes the property of the equilibrium state in contact with a heat bath.Therefore the energy is an essential quantity in quantum mechanics, which characterizes behavior of a quantum system.On the other hand, since the Hamiltonian is not a local observable in general, a concrete construction of how to apply the quantum measurement of energy is not trivial.Thus various measurement models of energies have been proposed, and also discussions have been made on whether the time is a resource to be consumed to increase the precision of energy measurement in connection with the time-energy uncertainty relationship.Constructing a way to implement the energy measurement on an unknown Hamiltonian system is important, since it avoids constructing a new measurement scheme for each new quantum system.On the other hand, among measurements of energy, the projective measurement of energy has useful properties for applications.The projective measurement is a measurement which satisfies the condition so-called repeatable hypothesis that when we measure the state immediately after obtaining an outcome from the same measurement, we obtain the same outcome again.In this thesis, we consider two schemes to implement the projective measurement of energy for an unknown Hamiltonian system.One is a tomography based method, which is a construction suggested in the paper of Aharanov et.al. (2002).The other is the phase estimation based method, which utilizes the Hamiltonian dynamics of the system as a resource for the quantum algorithm, and realizes the projective measurement of energy on the system without identifying all parameters of the Hamiltonian.In this thesis, we assume there is a finite dimensional quantum system (quantum computer) which is able to apply any interaction between the target system and the finite dimensional system although the interaction should not depend on the target system Hamiltonian.To evaluate the performance of the measurements implemented by the two schemes, we formulate two evaluation functions called fluctuation of measurement value and non-repeatability, which can evaluate how much a measurement is different from the ideal projective measurement of an observable.We calculate a sufficient time to guarantee the fluctuation of measurement value below some small value ε, for each of the two measurement schemes.We find that the tomography based method takes the time proportional to O(d 4 ∆ max /ε), while the phase estimation based method takes O(∆ 3 max /ε 2 ), where d is the dimension of the target system and ∆ max is the difference between the largest energy eigenvalue and the smallest energy eigenvalue.We show that the phase estimation based method performs better for large particle systems.