5 papers
Demonstration of Exponential Quantum Speedup with Constant-Depth Compiled Circuits for Simon's Problem
Phattharaporn Singkanipa, Victor Kasatkin, Daniel A. Lidar
We demonstrate exponential algorithmic quantum speedup for a restricted-Hamming-weight version of Simon's problem, in which the hidden string is promised to satisfy $\text{HW}(…
Proof of the Error Scaling for Universally Robust Dynamical Decoupling Sequences
Domenico D'Alessandro, Phattharaporn Singkanipa, Daniel Lidar
Universally robust dynamical decoupling (UR) sequences were proposed to compensate pulse imperfections arising from arbitrary experimental parameters while achieving high-order…
Families of 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions
Phattharaporn Singkanipa, Zihan Xia, Daniel A. Lidar
In the absence of fault tolerant quantum error correction for analog, Hamiltonian quantum computation, error suppression via energy penalties is an effective alternative. We constr…
Beyond unital noise in variational quantum algorithms: noise-induced barren plateaus and limit sets
P. Singkanipa, D. A. Lidar
Variational quantum algorithms (VQAs) hold much promise but face the challenge of exponentially small gradients. Unmitigated, this barren plateau (BP) phenomenon leads to an expone…
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…