303 citations · 530 across the 15 of their papers we have counts for
18 papers
Quantum-Classical Auxiliary Field Quantum Monte Carlo with Matchgate Shadows on Trapped Ion Quantum Computers
Luning Zhao, Joshua J. Goings, Willie Aboumrad +38
We demonstrate an end-to-end workflow to model chemical reaction barriers with the quantum-classical auxiliary field quantum Monte Carlo (QC-AFQMC) algorithm with quantum tomograph…
Predicting Properties of Quantum Systems with Conditional Generative Models
Haoxiang Wang, Maurice Weber, Josh Izaac +1
Machine learning has emerged recently as a powerful tool for predicting properties of quantum many-body systems. For many ground states of gapped Hamiltonians, generative models ca…
End-to-end resource analysis for quantum interior point methods and portfolio optimization
Alexander M. Dalzell, B. David Clader, Grant Salton +8
We study quantum interior point methods (QIPMs) for second-order cone programming (SOCP), guided by the example use case of portfolio optimization (PO). We provide a complete quant…
Differentiable quantum computational chemistry with PennyLane
Juan Miguel Arrazola, Soran Jahangiri, Alain Delgado +15
This work describes the theoretical foundation for all quantum chemistry functionality in PennyLane, a quantum computing software library specializing in quantum differentiable pro…
General parameter-shift rules for quantum gradients
David Wierichs, Josh Izaac, Cody Wang +1
Variational quantum algorithms are ubiquitous in applications of noisy intermediate-scale quantum computers. Due to the structure of conventional parametrized quantum gates, the ev…
Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning
Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li +3
We give two quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with constraint matrices, each of dimension ,…
Hamiltonian Simulation with Optimal Sample Complexity
Shelby Kimmel, Cedric Yen-Yu Lin, Guang Hao Low +2
We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of…
Sequential measurements, disturbance and property testing
Aram W. Harrow, Cedric Yen-Yu Lin, Ashley Montanaro
We describe two procedures which, given access to one copy of a quantum state and a sequence of two-outcome measurements, can distinguish between the case that at least one of the…
Space-Efficient Error Reduction for Unitary Quantum Computations
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin +2
This paper develops general space-efficient methods for error reduction for unitary quantum computation. Consider a polynomial-time quantum computation with completeness and so…
A Complete Characterization of Unitary Quantum Space
Bill Fefferman, Cedric Yen-Yu Lin
Motivated by understanding the power of quantum computation with restricted number of qubits, we give two complete characterizations of unitary quantum space bounded computation. F…
Quantum Merlin Arthur with Exponentially Small Gap
Bill Fefferman, Cedric Lin
We study the complexity of QMA proof systems with inverse exponentially small promise gap. We show that this class can be exactly characterized by PSPACE, the class of problems sol…
Performance of QAOA on Typical Instances of Constraint Satisfaction Problems with Bounded Degree
Cedric Yen-Yu Lin, Yechao Zhu
We consider constraint satisfaction problems of bounded degree, with a good notion of "typicality", e.g. the negation of the variables in each constraint is taken independently at…
Oracles with Costs
Shelby Kimmel, Cedric Yen-Yu Lin, Han-Hsuan Lin
While powerful tools have been developed to analyze quantum query complexity, there are still many natural problems that do not fit neatly into the black box model of oracles. We c…
Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester
Cedric Yen-Yu Lin, Han-Hsuan Lin
Inspired by the Elitzur-Vaidman bomb testing problem [arXiv:hep-th/9305002], we introduce a new query complexity model, which we call bomb query complexity . We investigate i…
The computational power of normalizer circuits over black-box groups
Juan Bermejo-Vega, Cedric Yen-Yu Lin, Maarten Van den Nest
This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for sol…
Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems
Juan Bermejo-Vega, Cedric Yen-Yu Lin, Maarten Van den Nest
[1,2] are generalized Clifford circuits that act on arbitrary finite-dimensional systems wit…
Different Strategies for Optimization Using the Quantum Adiabatic Algorithm
Elizabeth Crosson, Edward Farhi, Cedric Yen-Yu Lin +2
We present the results of a numerical study, with 20 qubits, of the performance of the Quantum Adiabatic Algorithm on randomly generated instances of MAX 2-SAT with a unique assign…
Vortex interactions in a thin platelet superconductor
Cedric Yen-Yu Lin, Ian Affleck
The thermal fluctations of vortices in a superconductor can be usefully mapped onto the quantum fluctations of a collection of bosons at T=0 moving in 2 dimensions. When the superc…