Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
31,714
This Month
152
Today
0
Research Volume
15,744 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
Mitigating algorithmic errors in a Hamiltonian simulation
Suguru Endo, Qi Zhao, Y. Li +2 more·Aug 10, 2018
Quantum computers can efficiently simulate many-body systems. As a widely used Hamiltonian simulation tool, the Trotter-Suzuki scheme splits the evolution into the number of Trotter steps $N$ and approximates the evolution of each step by a product o...
Quantum Algorithms for Autocorrelation Spectrum
Debajyoti Bera, S. Maitra, Tharrmashastha Sapv·Aug 10, 2018
In this paper we design quantum algorithms for studying the autocorrelation spectrum of a Boolean function and its individual coefficients. Informally, the autocorrelation coefficient of a Boolean function f() at some point a measures the average cor...
On the Complexity of Solving Subtraction Games
K. Khadiev, Dmitry Kravchenko·Aug 10, 2018
We study algorithms for solving Subtraction games, which sometimes are referred to as one-heap Nim games. We describe a quantum algorithm which is applicable to any game on DAG, and show that its query compexity for solving an arbitrary Subtraction g...
Learning and Inference on Generative Adversarial Quantum Circuits
J. Zeng, Y. Wu, Jin-Guo Liu +2 more·Aug 10, 2018
Quantum mechanics is inherently probabilistic in light of Born's rule. Using quantum circuits as probabilistic generative models for classical data exploits their superior expressibility and efficient direct sampling ability. However, training of qua...
Jointly Constrained Semidefinite Bilinear Programming With an Application to Dobrushin Curves
Stefan Huber, R. König, M. Tomamichel·Aug 9, 2018
We propose a branch-and-bound algorithm for minimizing a bilinear functional of the form <inline-formula> <tex-math notation="LaTeX">$f(X,Y) = \mathrm {tr}((X\otimes Y)Q)+ \mathrm {tr}(AX)+ \mathrm {tr}(BY) $ </tex-math></inline-formula>, of pairs of...
Efficiently decoding the 3D toric codes and welded codes on cubic lattices
Abhishek Kulkarni, P. Sarvepalli·Aug 9, 2018
The recent years have seen a growing interest in quantum codes in three dimensions (3D). One of the earliest proposed 3D quantum codes is the 3D toric code. It has been shown that 3D color codes can be mapped to 3D toric codes. The 3D toric code on c...
A quantum related-key attack based on Bernstein-Vazirani algorithm
Huiqin Xie, Li Yang·Aug 9, 2018
Due to the powerful computing capability of quantum computers, cryptographic researchers have applied quantum algorithms to cryptanalysis and obtained many interesting results in recent years. In this paper, we study related-key attack in the quantum...
Algorithmic No-Cloning Theorem
Samuel Epstein·Aug 9, 2018
We introduce notions of algorithmic mutual information and deficiency of randomness of quantum states. These definitions enjoy conservation inequalities over unitary transformations and partial traces. We show that a large majority of pure states hav...
Experimentally identifying the entanglement class of pure tripartite states
Amandeep Singh, K. Dorai, Arvind·Aug 9, 2018
We use concurrence as an entanglement measure and experimentally demonstrate the entanglement classification of arbitrary three-qubit pure states on a nuclear magnetic resonance quantum information processor. Computing the concurrence experimentally ...
A factorisation algorithm in Adiabatic Quantum Computation
T. Kieu·Aug 8, 2018
The problem of factorising positive integer N into two integer factors x and y is first reformulated as an optimisation problem over the positive integer domain of either of the Diophantine polynomials Q N ( x , y ) = N 2 N − xy 2 + x x − y 2 or R N ...
Low rank representations for quantum simulation of electronic structure
M. Motta, Erika Ye, J. McClean +4 more·Aug 8, 2018
The quantum simulation of quantum chemistry is a promising application of quantum computers. However, for N molecular orbitals, the O(N4)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb...
A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
D. Litinski·Aug 8, 2018
Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code quantum computing on small, intermediate and large scales. They are stra...
Quantum Lower Bound for Approximate Counting Via Laurent Polynomials
Scott Aaronson·Aug 7, 2018
We consider the following problem: estimate the size of a nonempty set $S\subseteq\left[ N\right] $, given both quantum queries to a membership oracle for $S$, and a device that generates equal superpositions $\left\vert S\right\rangle $ over $S$ ele...
Approximate stabilizer rank and improved weak simulation of Clifford-dominated circuits for qudits
Yifei Huang, P. Love·Aug 7, 2018
Bravyi and Gosset recently gave classical simulation algorithms for quantum circuits dominated by Clifford operations. These algorithms scale exponentially with the number of T-gate in the circuit, but polynomially in the number of qubits and Cliffor...
Fast and Scalable Quantum Information Processing with Two‐Electron Atoms in Optical Tweezer Arrays
G. Pagano, F. Scazza, M. Foss-Feig·Aug 7, 2018
Atomic systems, ranging from trapped ions to ultracold and Rydberg atoms, offer unprecedented control over both internal and external degrees of freedom at the single‐particle level. They are considered among the foremost candidates for realizing qua...
Coherence Depletion in Quantum Algorithms
Ye Liu, Jiangwei Shang, Xiangdong Zhang·Aug 7, 2018
Besides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the depletion of qua...
Approximation algorithms for quantum many-body problems
S. Bravyi, David Gosset, Robert Koenig +1 more·Aug 6, 2018
We discuss classical algorithms for approximating the largest eigenvalue of quantum spin and fermionic Hamiltonians based on semidefinite programming relaxation methods. First, we consider traceless 2-local Hamiltonians H describing a system of n qub...
Observation of Multiphoton Frequency Conversion in Superconducting Circuits
H. Jooya, G. Sun, J. Pan +3 more·Aug 3, 2018
Multiphoton up/down conversion in a transmon circuit, driven by a pair of microwaves tuned near and far off the qubit resonance, has been observed. The experimental realization of these high order non-linear processes is accomplished in the three-pho...
Selective and efficient quantum process tomography in arbitrary finite dimension
I. Perito, A. Roncaglia, A. Bendersky·Aug 3, 2018
The characterization of quantum processes is a key tool in quantum information processing tasks for several reasons: on one hand, it allows to acknowledge errors in the implementations of quantum algorithms; on the other, it allows to charcaterize un...
Verifying the output of quantum optimizers with ground-state energy lower bounds
F. Baccari, C. Gogolin, P. Wittek +1 more·Aug 3, 2018
Solving optimisation problems encoded in the ground state of classical-spin systems is a focus area for quantum computing devices, providing upper bounds to the unknown solution. To certify these bounds, they are compared to those obtained by classic...