Noisy intermediate-scale quantum algorithms
A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …
integer factorization and unstructured database search requires millions of qubits with low …
Simulating quantum materials with digital quantum computers
LB Oftelie, M Urbanek, M Metcalf, J Carter… - Quantum Science …, 2021 - iopscience.iop.org
Quantum materials exhibit a wide array of exotic phenomena and practically useful
properties. A better understanding of these materials can provide deeper insights into …
properties. A better understanding of these materials can provide deeper insights into …
[HTML][HTML] The future of quantum computing with superconducting qubits
For the first time in history, we are seeing a branching point in computing paradigms with the
emergence of quantum processing units (QPUs). Extracting the full potential of computation …
emergence of quantum processing units (QPUs). Extracting the full potential of computation …
Efficient tensor network simulation of ibm's eagle kicked ising experiment
We report an accurate and efficient classical simulation of a kicked Ising quantum system on
the heavy hexagon lattice. A simulation of this system was recently performed on a 127-qubit …
the heavy hexagon lattice. A simulation of this system was recently performed on a 127-qubit …
Exponentially tighter bounds on limitations of quantum error mitigation
Quantum error mitigation has been proposed as a means to combat unwanted and
unavoidable errors in near-term quantum computing using no or few additional quantum …
unavoidable errors in near-term quantum computing using no or few additional quantum …
Fast quantum circuit cutting with randomized measurements
We propose a new method to extend the size of a quantum computation beyond the number
of physical qubits available on a single device. This is accomplished by randomly inserting …
of physical qubits available on a single device. This is accomplished by randomly inserting …
Covariant quantum kernels for data with group structure
The use of kernel functions is a common technique to extract important features from
datasets. A quantum computer can be used to estimate kernel entries as transition …
datasets. A quantum computer can be used to estimate kernel entries as transition …
Training the quantum approximate optimization algorithm without access to a quantum processing unit
In this paper, we eliminate the classical outer learning loop of the quantum approximate
optimization algorithm (QAOA) and present a strategy to find good parameters for QAOA …
optimization algorithm (QAOA) and present a strategy to find good parameters for QAOA …
Efficient classical simulation of random shallow 2D quantum circuits
A central question of quantum computing is determining the source of the advantage of
quantum computation over classical computation. Even though simulating quantum …
quantum computation over classical computation. Even though simulating quantum …
Error mitigation via verified phase estimation
The accumulation of noise in quantum computers is the dominant issue stymieing the push
of quantum algorithms beyond their classical counterparts. We do not expect to be able to …
of quantum algorithms beyond their classical counterparts. We do not expect to be able to …