Iterative quantum phase estimation with cQED encoding
- URL: http://arxiv.org/abs/2606.22071v1
- Date: Sat, 20 Jun 2026 14:45:05 GMT
- Title: Iterative quantum phase estimation with cQED encoding
- Abstract summary: Quantum phase estimation is a cornerstone algorithm for determining eigenvalues of unitary operators or Hamiltonians.<n>We propose a conceptually simple and experimentally feasible alternative that exploits the toolbox of circuit quantum electrodynamics.<n>A bosonic mode serves as an efficient quantum memory in which the binary digits of the phase are encoded into the direction of phase-space rotations.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum phase estimation is a cornerstone algorithm for determining eigenvalues of unitary operators or Hamiltonians with Heisenberg-limited precision. Conventional implementations rely on deep controlled-unitary operations together with an inverse quantum Fourier transform, resulting in substantial circuit depth and hardware overhead. Here, we propose a conceptually simple and experimentally feasible alternative that exploits the toolbox of circuit quantum electrodynamics. The protocol extracts the phase through a sequence of binary threshold tests, eliminating the need for an inverse quantum Fourier transform. A bosonic mode serves as an efficient quantum memory in which the binary digits of the phase are encoded into the direction of phase-space rotations. These digits are then read out sequentially via high-fidelity homodyne measurements. We show that the protocol achieves Heisenberg scaling in estimation precision while simultaneously providing exponentially suppressed failure probability. By replacing the ancillary circuit with a bosonic degree of freedom, the scheme significantly reduces hardware complexity and offers a practical route toward implementing high-precision quantum phase estimation on circuit quantum electrodynamics platforms.
Related papers
- Deterministic Quantum Phase Estimation with Linear Circuit Complexity in a Photonic System [4.969716969054012]
Quantum algorithms solve certain computational problems faster than the best known classical algorithms.<n>We introduce a QPE algorithm that successfully reduces the circuit complexity from $mathcalO(n2)$ to $mathcalO(n)$ for a special class of unitary operators.
arXiv Detail & Related papers (2026-07-15T03:02:14Z) - Two Variations of Quantum Phase Estimation for Reducing Circuit Error Rates: Application to the Harrow--Hassidim--Lloyd Algorithm [1.3797901915908073]
We introduce two variations of the quantum phase estimation algorithm.<n>We integrate them into a hybrid quantum-classical implementation of the Harrow--Hassidim--Lloyd algorithm for solving linear systems.
arXiv Detail & Related papers (2025-07-09T10:08:50Z) - Digital quantum simulation of squeezed states via enhanced bosonic encoding in a superconducting quantum processor [33.56337116542515]
We present a fully digital approach for simulating single-mode squeezed states on a superconducting quantum processor.<n>By mapping up to 2n photonic Fock states onto n qubits, our framework leverages Gray-code-based encodings to reduce gate overhead.<n>We further optimize resource usage by restricting the simulation on Fock states with even number of photons only.
arXiv Detail & Related papers (2025-05-16T06:02:25Z) - Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [36.94429692322632]
We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
arXiv Detail & Related papers (2024-11-25T20:33:47Z) - Optimal Low-Depth Quantum Signal-Processing Phase Estimation [0.029541734875307393]
Quantum effects like entanglement can be used to drastically enhance the accuracy of quantum parameter estimation beyond classical limits.<n>We introduce Quantum Signal-Processing Phase Estimation algorithms that are robust against these challenges.<n>Our approach achieves a standard deviation accuracy of $10-4$ radians for estimating unwanted swap angles in superconducting two-qubit experiments.
arXiv Detail & Related papers (2024-06-17T10:33:52Z) - Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
arXiv Detail & Related papers (2024-05-03T17:32:55Z) - Simulating electronic structure on bosonic quantum computers [34.84696943963362]
We propose an approach to map the electronic Hamiltonian into a qumode bosonic problem that can be solved on bosonic quantum devices.<n>This work establishes a new pathway for simulating many-fermion systems, highlighting the potential of hybrid qubit-qumode quantum devices.
arXiv Detail & Related papers (2024-04-16T02:04:11Z) - Reductive Quantum Phase Estimation [0.0]
We show a circuit that distinguishes an arbitrary set of phases with a fewer number of qubits and unitary applications.
We show a trade-off between measurement precision and phase distinguishability, which allows one to tune the circuit to be optimal for a specific application.
arXiv Detail & Related papers (2024-02-06T23:38:36Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Benchmarking universal quantum gates via channel spectrum [0.0]
Noise remains the major obstacle to scalable quantum computation.
We propose a method to infer the noise properties of the target gate, including process fidelity, fidelity, and some unitary parameters, from the eigenvalues of its noisy channel.
Our method is insensitive to state-preparation and measurement errors, and importantly, can benchmark universal gates and is scalable to many-qubit systems.
arXiv Detail & Related papers (2023-01-05T13:18:19Z) - Quantum emulation of the transient dynamics in the multistate
Landau-Zener model [50.591267188664666]
We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity.
Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
arXiv Detail & Related papers (2022-11-26T15:04:11Z) - Quantum Phase Processing and its Applications in Estimating Phase and
Entropies [10.8525801756287]
"quantum phase processing" can directly apply arbitrary trigonometric transformations to eigenphases of a unitary operator.
Quantum phase processing can extract the eigen-information of quantum systems by simply measuring the ancilla qubit.
We propose a new quantum phase estimation algorithm without quantum Fourier transform, which requires the fewest ancilla qubits and matches the best performance so far.
arXiv Detail & Related papers (2022-09-28T17:41:19Z) - Experimental Realization of Nonadiabatic Holonomic Single-Qubit Quantum
Gates with Two Dark Paths in a Trapped Ion [41.36300605844117]
We show nonadiabatic holonomic single-qubit quantum gates on two dark paths in a trapped $171mathrmYb+$ ion based on four-level systems with resonant drives.
We find that nontrivial holonomic two-qubit quantum gates can also be realized within current experimental technologies.
arXiv Detail & Related papers (2021-01-19T06:57:50Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.