Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
31,714
This Month
152
Today
0
Research Volume
15,746 papers in 12 months (-37% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
Optimising trotter-suzuki decompositions for quantum simulation using evolutionary strategies
Benjamin D. M. Jones, George O'Brien, D. White +2 more·Apr 2, 2019
One of the most promising applications of near-term quantum computing is the simulation of quantum systems, a classically intractable task. Quantum simulation requires computationally expensive matrix exponentiation; Trotter-Suzuki decomposition of t...
Generation of a time-frequency grid state with integrated biphoton frequency combs
N. Fabre, G. Maltese, F. Appas +9 more·Apr 2, 2019
Encoding quantum information in continuous variables is intrinsically faulty. Nevertheless, redundant qubits can be used for error correction, as proposed by Gottesman et al. [Phys. Rev. A 64 012310 (2001)]. We show how to experimentally implement th...
Quantum Advantage with Noisy Shallow Circuits in 3D
S. Bravyi, David Gosset, Robert Koenig +1 more·Apr 2, 2019
Prior work has shown that there exists a relation problem which can be solved with certainty by a constant-depth quantum circuit composed of geometrically local gates in two dimensions, but cannot be solved with high probability by any classical cons...
A quantum algorithm for evolving open quantum dynamics on quantum computing devices
Zixuan Hu, Rongxin Xia, S. Kais·Apr 1, 2019
Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment interaction found...
Q# and NWChem: Tools for Scalable Quantum Chemistry on Quantum Computers
G. Low, Nicholas P. Bauman, C. Granade +9 more·Apr 1, 2019
Fault-tolerant quantum computation promises to solve outstanding problems in quantum chemistry within the next decade. Realizing this promise requires scalable tools that allow users to translate descriptions of electronic structure problems to optim...
Finite Verification of Infinite Families of Diagram Equations
Hector Miller-Bakewell·Apr 1, 2019
The ZX, ZW and ZH calculi are all graphical calculi for reasoning about pure state qubit quantum mechanics. All of these languages use certain diagrammatic decorations, called !-boxes and phase variables, to indicate not just one diagram but an infin...
Lower bounds on the non-Clifford resources for quantum computations
M. Beverland, E. Campbell, M. Howard +1 more·Apr 1, 2019
Treating stabilizer operations as free, we establish lower bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks. Our bounds apply to adaptive computations using measurements with an ar...
Entanglement content of quantum particle excitations. Part II. Disconnected regions and logarithmic negativity
O. Castro-Alvaredo, Cecilia De Fazio, B. Doyon +1 more·Apr 1, 2019
In this paper we study the increment of the entanglement entropy and of the (replica) logarithmic negativity in a zero-density excited state of a free massive bosonic theory, compared to the ground state. This extends the work of two previous publica...
Out-of-time-ordered correlators and quantum walks.
Sivaprasad Omanakuttan, A. Lakshminarayan·Mar 31, 2019
Out-of-time-ordered correlators (OTOCs) have recently attracted significant attention, finding applications in disparate areas, from the physics of many-body systems to quantum black holes, with an exponential growth of the OTOCs indicating quantum c...
Quantum Generative Adversarial Networks for learning and loading random distributions
Christa Zoufal, Aurélien Lucchi, Stefan Woerner·Mar 29, 2019
Quantum algorithms have the potential to outperform their classical counterparts in a variety of tasks. The realization of the advantage often requires the ability to load classical data efficiently into quantum states. However, the best known method...
Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank
C. Guan, Kenneth W. Regan·Mar 29, 2019
We show that a form of strong simulation for $n$-qubit quantum stabilizer circuits $C$ is computable in $O(s + n^\omega)$ time, where $\omega$ is the exponent of matrix multiplication. Solution counting for quadratic forms over $\mathbb{F}_2$ is also...
Solving large minimum vertex cover problems on a quantum annealer
Elijah Pelofske, Georg Hahn, H. Djidjev·Mar 29, 2019
We consider the minimum vertex cover problem having applications in e.g. biochemistry and network security. Quantum annealers can find the optimum solution of such NP-hard problems, given they can be embedded on the hardware. This is often infeasible...
Encoding an Oscillator into Many Oscillators.
Kyungjoo Noh, S. Girvin, Liang Jiang·Mar 29, 2019
An outstanding challenge for quantum information processing using bosonic systems is Gaussian errors such as excitation loss and added thermal noise errors. Thus, bosonic quantum error correction is essential. Most bosonic quantum error correction sc...
Simulating Large Quantum Circuits on a Small Quantum Computer.
Tianyi Peng, A. Harrow, M. Ozols +1 more·Mar 29, 2019
Limited quantum memory is one of the most important constraints for near-term quantum devices. Understanding whether a small quantum computer can simulate a larger quantum system, or execute an algorithm requiring more qubits than available, is both ...
Quantum algorithm for spectral projection by measuring an ancilla iteratively
Yanzhu Chen, T. Wei·Mar 28, 2019
We propose a quantum algorithm for projecting to eigenstates of any hermitian operator, provided one can access the associated control-unitary evolution and measurement of the ancilla of the control. The procedure is iterative and the distribution of...
Sequential minimal optimization for quantum-classical hybrid algorithms
Ken M. Nakanishi, K. Fujii, S. Todo·Mar 28, 2019
We propose a sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is robust against statistical error, and is hyperparameter-free. Specifically, the optimization problem of the parameterized quantum ...
Entanglement in a 20-Qubit Superconducting Quantum Computer
Gary J. Mooney, C. Hill, L. Hollenberg·Mar 28, 2019
The ability to prepare sizeable multi-qubit entangled states with full qubit control is a critical milestone for physical platforms upon which quantum computers are built. We investigate the extent to which entanglement is found within a prepared gra...
A fault-tolerant non-Clifford gate for the surface code in two dimensions
Benjamin J. Brown·Mar 27, 2019
We complete a universal set of fault-tolerant quantum logic gates for a two-dimensional surface code architecture. Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here w...
Quantum Monte Carlo algorithm for out-of-equilibrium Green's functions at long times
Corentin Bertrand, O. Parcollet, A. Maillard +1 more·Mar 27, 2019
We present a quantum Monte-Carlo algorithm for computing the perturbative expansion in power of the coupling constant $U$ of the out-of-equilibrium Green's functions of interacting Hamiltonians of fermions. The algorithm extends the one presented in ...
Extracting Success from IBM’s 20-Qubit Machines Using Error-Aware Compilation
S. Nishio, Yulu Pan, Takahiko Satoh +2 more·Mar 26, 2019
NISQ (Noisy, Intermediate-Scale Quantum) computing requires error mitigation to achieve meaningful computation. Our compilation tool development focuses on the fact that the error rates of individual qubits are not equal, with a goal of maximizing th...