Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
31,714
This Month
152
Today
0
Research Volume
15,745 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
Characterizing large-scale quantum computers via cycle benchmarking
A. Erhard, Joel J. Wallman, L. Postler +7 more·Feb 22, 2019
Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the various errors that accumulate during an algorithm...
A Pattern Recognition Algorithm for Quantum Annealers
Frédéric Bapst, W. Bhimji, P. Calafiura +4 more·Feb 22, 2019
The reconstruction of charged particles will be a key computing challenge for the high-luminosity Large Hadron Collider (HL-LHC) where increased data rates lead to a large increase in running time for current pattern recognition algorithms. An altern...
Fine-grained quantum supremacy based on Orthogonal Vectors, 3-SUM and All-Pairs Shortest Paths.
Ryunosuke Hayakawa, T. Morimae, Suguru Tamaki·Feb 22, 2019
Fine-grained quantum supremacy is a study of proving (nearly) tight time lower bounds for classical simulations of quantum computing under "fine-grained complexity" assumptions. We show that under conjectures on Orthogonal Vectors (OV), 3-SUM, All-Pa...
Minimal Time Robust Control for Two Superconducting Qubits
Niril George, Joseph L. Allen, Robert Kosut +1 more·Feb 21, 2019
High-fidelity quantum gates are crucial for achieving fault-tolerant quantum computing; however, decoherence significantly reduces gate fidelities during long operation times. Although optimal control techniques can theoretically minimize these opera...
Parallel quantum trajectories via forking for sampling without redundancy
D. Park, I. Sinayskiy, M. Fingerhuth +2 more·Feb 21, 2019
The computational cost of preparing a quantum state can be substantial depending on the structure of data to be encoded. Many quantum algorithms require repeated sampling to find the answer, mandating reconstruction of the same input state for every ...
Pseudo-2D superconducting quantum computing circuit for the surface code: proposal and preliminary tests
H. Mukai, Keiichi Sakata, S. Devitt +4 more·Feb 21, 2019
Among the major hardware platforms for large-scale quantum computing, one of the leading candidates is superconducting quantum circuits. Current proposed architectures for quantum error-correction with the promising surface code require a two-dimensi...
On the qubit routing problem
Alexander Cowtan, Silas Dilkes, Ross Duncan +3 more·Feb 21, 2019
We introduce a new architecture-agnostic methodology for mapping abstract quantum circuits to realistic quantum computing devices with restricted qubit connectivity, as implemented by Cambridge Quantum Computing's t|ket> compiler. We present empirica...
Really Small Shoe Boxes - On Realistic Quantum Resource Estimation
A. Paler, Daniel Herr, S. Devitt·Feb 21, 2019
Reliable resource estimation and benchmarking of quantum algorithms is a critical component of the development cycle of viable quantum applications for quantum computers of all sizes. Determining critical resource bottlenecks in algorithms, especiall...
Time versus Hardware: Reducing Qubit Counts with a (Surface Code) Data Bus
Daniel Herr, A. Paler, S. Devitt +1 more·Feb 21, 2019
We introduce a data bus, for reducing the qubit counts within quantum computations (protected by surface codes). For general computations, an automated trade-off analysis (software tool and source code are open sourced and available online) is perfor...
Continuous Symmetries and Approximate Quantum Error Correction
P. Faist, Sepehr Nezami, Victor V. Albert +4 more·Feb 20, 2019
Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here, we study the compatibility of these two importan...
Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
M. P. Woods, Álvaro M. Alhambra·Feb 20, 2019
Following the introduction of the task of reference frame errorcorrection \cite{hayden2017error}, we show how, by using reference frame alignment with clocks, one can add a continuous Abelian group of transversal logical gates to any error-correcting...
Universality of EPR pairs in entanglement-assisted communication complexity, and the communication cost of state conversion
Matthew Coudron, A. Harrow·Feb 20, 2019
In this work we consider the role of entanglement assistance in quantum communication protocols, focusing, in particular, on whether the type of shared entangled state can affect the quantum communication complexity of a function. This question is in...
Experimental pairwise entanglement estimation for an N-qubit system :A machine learning approach for programming quantum hardware
Nathan L. Thompson, N. Nguyen, E. Behrman +1 more·Feb 20, 2019
Designing and implementing algorithms for medium and large scale quantum computers is not easy. In previous work we have suggested, and developed, the idea of using machine learning techniques to train a quantum system such that the desired process i...
A Tight Lower Bound For Non-Coherent Index Erasure
N. Lindzey, A. Rosmanis·Feb 19, 2019
The index erasure problem is a quantum state generation problem that asks a quantum computer to prepare a uniform superposition over the image of an injective function given by an oracle. We prove a tight $\Omega(\sqrt{n})$ lower bound on the quantum...
Probabilistic Modeling with Matrix Product States
J. Stokes, John Terilla·Feb 19, 2019
Inspired by the possibility that generative models based on quantum circuits can provide a useful inductive bias for sequence modeling tasks, we propose an efficient training algorithm for a subset of classically simulable quantum circuit models. The...
Error reduction of quantum algorithms
Debajyoti Bera, V. TharrmashasthaP.·Feb 19, 2019
We give a technique to reduce the error probability of quantum algorithms that determine whether its input has a specified property of interest. The standard process of reducing this error is statistical processing of the results of multiple independ...
Entanglement stabilization using ancilla-based parity detection and real-time feedback in superconducting circuits
C. K. Andersen, A. Remm, S. Lazăr +6 more·Feb 19, 2019
Fault-tolerant quantum computing relies on the ability to detect and correct errors, which in quantum error correction codes is typically achieved by projectively measuring multi-qubit parity operators and by conditioning operations on the observed e...
Bulk locality and asymptotic causal diamonds
Chethan Krishnan·Feb 18, 2019
In AdS/CFT, the non-uniqueness of the reconstructed bulk from boundary subregions has motivated the notion of code subspaces. We present some closely related structures that arise in flat space. A useful organizing idea is that of an asymptotic causa...
Designing metamaterials with quantum annealing and factorization machines
Koki Kitai, Jiang Guo, S. Ju +4 more·Feb 18, 2019
Complexity of materials designed by machine learning is currently limited by the inefficiency of classical computers. We show how quantum annealing can be incorporated into automated materials discovery and conduct a proof-of-principle study on desig...
Micromotion-enhanced fast entangling gates for trapped-ion quantum computing
Alexander K. Ratcliffe, L. Oberg, J. Hope·Feb 18, 2019
RF-induced micromotion in trapped ion systems is typically minimised or circumvented to avoid off-resonant couplings for adiabatic processes such as multi-ion gate operations. Non-adiabatic entangling gates (so-called `fast gates') do not require res...