1.5k citations · 2.4k across the 25 of their papers we have counts for
26 papers
Quantum Inspired Optimization for Industrial Scale Problems
William P. Banner, Shima Bab Hadiashar, Grzegorz Mazur +7
Model-based optimization, in concert with conventional black-box methods, can quickly solve large-scale combinatorial problems. Recently, quantum-inspired modeling schemes based on…
Quantum algorithm for credit valuation adjustments
Javier Alcazar, Andrea Cadarso, Amara Katabarwa +4
Quantum mechanics is well known to accelerate statistical sampling processes over classical techniques. In quantitative finance, statistical samplings arise broadly in many use cas…
Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor
Amir H. Karamlou, William A. Simon, Amara Katabarwa +3
In the near-term, hybrid quantum-classical algorithms hold great potential for outperforming classical approaches. Understanding how these two computing paradigms work in tandem is…
Minimizing estimation runtime on noisy quantum computers
Guoming Wang, Dax Enshan Koh, Peter D. Johnson +1
The number of measurements demanded by hybrid quantum-classical algorithms such as the variational quantum eigensolver (VQE) is prohibitively high for many problems of practical va…
Foundations for Bayesian inference with engineered likelihood functions for robust amplitude estimation
Dax Enshan Koh, Guoming Wang, Peter D. Johnson +1
We present mathematical and conceptual foundations for the task of robust amplitude estimation using engineered likelihood functions (ELFs), a framework introduced in Wang et al. […
An application benchmark for fermionic quantum simulations
Pierre-Luc Dallaire-Demers, Michał Stęchły, Jerome F. Gonthier +3
It is expected that the simulation of correlated fermions in chemistry and material science will be one of the first practical applications of quantum processors. Given the rapid e…
Realizing Quantum Boltzmann Machines Through Eigenstate Thermalization
Eric R. Anschuetz, Yudong Cao
Quantum Boltzmann machines are natural quantum generalizations of Boltzmann machines that are expected to be more expressive than their classical counterparts, as evidenced both nu…
Quantum Chemistry in the Age of Quantum Computing
Yudong Cao, Jonathan Romero, Jonathan P. Olson +10
Practical challenges in simulating quantum systems on classical computers have been widely recognized in the quantum physics and quantum chemistry communities over the past century…
A framework for algorithm deployment on cloud-based quantum computers
Sukin Sim, Yudong Cao, Jonathan Romero +2
In recent years, the field of quantum computing has significantly developed in both the improvement of hardware as well as the assembly of various software tools and platforms, inc…
Variational Quantum Factoring
Eric R. Anschuetz, Jonathan P. Olson, Alán Aspuru-Guzik +1
Integer factorization has been one of the cornerstone applications of the field of quantum computing since the discovery of an efficient algorithm for factoring by Peter Shor. Unfo…
Quantum Neuron: an elementary building block for machine learning on quantum computers
Yudong Cao, Gian Giacomo Guerreschi, Alán Aspuru-Guzik
Even the most sophisticated artificial neural networks are built by aggregating substantially identical units called neurons. A neuron receives multiple signals, internally combine…
QVECTOR: an algorithm for device-tailored quantum error correction
Peter D. Johnson, Jonathan Romero, Jonathan Olson +2
Current approaches to fault-tolerant quantum computation will not enable useful quantum computation on near-term devices of 50 to 100 qubits. Leading proposals, such as the color c…
OpenFermion: The Electronic Structure Package for Quantum Computers
Jarrod R. McClean, Kevin J. Sung, Ian D. Kivlichan +32
Quantum simulation of chemistry and materials is predicted to be an important application for both near-term and fault-tolerant quantum devices. However, at present, developing and…
Efficient optimization of perturbative gadgets
Yudong Cao, Sabre Kais
Perturbative gadgets are general techniques for reducing many-body spin interactions to two-body ones using perturbation theory. This allows for potential realization of effective…
qTorch: The Quantum Tensor Contraction Handler
E. Schuyler Fried, Nicolas P. D. Sawaya, Yudong Cao +3
Classical simulation of quantum computation is necessary for studying the numerical behavior of quantum algorithms, as there does not yet exist a large viable quantum computer on w…
Quantum Information and Computation for Chemistry
Jonathan Olson, Yudong Cao, Jonathan Romero +7
The NSF Workshop in Quantum Information and Computation for Chemistry assembled experts from directly quantum-oriented fields such as algorithms, chemistry, machine learning, optic…
Quasi-Reliable Estimates of Effective Sample Size
Youhan Fang, Yudong Cao, Robert D. Skeel
The efficiency of a Markov chain Monte Carlo algorithm might be measured by the cost of generating one independent sample, or equivalently, the total cost divided by the effective…
Solving Set Cover with Pairs Problem Using Quantum Annealing
Yudong Cao, Shuxian Jiang, Debbie Perouli +1
Here we consider using quantum annealing to solve Set Cover with Pairs (SCP), an NP-hard combinatorial optimization problem that play an important role in networking, computational…
Quantum computation using arrays of N polar molecules in pendular states
Qi Wei, Yudong Cao, Sabre Kais +2
We investigate several aspects of realizing quantum computation using entangled polar molecules in pendular states. Quantum algorithms typically start from a product state |00...0>…
Efficient estimation of perturbative error with cellular automata
Yudong Cao, Sabre Kais
From celestial mechanics to quantum theory of atoms and molecules, perturbation theory has played a central role in natural sciences. Particularly in quantum mechanics, the amount…
Perturbative gadgets without strong interactions
Yudong Cao, Daniel Nagaj
Perturbative gadgets are used to construct a quantum Hamiltonian whose low-energy subspace approximates a given quantum -body Hamiltonian up to an absolute error . Typically,…
Infrared-dressed entanglement of cold open-shell polar molecules for universal matchgate quantum computing
Felipe Herrera, Yudong Cao, Sabre Kais +1
Implementing a scalable quantum information processor using polar molecules in optical lattices requires precise control over the long-range dipole-dipole interaction between molec…
Hamiltonian gadgets with reduced resource requirements
Yudong Cao, Ryan Babbush, Jacob Biamonte +1
Application of the adiabatic model of quantum computation requires efficient encoding of the solution to computational problems into the lowest eigenstate of a Hamiltonian that sup…
Experimental realization of quantum algorithm for solving linear systems of equations
Jian Pan, Yudong Cao, Xiwei Yao +5
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm fo…