Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
28,891
This Month
551
Today
0
Research Volume
13,881 papers in 12 months (-10% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
Reinforcement Learning to Disentangle Multiqubit Quantum States from Partial Observations
Pavel Tashev, Stefan Petrov, Friederike Metz +1 more·Jun 12, 2024
Using partial knowledge of a quantum state to control multiqubit entanglement is a largely unexplored paradigm in the emerging field of quantum interactive dynamics with the potential to address outstanding challenges in quantum state preparation and...
Multi-reference Quantum Davidson Algorithm for Quantum Dynamics
Noah F. Berthusen, Faisal Alam, Yu Zhang·Jun 12, 2024
Simulating quantum systems is one of the most promising tasks where quantum computing can potentially outperform classical computing. However, the robustness needed for reliable simulations of medium to large systems is beyond the reach of existing q...
Novel Optimized Designs of Modulo 2n+1 Adder for Quantum Computing
Bhaskar Gaur, Himanshu Thapliyal·Jun 11, 2024
Quantum modular adders are one of the most fundamental yet versatile quantum computation operations. They help implement the functions of higher complexity, such as subtraction and multiplication, which are used in applications, such as quantum crypt...
Readout error mitigation for mid-circuit measurements and feedforward
Jin Ming Koh, Dax Enshan Koh, Jayne Thompson·Jun 11, 2024
Current quantum computing platforms suffer from readout errors, where faulty measurement outcomes are reported by the device. These errors are particularly harmful in quantum programs that rely on branch statements wherein operations in later parts o...
Quantum repeaters based on stationary Gottesman-Kitaev-Preskill qubits
Stefan Häußler, Peter van Loock·Jun 11, 2024
Quantum repeaters that incorporate quantum error correction codes have been shown to be a promising alternative compared with the original quantum repeaters that rely upon probabilistic quantum error detection depending on classical communication ove...
MPSDynamics.jl: Tensor network simulations for finite-temperature (non-Markovian) open quantum system dynamics.
Thibaut Lacroix, B. Le Dé, Angela Riva +2 more·Jun 11, 2024
The MPSDynamics.jl package provides an easy-to-use interface for performing open quantum systems simulations at zero and finite temperatures. The package has been developed with the aim of studying non-Markovian open system dynamics using the state-o...
An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem
Alessandro Gherardi, Alberto Leporati·Jun 11, 2024
Quantum annealers can be used to solve many (possibly NP-hard) combinatorial optimization problems, by formulating them as quadratic unconstrained binary optimization (QUBO) problems or, equivalently, using the Ising formulation. In this paper we ana...
Improved criteria of detecting multipartite entanglement structure
Kai Wu, Zhihua Chen, Zhen-Peng Xu +2 more·Jun 11, 2024
Multipartite entanglement is one of the crucial resources in quantum information processing tasks such as quantum metrology, quantum computing and quantum communications. It is essential to verify not only the multipartite entanglement, but also the ...
Meta-learning assisted robust control of universal quantum gates with uncertainties
Shihui Zhang, Z. Miao, Yu Pan +2 more·Jun 11, 2024
Achieving high-fidelity quantum gates is crucial for reliable quantum computing. However, decoherence and control pulse imperfections pose significant challenges in realizing the theoretical fidelity of quantum gates in practical systems. To address ...
Holographic reconstruction of black hole spacetime: machine learning and entanglement entropy
Byoungjoon Ahn, Hyun-Sik Jeong, Keun-Young Kim +1 more·Jun 11, 2024
We investigate the bulk reconstruction of AdS black hole spacetime emergent from quantum entanglement within a machine learning framework. Utilizing neural ordinary differential equations alongside Monte-Carlo integration, we develop a method tailore...
Quantum Speedup of the Dispersion and Codebook Design Problems
Kein Yukiyoshi, Taku Mikuriya, H. Rou +2 more·Jun 11, 2024
In this article, we propose new formulations of max-sum and max-min dispersion problems that enable solutions via the Grover adaptive search (GAS) quantum algorithm, offering quadratic speedup. Dispersion problems are combinatorial optimization probl...
Adaptive quantum optimization algorithms for programmable atom-cavity systems
YuChen Luo, Xiaopeng Li, Jian Lin·Jun 11, 2024
Developing quantum algorithms adaptive to specific constraints of near-term devices is an essential step towards practical quantum advantage. In a recent work [Phys. Rev. Lett. 131, 103601(2023)], we show cold atoms in an optical cavity can be built ...
Generalized Zeno effect and entanglement dynamics induced by fermion counting
Elias Starchl, Mark H. Fischer, L. M. Sieberer·Jun 11, 2024
We study a one-dimensional lattice system of free fermions subjected to a generalized measurement process: the system exchanges particles with its environment, but each fermion leaving or entering the system is counted. In contrast to the freezing of...
Optimized QUBO formulation methods for quantum computing
Dario De Santis, Salvatore Tirone, Stefano Marmi +1 more·Jun 11, 2024
Quantum computers have strict requirements for the problems that they can efficiently solve. One of the principal limiting factor for the performances of noisy intermediate-scale quantum (NISQ) devices is the number of qubits required by the running ...
CHARME: A Chain-based Reinforcement Learning Approach for the Minor Embedding Problem
Hoang M. Ngo, Nguyen Do, Minh N. Vu +3 more·Jun 11, 2024
Quantum annealing (QA) has great potential to solve combinatorial optimization problems efficiently. However, the effectiveness of QA algorithms is heavily based on the embedding of problem instances, represented as logical graphs, into the quantum p...
Chebyshev Approximated Variational Coupled Cluster for Quantum Computing
Luca Erhart, Yuichiro Yoshida, V. Khinevich +1 more·Jun 11, 2024
We propose an approach to approximately implement the variational coupled cluster (VCC) theory on quantum computers, which struggles with exponential scaling of computational costs on classical computers. To this end, we employ expanding the exponent...
Detailed assessment of calculating drag force with quantum computers: Explicit time-evolution precludes exponential advantage for nonlinear differential equations
John Penuel, Amara Katabarwa, Peter D. Johnson +5 more·Jun 10, 2024
This study examines the potential for fault-tolerant quantum computers to provide utility in fluid dynamics simulations, with a focus on drag force calculations for ship hull design. We assess whether quantum algorithms can surpass classical computat...
Superconducting qubits in the millions: the potential and limitations of modularity
S. N. Saadatmand, Tyler L. Wilson, Mark J. Hodson +11 more·Jun 10, 2024
The development of fault-tolerant quantum computers (FTQCs) is receiving increasing attention within the quantum computing community. Like conventional digital computers, FTQCs, which utilize error correction and millions of physical qubits, have the...
Spin-photon entanglement of a single Er$^{3+}$ ion in the telecom band
M. T. Uysal, L. Dusanowski, Haitong Xu +5 more·Jun 10, 2024
Long-distance quantum communication using quantum repeaters is an enabling technology for secure communication, distributed quantum computing and quantum-enhanced sensing and metrology. As a building block of quantum repeaters, spin-photon entangleme...
Leveraging modular values in quantum algorithms: the Deutsch-Jozsa
L. B. Ferraz, Timoteo Carletti, Yves Caudano·Jun 10, 2024
We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining whether a given ...