34 citations · 129 across the 17 of their papers we have counts for
17 papers
Surrogate-based optimization for variational quantum algorithms
Ryan Shaffer, Lucas Kocia, Mohan Sarovar
Variational quantum algorithms are a class of techniques intended to be used on near-term quantum computers. The goal of these algorithms is to perform large quantum computations b…
More Optimal Simulation of Universal Quantum Computers
Lucas Kocia, Genele Tulloch
Validating whether a quantum device confers a computational advantage often requires classical simulation of its outcomes. The worst-case sampling cost of -norm based simulati…
Behavior of Analog Quantum Algorithms
Lucas T. Brady, Lucas Kocia, Przemyslaw Bienias +3
Analog quantum algorithms are formulated in terms of Hamiltonians rather than unitary gates and include quantum adiabatic computing, quantum annealing, and the quantum approximate…
Improved Weak Simulation of Universal Quantum Circuits by Correlated Sampling
Lucas Kocia
Bounding the cost of classically simulating the outcomes of universal quantum circuits to additive error is often called weak simulation and is a direct way to determine when t…
Improved Strong Simulation of Universal Quantum Circuits
Lucas Kocia
We find a scaling reduction in the stabilizer rank of the twelve-qubit tensored gate magic state. This lowers its asymptotic bound to for multi-Pauli measure…
Improved Simulation of Quantum Circuits by Fewer Gaussian Eliminations
Lucas Kocia, Mohan Sarovar
We show that the cost of strong simulation of quantum circuits using gate magic states exhibits non-trivial reductions on its upper bound for , , , and …