Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
31,204
This Month
1,213
Today
0
Research Volume
15,360 papers in 12 months (-8% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
On Zero-Knowledge Proofs over the Quantum Internet
M. Carney·Dec 6, 2022
This paper presents a new method for quantum identity authentication (QIA) protocols. The logic of classical zero-knowledge proofs (ZKPs) due to Schnorr is applied in quantum circuits and algorithms. This novel approach gives an exact way with which ...
Ans\"atze for Noisy Variational Quantum Eigensolvers
Mafalda Ramôa·Dec 6, 2022
The hardware requirements of useful quantum algorithms remain unmet by the quantum computers available today. Because it was designed to soften these requirements, the Variational Quantum Eigensolver (VQE) has gained popularity as a contender for a c...
Generalized Belief Propagation Algorithms for Decoding of Surface Codes
Josias Old, M. Rispler·Dec 6, 2022
Belief propagation (BP) is well-known as a low complexity decoding algorithm with a strong performance for important classes of quantum error correcting codes, e.g. notably for the quantum low-density parity check (LDPC) code class of random expander...
Quantum Worst-Case to Average-Case Reductions for All Linear Problems
Vahid R. Asadi, Alexander Golovnev, Tom Gur +2 more·Dec 6, 2022
We study the problem of designing worst-case to average-case reductions for quantum algorithms. For all linear problems, we provide an explicit and efficient transformation of quantum algorithms that are only correct on a small (even sub-constant) fr...
Iterative Gradient Ascent Pulse Engineering algorithm for quantum optimal control
Yuquan Chen, Yajie Hao, Ze Wu +6 more·Dec 6, 2022
Gradient ascent pulse engineering algorithm (GRAPE) is a typical method to solve quantum optimal control problems. However, it suffers from an exponential resource in computing the time evolution of quantum systems with the increasing number of qubits...
Tight Bell inequalities from polytope slices
J. Jesús, Emmanuel Zambrini Cruzeiro·Dec 6, 2022
We derive new tight bipartite Bell inequalities for various scenarios. A bipartite Bell scenario $(X,Y,A,B)$ is defined by the numbers of settings and outcomes per party, $X$, $A$ and $Y$, $B$ for Alice and Bob, respectively. We derive the complete s...
Generation of Perfectly Entangled Two and Three Qubits States by Classical Random Interaction
Javed Akram·Dec 6, 2022
This study examines the possibility of finding perfect entanglers for a Hamiltonian which corresponds to several quantum information platforms of interest at the present time. However, in this study, a superconducting circuit is used that stands out ...
The ribbon category framework for topological quantum computing
Willie Aboumrad·Dec 6, 2022
. This expository article supplies the mathematical background underpinning the braid representation calculator introduced in [ Abo22]; those representations describe the sets of logic gates available to a topological quantum computer for processing ...
Prolegomena to a hybrid classical/Rydberg simulator for hadronization (QuPyth)
Blake Senseman, Zane Ozzello, Kenneth Heitritter +2 more·Dec 5, 2022
Programmable neutral-atom arrays provide a promising route to real-time analog simulation of strongly interacting quantum systems. We introduce a two leg Rydberg atom ladder that realizes string dynamics and controllable particle production using exp...
Enhancing Quantum Annealing via entanglement distribution
Raul A. Santos, L. Buffoni, Y. Omar·Dec 5, 2022
Quantum Annealing has proven to be a powerful tool to tackle several optimization problems. However, its performance is severely impacted by the limited connectivity of the underlying quantum hardware, compromising the quantum speedup. In this work, ...
Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers
Luning Zhao, J. Goings, Kyujin Shin +8 more·Dec 5, 2022
Variational quantum eigensolvers (VQE) are among the most promising approaches for solving electronic structure problems on near-term quantum computers. A critical challenge for VQE in practice is that one needs to strike a balance between the expres...
symQV: Automated Symbolic Verification of Quantum Programs
Fabian Bauer-Marquart, S. Leue, Christian Schilling·Dec 5, 2022
We present symQV, a symbolic execution framework for writing and verifying quantum computations in the quantum circuit model. symQV can automatically verify that a quantum program complies with a first-order specification. We formally introduce a sym...
Diabatic quantum annealing for the frustrated ring model
Jeremy Côté, F. Sauvage, Martín Larocca +3 more·Dec 5, 2022
Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground sta...
Robustness of Quantum Algorithms for Nonconvex Optimization
Weiyuan Gong, Chenyi Zhang, Tongyang Li·Dec 5, 2022
Recent results suggest that quantum computers possess the potential to speed up nonconvex optimization problems. However, a crucial factor for the implementation of quantum optimization algorithms is their robustness against experimental and statisti...
Deep quantum neural networks on a superconducting processor
Xiaoxuan Pan, Zhide Lu, Weiting Wang +10 more·Dec 5, 2022
Deep learning and quantum computing have achieved dramatic progresses in recent years. The interplay between these two fast-growing fields gives rise to a new research frontier of quantum machine learning. In this work, we report an experimental demo...
Bayesian phase difference estimation algorithm for direct calculation of fine structure splitting: accelerated simulation of relativistic and quantum many-body effects
K. Sugisaki, Srinivasa Prasannaa, S. Ohshima +4 more·Dec 5, 2022
Despite rapid progress in the development of quantum algorithms in quantum computing as well as numerical simulation methods in classical computing for atomic and molecular applications, no systematic and comprehensive electronic structure study of a...
Simulating Markovian Open Quantum Systems Using Higher-Order Series Expansion
Xiantao Li, C. Wang·Dec 5, 2022
We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. The performance of our algorithm is similar to the previous state-of-the-art quantum algorithm, i.e., it scales linearly in evolution time and po...
Accurate Computation of Relativistic Excitation Energies Using Quantum Annealing
Vikrant Kumar, Nishanth Baskaran, V. S. Prasannaa +4 more·Dec 4, 2022
We report the first results for the computation of relativistic effects in quantum many-body systems using quantum annealers. An average accuracy of 98.9% in the fine structure splitting of boron-like ions with respect to experiments has been achieve...
Quantum hobbit routing: Annealer implementation of generalized Travelling Salesperson Problem
Iñigo Pérez Delgado, Beatriz García-Martínez, Aitor Moreno-Fernandez-de-Leceta +1 more·Dec 4, 2022
In this paper, we present an implementation of a Job Selection Problem (JSP) — a generalization of the well-known Travelling Salesperson Problem (TSP)— of $N=9$ jobs on its Quadratic Unconstrained Binary Optimization (QUBO) form, using $\mathrm{O}(N)...
Approximate Boltzmann distributions in quantum approximate optimization
Phillip C. Lotshaw, G. Siopsis, James Ostrowski +4 more·Dec 4, 2022
Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circui...