Estimating a quantum phase is a necessary task in a wide range of fields of quantum science. To accomplish this task, two well-known methods have been developed in distinct contexts, namely, Ramsey interferometry (RI) in atomic and molecular physics and quantum phase estimation (QPE) in quantum computing. We demonstrate that these canonical examples are instances of a larger class of phase estimation protocols, which we call reductive quantum phase estimation (RQPE) circuits. Here, we present an explicit algorithm that allows one to create an RQPE circuit. This circuit distinguishes an arbitrary set of phases with a smaller number of qubits and unitary applications, thereby solving a general class of quantum hypothesis testing to which RI and QPE belong. We further demonstrate a tradeoff between measurement precision and phase distinguishability, which allows one to tune the circuit to be optimal for a specific application.
- Award ID(s):
- 1828489
- PAR ID:
- 10359553
- Date Published:
- Journal Name:
- Physical Review Letters
- Volume:
- 127
- Issue:
- 24
- ISSN:
- 0031-9007
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Published by the American Physical Society 2024 -
Abstract We introduce a new statistical and variational approach to the phase estimation algorithm (PEA). Unlike the traditional and iterative PEAs which return only an eigenphase estimate, the proposed method can determine any unknown eigenstate–eigenphase pair from a given unitary matrix utilizing a simplified version of the hardware intended for the iterative PEA (IPEA). This is achieved by treating the probabilistic output of an IPEA-like circuit as an eigenstate–eigenphase proximity metric, using this metric to estimate the proximity of the input state and input phase to the nearest eigenstate–eigenphase pair and approaching this pair via a variational process on the input state and phase. This method may search over the entire computational space, or can efficiently search for eigenphases (eigenstates) within some specified range (directions), allowing those with some prior knowledge of their system to search for particular solutions. We show the simulation results of the method with the Qiskit package on the IBM Q platform and on a local computer.