Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
31,204
This Month
1,213
Today
0
Research Volume
15,356 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
Quantum Computing Approach for Energy Optimization in a Prosumer Community
C. Mastroianni, L. Scarcello, J. Settino·Sep 9, 2022
This paper presents a quantum approach for the formulation and solution of the prosumer problem, i.e., the problem of minimizing the energy cost incurred by a number of users in an energy community, while addressing the constraints given by the balan...
Quantum optimization with arbitrary connectivity using Rydberg atom arrays
Minh Hoai Nguyen, Jin-Guo Liu, J. Wurtz +3 more·Sep 8, 2022
Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits. In particular, the maximum independen...
Tuning arrays with rays: Physics-informed tuning of quantum dot charge states
J. Ziegler, F. Luthi, Mick Ramsey +3 more·Sep 8, 2022
Quantum computers based on gate-defined quantum dots (QDs) are expected to scale. However, as the number of qubits increases, the burden of manually calibrating these systems becomes unreasonable and autonomous tuning must be used. There has been a r...
A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit
A. Feldman, J. Kleer, Ion Matei·Sep 8, 2022
Faults are stochastic by nature while most man-made systems, and especially computers, work deterministically. This necessitates the linking of probability theory with mathematical logics, automata, and switching circuit theory. This paper provides s...
Quantum sparse coding
Y. Romano, H. Primack, Talya Vaknin +5 more·Sep 8, 2022
The ultimate goal of any sparse coding method is to accurately recover from a few noisy linear measurements, an unknown sparse vector. Unfortunately, this estimation problem is NP-hard in general, and it is therefore always approached with an approxi...
BQA: a high-performance quantum circuits scheduling strategy based on heuristic search
Xin-miao Chen, Shi Wang, Yong-jin Ye +2 more·Sep 8, 2022
Quantum computing is currently a research hotspot in both academia and industry. The inherent parallelism of quantum computers and the resulting powerful computing power will bring new solutions to many problems that are difficult for classical compu...
Shortest Route to Non-Abelian Topological Order on a Quantum Processor.
Nathanan Tantivasadakarn, R. Verresen, A. Vishwanath·Sep 8, 2022
A highly coveted goal is to realize emergent non-Abelian gauge theories and their anyonic excitations, which encode decoherence-free quantum information. While measurements in quantum devices provide new hope for scalably preparing such long-range en...
Bayesian Optimization for QAOA
Simone Tibaldi, D. Vodola, Edoardo Tignone +1 more·Sep 8, 2022
The quantum approximate optimization algorithm (QAOA) adopts a hybrid quantum-classical approach to find approximate solutions to variational optimization problems. In fact, it relies on a classical subroutine to optimize the parameters of a quantum ...
Deterministic quantum computation with one-clean-qubit model as an open quantum system
Jake Xuereb, S. Campbell, J. Goold +1 more·Sep 8, 2022
The DQC1 complexity class, or power of one qubit model, is examined as an open quantum system. We study the dynamics of a register of qubits carrying out a DQC1 algorithm and show that, for any algorithm in the complexity class, the evolution of the ...
Automatic structural optimization of tree tensor networks
T. Hikihara, H. Ueda, K. Okunishi +2 more·Sep 7, 2022
Tree tensor network (TTN) provides an essential theoretical framework for the practical simulation of quantum many-body systems, where the network structure defined by the connectivity of the isometry tensors plays a crucial role in improving its app...
Synthesizing efficient circuits for Hamiltonian simulation
Priyanka Mukhopadhyay, N. Wiebe, Hong Zhang·Sep 7, 2022
We provide an approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations. The total number of gates, espec...
A learning theory for quantum photonic processors and beyond
M. Rosati·Sep 7, 2022
We consider the tasks of learning quantum states, measurements and channels generated by continuous-variable (CV) quantum circuits. This family of circuits is suited to describe optical quantum technologies and in particular it includes state-of-the-...
Improved maximum-likelihood quantum amplitude estimation
A. Callison, D. Browne·Sep 7, 2022
Quantum amplitude estimation is a key subroutine in a number of powerful quantum algorithms, including quantum-enhanced Monte Carlo simulation and quantum machine learning. Maximum-likelihood quantum amplitude estimation (MLQAE) is one of a number of...
Quantum computing teaching with CoSpaces
F. Sisini, Igor Ciminelli, F. Bovino·Sep 7, 2022
The first prototypes of quantum computers sparked interest in quantum computing and the basic principles of quantum mechanics. The education project on the physical bases of quantum computing is part of this context, based on the experimental descrip...
Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
Bence Bak'o, A. Glos, Özlem Salehi +1 more·Sep 7, 2022
Current state-of-the-art quantum optimization algorithms require representing the original problem as a binary optimization problem, which is then converted into an equivalent cost Hamiltonian suitable for the quantum device. Implementing each term o...
Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation
Cameron Ibrahim, Danylo Lykov, Zichang He +2 more·Sep 7, 2022
One of the key problems in tensor network based quantum circuit simulation is the construction of a contraction tree which minimizes the cost of the simulation, where the cost can be expressed in the number of operations as a proxy for the simulation...
A self-similar sine–cosine fractal architecture for multiport interferometers
J. Basani, S. Vadlamani, S. Bandyopadhyay +2 more·Sep 7, 2022
Abstract Multiport interferometers based on integrated beamsplitter meshes have recently captured interest as a platform for many emerging technologies. In this paper, we present a novel architecture for multiport interferometers based on the sine–co...
Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions
K. Okada, Hirofumi Nishi, Taichi Kosugi +1 more·Sep 7, 2022
Quantum approximate optimization algorithm (QAOA) is a promising hybrid quantum-classical algorithm to solve combinatorial optimization problems in the era of noisy intermediate-scale quantum computers. Recently it has been revealed that warm-start a...
Quantum reservoir computing implementation on coherently coupled quantum oscillators
Julien Dudas, Baptiste Carles, E. Plouet +3 more·Sep 7, 2022
Quantum reservoir computing is a promising approach for quantum neural networks, capable of solving hard learning tasks on both classical and quantum input data. However, current approaches with qubits suffer from limited connectivity. We propose an ...
Quantum Simulation on Noisy Superconducting Quantum Computers
Kaelyn Ferris, A. Rasmusson, N. Bronn +1 more·Sep 6, 2022
Quantum simulation is a potentially powerful application of quantum computing, holding the promise to be able to emulate interesting quantum systems beyond the reach of classical computing methods. Despite such promising applications, and the increas...