Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
31,714
This Month
152
Today
0
Research Volume
15,754 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
Fault-tolerant quantum speedup from constant depth quantum circuits
R. Mezher, J. Ghalbouni, J. Dgheim +1 more·May 23, 2020
A defining feature in the field of quantum computing is the potential of a quantum device to outperform its classical counterpart for a specific computational task. By now, several proposals exist showing that certain sampling problems can be done ef...
On compression rate of quantum autoencoders: Control design, numerical and experimental realization
Hailan Ma, Chang-Jiang Huang, Chunlin Chen +4 more·May 22, 2020
Quantum autoencoders which aim at compressing quantum information in a low-dimensional latent space lie in the heart of automatic data compression in the field of quantum information. In this paper, we establish an upper bound of the compression rate...
Expressibility and trainability of parametrized analog quantum systems for machine learning applications
J. Tangpanitanon, Supanut Thanasilp, Ninnat Dangniam +2 more·May 22, 2020
Parameterized quantum evolution is the main ingredient in variational quantum algorithms for near-term quantum devices. In digital quantum computing, it has been shown that random parameterized quantum circuits are able to express complex distributio...
The prospects of quantum computing in computational molecular biology
C. Outeiral, M. Strahm, Jiye Shi +3 more·May 22, 2020
Quantum computers can in principle solve certain problems exponentially more quickly than their classical counterparts. We have not yet reached the advent of useful quantum computation, but when we do, it will affect nearly all scientific disciplines...
Quantum circuit cutting with maximum-likelihood tomography
M. Perlin, Zain Saleem, Martin Suchara +1 more·May 22, 2020
We introduce maximum-likelihood fragment tomography (MLFT) as an improved circuit cutting technique for running clustered quantum circuits on quantum devices with a limited number of qubits. In addition to minimizing the classical computing overhead ...
An Exploration of Practical Optimizers for Variational Quantum Algorithms on Superconducting Qubit Processors
Kevin J Sung, M. Harrigan, N. Rubin +3 more·May 22, 2020
Variational quantum algorithms are a leading candidate for early applications on noisy intermediate-scale quantum computers. These algorithms depend on a classical optimization outer-loop that minimizes some function of a parameterized quantum circui...
Bidirectional teleportation for underwater quantum communications
Mario Mastriani, S. S. Iyengar, K. Kumar·May 22, 2020
In this work, we evaluate the performance of a bidirectional teleportation protocol on an IBM Q Experience quantum processor of six or more qubits. Moreover, we analyze the viability in the implementation of the mentioned protocol in a configuration ...
Symbolic Reasoning About Quantum Circuits in Coq
Wenjun Shi, Qinxiang Cao, Yuxin Deng +2 more·May 22, 2020
A quantum circuit is a computational unit that transforms an input quantum state to an output state. A natural way to reason about its behavior is to compute explicitly the unitary matrix implemented by it. However, when the number of qubits increase...
Overlap junctions for superconducting quantum electronics and amplifiers.
M. Bal, J. Long, R. Zhao +14 more·May 21, 2020
Due to their unique properties as lossless, nonlinear circuit elements, Josephson junctions lie at the heart of superconducting quantum information processing. Previously, we demonstrated a two-layer, submicrometer-scale overlap junction fabrication ...
Complexity of Fermionic Dissipative Interactions and Applications to Quantum Computing
O. Shtanko, A. Deshpande, P. Julienne +1 more·May 21, 2020
Interactions between particles are usually a resource for quantum computing, making quantum many-body systems intractable by any known classical algorithm. In contrast, noise is typically considered as being inimical to quantum many-body correlations...
Toward scalable simulations of lattice gauge theories on quantum computers
Simon V. Mathis, G. Mazzola, I. Tavernelli·May 20, 2020
The simulation of real-time dynamics in lattice gauge theories is particularly hard for classical computing due to the exponential scaling of the required resources. On the other hand, quantum algorithms can potentially perform the same calculation w...
Quantum repeaters in space
C. Liorni, H. Kampermann, D. Bruß·May 20, 2020
Long-distance entanglement is a very precious resource, but its distribution is very difficult due to the exponential losses of light in optical fibres. A possible solution consists in the use of quantum repeaters, based on entanglement swapping (ES)...
Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
L. Banchi, G. Crooks·May 20, 2020
Hybrid quantum-classical optimization algorithms represent one of the most promising application for near-term quantum computers. In these algorithms the goal is to optimize an observable quantity with respect to some classical parameters, using feed...
A quantum procedure for map generation
James R. Wootton·May 20, 2020
Quantum computation is an emerging technology that promises a wide range of possible use cases. This promise is primarily based on algorithms that are unlikely to be viable over the coming decade. For near-term applications, quantum software needs to...
Manipulating Complex Hybrid Entanglement and Testing Multipartite Bell Inequalities in a Superconducting Circuit.
Yuwei Ma, Xiaoxuan Pan, W. Cai +9 more·May 20, 2020
Quantum correlations in observables of multiple systems not only are of fundamental interest, but also play a key role in quantum information processing. As a signature of these correlations, the violation of Bell inequalities has not been demonstrat...
An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
Linghua Zhu, Ho Lun Tang, George S. Barron +4 more·May 20, 2020
The quantum approximate optimization algorithm (QAOA) is a hybrid variational quantum-classical algorithm that solves combinatorial optimization problems. While there is evidence suggesting that the fixed form of the original QAOA ansatz is not optim...
Polynomially Filtered Exact Diagonalization Approach to Many-Body Localization.
P. Sierant, M. Lewenstein, J. Zakrzewski·May 19, 2020
Polynomially filtered exact diagonalization method (POLFED) for large sparse matrices is introduced. The algorithm finds an optimal basis of a subspace spanned by eigenvectors with eigenvalues close to a specified energy target by a spectral transfor...
Wigner distribution on a double-cylinder phase space for studying quantum error-correction protocols
N. Fabre, A. Keller, P. Milman·May 19, 2020
We introduce a quasi-probability phase space distribution with two pairs of azimuthal-angular coordinates. This representation is well adapted to describe quantum systems with discrete symmetry. Quantum error correction of states encoded in continuou...
Characterizing quantum correlations in spin chains
A. Niezgoda, M. Panfil, J. Chwede'nczuk·May 19, 2020
The growth in the demand for precisely crafted many-body systems of spin-$1/2$ particles/qubits is due to their top-notch versatility in application-oriented quantum-enhanced protocols and the fundamental tests of quantum theory. Here we address the ...
Coupled cluster singles and doubles variational quantum eigensolver ansatz for electronic structure calculations
Rongxin Xia, S. Kais·May 18, 2020
Variational quantum eigensolver (VQE) for electronic structure calculations is believed to be one major potential application of near term quantum computing. Among all proposed VQE algorithms, the unitary coupled cluster singles and doubles excitatio...