Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
28,250
This Month
22
Today
0
Research Volume
13,406 papers in 12 months (-22% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
Error rates and resource overheads of encoded three-qubit gates
Ryuji Takagi, Theodore J. Yoder, I. Chuang·Jun 30, 2017
A non-Clifford gate is required for universal quantum computation, and, typically, this is the most error-prone and resource intensive logical operation on an error-correcting code. Small, single-qubit rotations are popular choices for this non-Cliff...
Can Chaotic Quantum Circuits Maintain Quantum Supremacy under Noise
M. Yung, Xun Gao·Jun 27, 2017
Although the emergence of a fully-functional quantum computer may still be far away from today, in the near future, it is possible to have medium-size, special-purpose, quantum devices that can perform computational tasks not efficiently simulable wi...
Fast optimization algorithms and the cosmological constant
N. Bao, R. Bousso, S. Jordan +1 more·Jun 26, 2017
Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of a problem that is hard for the complexity class NP (Nondeterministic Polynomial-time). The number...
Exact Equivalence between Quantum Adiabatic Algorithm and Quantum Circuit Algorithm
Hongye 泓烨 Yu 余, Yuliang 宇亮 Huang 黄, Biao 飙 Wu 吴·Jun 23, 2017
We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of L gates we can construct a quantum adiabatic algor...
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
M. Rötteler, M. Naehrig, K. Svore +1 more·Jun 21, 2017
We give precise quantum resource estimates for Shor's algorithm to compute discrete logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of a Toffoli gate network for controlled elliptic curve point addition, i...
Universal Quantum Computing with Measurement-Induced Continuous-Variable Gate Sequence in a Loop-Based Architecture.
S. Takeda, A. Furusawa·Jun 20, 2017
We propose a scalable scheme for optical quantum computing using measurement-induced continuous-variable quantum gates in a loop-based architecture. Here, time-bin-encoded quantum information in a single spatial mode is deterministically processed in...
Scalable quantum computing model in the circuit-QED lattice with circulator function
M. Kim, Jaewan Kim·Jun 19, 2017
We propose a model for a scalable quantum computing in the circuit quantum electrodynamics architecture. In the Kagome lattice of qubits, three qubits are connected to each other through a superconducting three-junction flux qubit at the vertices of ...
Fault-tolerance thresholds for the surface code with fabrication errors
J. Auger, H. Anwar, Mercedes Gimeno-Segovia +2 more·Jun 15, 2017
The construction of topological error correction codes requires the ability to fabricate a lattice of physical qubits embedded on a manifold with a non-trivial topology such that the quantum information is encoded in the global degrees of freedom (i....
Design of Quantum Circuits for Galois Field Squaring and Exponentiation
Edgard Muñoz-Coreas, H. Thapliyal·Jun 15, 2017
This work presents an algorithm to generate depth, quantum gate and qubit optimized circuits for GF(2m) squaring in the polynomial basis. Further, to the best of our knowledge the proposed quantum squaring circuit algorithm is the only work that cons...
Logic Synthesis for Quantum Computing
Mathias Soeken, M. Rötteler, N. Wiebe +1 more·Jun 8, 2017
We present a synthesis framework to map logic networks into quantum circuits for quantum computing. The synthesis framework is based on LUT networks (lookup-table networks), which play a key role in conventional logic synthesis. Establishing a connec...
Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians
Liming Zhao, Carlos A. Pérez-Delgado, S. Benjamin +1 more·Jun 8, 2017
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather than disc...
Effect of unbalanced and common losses in quantum photonic integrated circuits
Ming Li, Chang-ling Zou, G. Guo +1 more·May 30, 2017
Loss is inevitable for the optical system due to absorption of materials, scattering caused by the defects and surface roughness. In quantum optical circuits, the loss can not only reduce the intensity of signal, but also affect the performance of qu...
Compiling quantum circuits to realistic hardware architectures using temporal planners
D. Venturelli, M. Do, E. Rieffel +1 more·May 24, 2017
To run quantum algorithms on emerging gate-model quantum hardware, quantum circuits must be compiled to take into account constraints on the hardware. For near-term hardware, with only limited means to mitigate decoherence, it is critical to minimize...
Fault-tolerant quantum computation with few qubits
R. Chao, B. Reichardt·May 15, 2017
Reliable qubits are difficult to engineer, but standard fault-tolerance schemes use seven or more physical qubits to encode each logical qubit, with still more qubits required for error correction. The large overhead makes it hard to experiment with ...
Coherent oscillations inside a quantum manifold stabilized by dissipation
S. Touzard, A. Grimm, Z. Leghtas +13 more·May 5, 2017
Manipulating the state of a logical quantum bit usually comes at the expense of exposing it to decoherence. Fault-tolerant quantum computing tackles this problem by manipulating quantum information within a stable manifold of a larger Hilbert space, ...
Universal fault-tolerant quantum computation with Bacon-Shor codes
Theodore J. Yoder·May 4, 2017
We present a fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal non-Clifford gates on these codes are intriguing in that higher levels of the Clifford hierarchy become...
Random access quantum information processors using multimode circuit quantum electrodynamics
R. Naik, N. Leung, S. Chakram +6 more·May 1, 2017
Qubit connectivity is an important property of a quantum processor, with an ideal processor having random access—the ability of arbitrary qubit pairs to interact directly. This a challenge with superconducting circuits, as state-of-the-art architectu...
The ZX calculus is a language for surface code lattice surgery
N. de Beaudrap, D. Horsman·Apr 27, 2017
A leading choice of error correction for scalable quantum computing is the surface code with lattice surgery. The basic lattice surgery operations, the merging and splitting of logical qubits, act non-unitarily on the logical states and are not easil...
Fault-tolerant quantum computing in the Pauli or Clifford frame with slow error diagnostics
C. Chamberland, Pavithran Iyer, D. Poulin·Apr 21, 2017
We consider the problem of fault-tolerant quantum computation in the presence of slow error diagnostics, either caused by measurement latencies or slow decoding algorithms. Our scheme offers a few improvements over previously existing solutions, for ...
Thermal Entanglement, Specific Heat and Quantum Discord in Open Quantum Systems Including Non-Markovian Processes
B. Lari, H. Hassanabadi·Apr 10, 2017
Entanglement (EN) is a determinative correlation in designation of quantum gates and quantum memories. All quantum operations which are assembled by quantum circuits, are exposed to environment. However, quantum discord (QD) as a new key of resource ...