Quantum Information and Computation

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

JanzingDominik

Published Apr 1, 2002• 0 citations

Publisher

Abstract

DOI: 10.5555/2011430.2011433

Related papers

Optimal Coherent Quantum Phase Estimation via Tapering

Yiğit Subaşı

Given query access to a unitary and its controlled version where and an initial state , output a state where .This implies that if the ancilla register is measured, a -close estimate is output with probability at least .

Jun 10, 20241 citation

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

Dominik Janzing

arXiv:quant-ph/0108052Quantum Information and ComputationApr 1, 20028 citations

Measuring the non-abelian quantum phase with the algorithm of quantum phase estimation

Seng Ghee Tan, Son-Hsien Chen, Yaocheng Yang +3 more

arXiv:2509.07716Physics Letters AJul 18, 20260 citations

A simpler algorithm to mark the unknown eigenstates

Avatar Tulsi

arXiv:1611.02680Nov 8, 20160 citations

Quantum phase estimation with noisy qubits

Thomas E. O’Brien, Barbara M. Terhal

Bulletin of the American Physical SocietyMar 8, 20180 citations

Towards Experimental Implementation of Adaptive Measurements for Efficient Qubit Phase Estimation

Soumya Pani, Marco A. Rodríguez-García, Isaac Pérez Castillo +2 more

We work towards the experimental implementation of an adaptive quantum measurement for single-qubit phase estimation that can theoretically achieve the quantum bound over the entire range of phases [0,2π].

Quantum 2.0 Conference and ExhibitionJan 1, 20230 citations

Quantum Information and Computation

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

JanzingDominik

Published Apr 1, 2002• 0 citations

Publisher

Abstract

DOI: 10.5555/2011430.2011433

Related papers

Optimal Coherent Quantum Phase Estimation via Tapering

Yiğit Subaşı

Jun 10, 20241 citation

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

Dominik Janzing

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.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.

arXiv:quant-ph/0108052Quantum Information and ComputationApr 1, 20028 citations

Measuring the non-abelian quantum phase with the algorithm of quantum phase estimation

Seng Ghee Tan, Son-Hsien Chen, Yaocheng Yang +3 more

arXiv:2509.07716Physics Letters AJul 18, 20260 citations

A simpler algorithm to mark the unknown eigenstates

Avatar Tulsi

For an unknown eigenstate $|ψ\rangle$ of a unitary operator $U$ , suppose we have an estimate of the corresponding eigenvalue which is separated from all other eigenvalues by a minimum gap of magnitude $Δ$ . In the eigenstate-marking problem (EMP), the goal is to implement a selective phase transformation of the $|ψ\rangle$ state (known as \emph{marking} the $|ψ\rangle$ state in the language of the quantum search algorithms). The EMP finds important applications in the construction of several quantum algorithms. The best known algorithm for the EMP combines the ideas of the phase estimation algorithm and the majority-voting. It uses $Θ(\frac{1}Δ\ln \frac{1}ε)$ applications of $U$ where $ε$ is the tolerable error. It needs $Θ\left(\ln \frac{1}Δ\right)$ ancilla qubits for the phase estimation and another $Θ\left(\ln \frac{1}ε\right)$ ancilla qubits for the majority-voting. In this paper, we show that the majority-voting is not a crucial requirement for the EMP and the same purpose can also be achieved using the fixed-point quantum search algorithm which does not need any ancilla qubits. In the case of majority-voting, these ancilla qubits were needed to do controlled transformations which are harder to implement physically. Using fixed-point quantum search, we get rid off these $Θ\left(\ln \frac{1}ε\right)$ ancilla qubits and same number of controlled transformations. Thus we get a much simpler algorithm for marking the unknown eigenstates. However, the required number of applications of $U$ increases by the factor of $Θ\left(\ln \frac{1}ε\right)$ . This tradeoff can be beneficial in typical situations where spatial resources are more constrained or where the controlled transformations are very expensive.For an unknown eigenstate $|ψ\rangle$ of a unitary operator $U$, suppose we have an estimate of the corresponding eigenvalue which is separated from all other eigenvalues by a minimum gap of magnitude $Δ$. In the eigenstate-marking problem (EMP), the goal is to implement a selective phase transformation of the $|ψ\rangle$ state (known as \emph{marking} the $|ψ\rangle$ state in the language of the quantum search algorithms). The EMP finds important applications in the construction of several quantum algorithms. The best known algorithm for the EMP combines the ideas of the phase estimation algorithm and the majority-voting. It uses $Θ(\frac{1}Δ\ln \frac{1}ε)$ applications of $U$ where $ε$ is the tolerable error. It needs $Θ\left(\ln \frac{1}Δ\right)$ ancilla qubits for the phase estimation and another $Θ\left(\ln \frac{1}ε\right)$ ancilla qubits for the majority-voting. In this paper, we show that the majority-voting is not a crucial requirement for the EMP and the same purpose can also be achieved using the fixed-point quantum search algorithm which does not need any ancilla qubits. In the case of majority-voting, these ancilla qubits were needed to do controlled transformations which are harder to implement physically. Using fixed-point quantum search, we get rid off these $Θ\left(\ln \frac{1}ε\right)$ ancilla qubits and same number of controlled transformations. Thus we get a much simpler algorithm for marking the unknown eigenstates. However, the required number of applications of $U$ increases by the factor of $Θ\left(\ln \frac{1}ε\right)$. This tradeoff can be beneficial in typical situations where spatial resources are more constrained or where the controlled transformations are very expensive.

arXiv:1611.02680Nov 8, 20160 citations

Quantum phase estimation with noisy qubits

Thomas E. O’Brien, Barbara M. Terhal

Bulletin of the American Physical SocietyMar 8, 20180 citations

Towards Experimental Implementation of Adaptive Measurements for Efficient Qubit Phase Estimation

Soumya Pani, Marco A. Rodríguez-García, Isaac Pérez Castillo +2 more

Quantum 2.0 Conference and ExhibitionJan 1, 20230 citations

For an unknown eigenstate

|ψ\rangle

of a unitary operator

U

, suppose we have an estimate of the corresponding eigenvalue which is separated from all other eigenvalues by a minimum gap of magnitude

Δ

. In the eigenstate-marking problem (EMP), the goal is to implement a selective phase transformation of the

|ψ\rangle

state (known as \emph{marking} the

|ψ\rangle

state in the language of the quantum search algorithms). The EMP finds important applications in the construction of several quantum algorithms. The best known algorithm for the EMP combines the ideas of the phase estimation algorithm and the majority-voting. It uses

Θ(\frac{1}Δ\ln \frac{1}ε)

applications of

U

where

ε

is the tolerable error. It needs

Θ\left(\ln \frac{1}Δ\right)

ancilla qubits for the phase estimation and another

Θ\left(\ln \frac{1}ε\right)

ancilla qubits for the majority-voting. In this paper, we show that the majority-voting is not a crucial requirement for the EMP and the same purpose can also be achieved using the fixed-point quantum search algorithm which does not need any ancilla qubits. In the case of majority-voting, these ancilla qubits were needed to do controlled transformations which are harder to implement physically. Using fixed-point quantum search, we get rid off these

Θ\left(\ln \frac{1}ε\right)

ancilla qubits and same number of controlled transformations. Thus we get a much simpler algorithm for marking the unknown eigenstates. However, the required number of applications of

U

increases by the factor of

Θ\left(\ln \frac{1}ε\right)

. This tradeoff can be beneficial in typical situations where spatial resources are more constrained or where the controlled transformations are very expensive.