Tight Bounds for Quantum Phase Estimation and Related Problems
Quantum 10, 2140 (2026). Phase estimation, due to Kitaev [ 17 ], is one of the most fundamental subroutines in quantum computing. In the basic scenario, one is given black-box access to a unitary…
Read the full articleYou might also wanna read
New bounds dramatically reduce measurement requirements for quantum simulations
Previously, simulating open quantum systems with the Wave Matrix Lindbladization algorithm required computational effort scaling with the sy
iq.fp2.dev·1mo ago
Quantum Algorithm Achieves Worst-Case Optimal Polynomial Intersection Beyond DQI Regime
The Optimal Polynomial Intersection (OPI) problem asks us to find a low-degree polynomial over a finite field whose values lie in prescribed
arxiv.org·1h ago
Quantum iterative framework combining QPE and Grover's algorithm for the Traveling Salesman Problem
The Traveling Salesman Problem (TSP) is a classical NP-hard problem in combinatorial optimization, where determining the shortest route amon
iq.fp2.dev·1mo agoVerification of Quantum Computations: Hardware-Efficient Security Proofs
How can a user with limited quantum resources verify the output of an untrusted, fully quantum server? This manuscript provides a conceptual
iq.fp2.dev·9d ago
Alternative adiabatic quantum dynamics for gate-based quantum computing with applications to quantum linear systems
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the n
arxiv.org·1mo ago
Quantum state distinguishability in noisy scrambled ensembles exhibits phase-transition behavior
Quantum state distinguishability is a fundamental concept in quantum information science that underpins a wide range of important practical
arxiv.org·1mo ago
Comments
Sign in to join the conversation.
No comments yet. Be the first.