most citedDemonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

7 citations

5 papers

quant-ph2025★ 1 cited

Demonstration of High-Fidelity Entangled Logical Qubits using Transmons

Arian Vezvaee, Vinay Tripathi, Mario Morford-Oberst +3

Quantum error correction (QEC) codes are necessary to fault-tolerantly operate quantum computers. However, every such code is inherently limited by its inability to detect logical…

quant-ph2025★ 3 cited

Real-time Sign-Problem-Suppressed Quantum Monte Carlo Algorithm For Noisy Quantum Circuit Simulations

Tong Shen, Daniel A. Lidar

We present a real-time quantum Monte Carlo algorithm that simulates the dynamics of open quantum systems by stochastically compressing and evolving the density matrix under both Ma…

quant-ph2024★ 4 cited

Beating the Ramsey limit on sensing with deterministic qubit control

M. O. Hecht, Kumar Saurav, Evangelos Vlachos +2

Quantum sensors promise revolutionary advances in medical imaging, energy production, mass detection, geodesy, foundational physics research, and a host of other fields. In many se…

quant-ph2024★ 4 cited

Efficient Chromatic-Number-Based Multi-Qubit Decoherence and Crosstalk Suppression

Amy F. Brown, Daniel A. Lidar

The performance of quantum computers is hindered by decoherence and crosstalk, which cause errors and limit the ability to perform long computations. Dynamical decoupling is a tech…

quant-ph2024★ 7 cited

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

P. Singkanipa, V. Kasatkin, Z. Zhou +2

Simon's problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was pr…