Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
31,850
This Month
265
Today
0
Research Volume
15,851 papers in 12 months (-35% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
Learning with Errors is easy with quantum samples
A. Grilo, Iordanis Kerenidis·Feb 27, 2017
Learning with Errors is one of the fundamental problems in computational learning theory and has in the last years become the cornerstone of post-quantum cryptography. In this work, we study the quantum sample complexity of Learning with Errors and s...
Work sharing of qubits in topological error corrections
T. Tanamoto, Hayato Goto·Feb 26, 2017
Topological error-correcting codes, such as surface codes and color codes, are promising because quantum operations are realized by two-dimensionally (2D) arrayed quantum bits (qubits). However, physical wiring of electrodes to qubits is complicated,...
Quasi-cyclic multi-edge LDPC codes for long-distance quantum cryptography
Mario Milicevic, Chen Feng, Lei Zhang +1 more·Feb 24, 2017
The speed at which two remote parties can exchange secret keys in continuous-variable quantum key distribution (CV-QKD) is currently limited by the computational complexity of key reconciliation. Multi-dimensional reconciliation using multi-edge low-...
What determines the ultimate precision of a quantum computer
X. Waintal·Feb 24, 2017
A quantum error correction (QEC) code uses $N_{\rm c}$ quantum bits to construct one "logical" quantum bits of better quality than the original "physical" ones. QEC theory predicts that the failure probability $p_L$ of logical qubits decreases expone...
Obtaining highly excited eigenstates of the localized XX chain via DMRG-X
T. Devakul, V. Khemani, F. Pollmann +2 more·Feb 24, 2017
We benchmark a variant of the recently introduced density matrix renormalization group (DMRG)-X algorithm against exact results for the localized random field XX chain. We find that the eigenstates obtained via DMRG-X exhibit a highly accurate l-bit ...
Signed quantum weight enumerators characterize qubit magic state distillation
Patrick Rall·Feb 22, 2017
Many proposals for fault-tolerant quantum computation require injection of 'magic states' to achieve a universal set of operations. Some qubit states are above a threshold fidelity, allowing them to be converted into magic states via 'magic state dis...
Universal interrogation protocol with zero probe-field-induced frequency shift for quantum clocks and high-accuracy spectroscopy
T. Zanon-Willette, R. Lefevre, A. Taichenachev +1 more·Feb 21, 2017
Optical clock interrogation protocols, based on laser-pulse spectroscopy, are suffering from probe-induced frequency shifts and their variations induced by laser power. Original Hyper-Ramsey probing scheme, which was proposed to alleviate those issue...
Designing Adiabatic Quantum Optimization: A Case Study for the Traveling Salesman Problem
B. Heim, Ethan Brown, D. Wecker +1 more·Feb 21, 2017
With progress in quantum technology more sophisticated quantum annealing devices are becoming available. While they offer new possibilities for solving optimization problems, their true potential is still an open question. As the optimal design of ad...
Entanglement loss in molecular quantum-dot qubits due to interaction with the environment
E. Blair, G. Tóth, C. Lent·Feb 20, 2017
We study quantum entanglement loss due to environmental interaction in a condensed matter system with a complex geometry relevant to recent proposals for computing with single electrons at the nanoscale. We consider a system consisting of two qubits,...
The Absent-Minded Driver Problem Redux
S. Kak·Feb 19, 2017
This paper reconsiders the problem of the absent-minded driver who must choose between alternatives with different payoff with imperfect recall and varying degrees of knowledge of the system. The classical absent-minded driver problem represents the ...
One-dimensional quantum computing with a ‘segmented chain’ is feasible with today’s gate fidelities
Ying Li, S. Benjamin·Feb 18, 2017
Building a quantum computer with a one-dimensional (1D) architecture, instead of the typical two-dimensional (2D) layout, could be significantly less difficult experimentally. However such a restricted topology necessitates a large overhead for shuff...
Optical parallel computation similar to quantum computation based on optical fields modulated with pseudorandom phase sequences
Jian Fu·Feb 17, 2017
We propose an optical parallel computation similar to quantum computation that can be realized by introducing pseudorandom phase sequences into classical optical fields with two orthogonal modes. Based on the pseudorandom phase sequences, we first pr...
Observing a quantum Maxwell demon at work
N. Cottet, S. Jezouin, L. Bretheau +7 more·Feb 16, 2017
Significance Maxwell’s demon plays a central role in thermodynamics of quantum information, yet a full experimental characterization is still missing in the quantum regime. Here we use superconducting circuits to realize a quantum Maxwell demon in wh...
Strong algorithmic cooling in large star-topology quantum registers
Varad R. Pande, Gaurav Bhole, Deepak Khurana +1 more·Feb 16, 2017
We envisage a star-topology quantum register, wherein a central computation qubit is symmetrically surrounded by a set of reset qubits. The reset qubits cool the computation qubit by transferring its entropy to a heat bath with the help of a heat-bat...
Dirac bi-spinor entanglement under local noise and its simulation by Jaynes-Cummings interactions
V. Bittencourt, A. Bernardini·Feb 13, 2017
A description of the effects of the local noise on the quantum entanglement constraining the internal degrees of freedom of Dirac bi-spinor structures driven by arbitrary Poincaré invariant potentials is proposed. Given that the Dirac equation dynami...
Logical Randomized Benchmarking
J. Combes, C. Granade, C. Ferrie +1 more·Feb 13, 2017
Extrapolating physical error rates to logical error rates requires many assumptions and thus can radically under- or overestimate the performance of an error correction implementation. We introduce logical randomized benchmarking, a characterization ...
Post-Quantum Cryptography(PQC): Generalized ElGamal Cipher over GL(8,F251)
P. Hecht·Feb 12, 2017
Post-quantum cryptography (PQC) attempts to find cryptographic protocols resistant to attacks using for instance Shor's polynomial time algorithm for numerical field problems like integer factorization (IFP) or the discrete logarithm (DLP). Other asp...
Coherence number as a discrete quantum resource
Seungbeom Chin·Feb 10, 2017
We introduce a new discrete coherence monotone named the \emph{coherence number}, which is a generalization of the coherence rank to mixed states. After defining the coherence number in a similar manner to the Schmidt number in entanglement theory, w...
Near-optimal quantum circuit for Grover's unstructured search using a transverse field
Zhang Jiang, E. Rieffel, Zhihui Wang·Feb 8, 2017
Inspired by a class of algorithms proposed by Farhi et al. (arXiv:1411.4028), namely the quantum approximate optimization algorithm (QAOA), we present a circuit-based quantum algorithm to search for a needle in a haystack, obtaining the same quadrati...
A Quantum von Neumann Architecture for Large-Scale Quantum Computing in Systems with Long Coherence Times, such as Trapped Ions
M. F. Brandl·Feb 8, 2017
As the size of quantum systems becomes bigger, more complicated hardware is required to control these systems. In order to reduce the complexity, I discuss the amount of parallelism required for a fault-tolerant quantum computer and what computation ...