Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
11,887
This Month
442
Today
0
Research Volume
11,044 papers in 12 months (-19% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
A fault-tolerant encoding for qubit-controlled collective spins
Charlotte Franke, Dorian A. Gangloff·Mar 16, 2026
Quantum error correction (QEC) is indispensable for scalable quantum computing, but implementing it with minimal hardware overhead remains a central challenge. Large spin systems with collective degrees of freedom offer a promising route to reducing ...
Quantum Noise Suppression at Scale with Crosstalk-Robust Gate Sets
Andy J. Goldschmidt, Emilio Peláez Cisneros, Ryan Sitler +3 more·Mar 16, 2026
We introduce crosstalk-robust gate sets, which are obtained using a novel, scalable optimal control problem exploiting locality. Through the suppression of pairwise quantum crosstalk, the gate sets enable robustness that extends to multi-qubit circui...
Optimization of the HHL Algorithm
Dhruv Sood, Nilmani Mathur, Vikram Tripathi·Mar 16, 2026
The Harrow-Hassidim-Lloyd (HHL) algorithm is a quantum algorithm for solving systems of linear equations that, in principle, offers an exponential improvement in scaling with the system size compared to classical approaches. In this work, we investig...
Exclusive Scattering Channels from Entanglement Structure in Real-Time Simulations
Nikita A. Zemlevskiy·Mar 16, 2026
A scattering event in a quantum field theory is a coherent superposition of all processes consistent with its symmetries and kinematics. While real-time simulations have progressed toward resolving individual channels, existing approaches rely on kno...
Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code
Shixin Wu, Dawei Zhong, Todd A. Brun +1 more·Mar 16, 2026
Code-switching offers a route to universal, fault-tolerant quantum computation by circumventing the limitation implied by the Eastin-Knill theorem against a universal transversal gate set within a single quantum code. Here, we present a fault-toleran...
Benchmarking quantum simulation with neutron-scattering experiments
Yi-Ting Lee, Keerthi Kumaran, Bibek Pokharel +7 more·Mar 16, 2026
A central goal of quantum computation is the realistic simulation of quantum materials. Although quantum processors have advanced rapidly in scale and fidelity, it has remained unclear whether pre-fault-tolerant devices can perform quantitatively rel...
Simulating the Open System Dynamics of Multiple Exchange-Only Qubits using Subspace Monte Carlo
Tameem Albash, N. Tobias Jacobson·Mar 16, 2026
We propose a Monte Carlo based method for simulating the open system dynamics of multiple exchange-only (EO) qubits. In the EO encoding, the total spin projection quantum number along the $z$-axis of the three constituent spins remains unchanged unde...
Optimizing and Comparing Quantum Resources of Statistical Phase Estimation and Krylov Subspace Diagonalization
Oumarou Oumarou, Pauline J. Ollitrault, Stefano Polla +1 more·Mar 16, 2026
We develop a framework that enables direct and meaningful comparison of two early fault-tolerant methods for the computation of eigenenergies, namely \gls{qksd} and \gls{spe}, within which both methods use expectation values of Chebyshev polynomials ...
Analog-Digital Quantum Computing with Quantum Annealing Processors
Rahul Deshpande, Majid Kheirkhah, Chris Rich +12 more·Mar 16, 2026
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing annealing QPUs to ...
End-to-end performance of quantum-accelerated large-scale linear algebra workflows
Daiwei Zhu, Miguel Angel Lopez-Ruiz, François-Henry Rouet +5 more·Mar 16, 2026
Solving large-scale sparse linear systems is a challenging computational task due to the introduction of non-zero elements, or "fill-in." The Graph Partitioning Problem (GPP) arises naturally when minimizing fill-in and accelerating solvers. In this ...
Cavity elimination in cavity-QED: a self-consistent input-output approach
Eliott Rambeau, Loïc Lanco·Mar 16, 2026
Simplifying composite open quantum systems through model reduction is central to enable their analytical and numerical understanding. In this work, we introduce a self-consistent approach to eliminate the cavity degrees of freedom of cavity quantum e...
Robust high-order quantum simulation using finite-width pulses
Leeseok Kim, Milad Marvian·Mar 16, 2026
We present a general framework for promoting first-order pulse sequences in quantum simulation to higher-order sequences that maintain robustness in the presence of finite pulse-width effects. Our approach maps a given first-order pulse sequence to a...
An alternating-minimization method for preparing low-energy states
Anurag Anshu·Mar 16, 2026
Preparing low energy states is a central challenge in quantum computing and quantum complexity theory. Several known approaches to prepare low energy states often get stuck in suboptimal states, such as high energy eigenstates (or low variance high e...
Quantum simulation of the Haldane phase using open shell molecules
Suman Aich, Ceren B. Dag, H. A. Fertig +2 more·Mar 16, 2026
Dipolar molecules in optical traps are a versatile platform for studying many-body phases of quantum matter in the presence of strong and long-range interactions. The dipolar interactions in such setups can be enabled by microwave driving opposite pa...
Adaptive Control of Stochastic Error Accumulation in Fault-Tolerant Quantum Computation
Tirtha Haque·Mar 16, 2026
In realistic hardware for quantum computation that possesses fault-tolerance, non-stationary noise and stochastic drift lead to logical failure from the temporal accumulation of errors, not from independent events. Static decoding and fixed calibrati...
GPU-Accelerated Quantum Simulation of Stabilizer Circuits
Muhammad Osama, Dimitrios Thanos, Alfons Laarman·Mar 15, 2026
We introduce new parallel algorithms for efficiently simulating stabilizer (Clifford) circuits on GPUs, with a focus on data-parallel tableau evolution and scalable handling of projective measurements. Our approach reformulates key bottlenecks in sta...
Evaluating Calibration-Based Digital Twins for IBM Quantum Hardware Simulation
Edgars Bautra, Maksims Dimitrijevs, Abuzer Yakaryilmaz·Mar 15, 2026
We evaluate calibration-based digital twins for IBM Quantum hardware, aiming to reproduce hardware measurement outcomes on classical simulators. We present a workflow that builds twins from downloadable calibration CSV files by mapping coherence time...
Parrondo-type enhancement of quantum-state transfer in spin chains
Rafael Vieira, Edgard P. M. Amorim·Mar 15, 2026
Spin chains have been widely studied as quantum channels for short-distance communication in quantum devices, where many-body dynamics can mediate quantum-state transfer between distant sites. In finite unmodulated chains, however, dispersion and int...
Quantum Enhanced Pauli Propagation
S. Majumder, J. R. Garrison, L. Luo +8 more·Mar 15, 2026
Accurately estimating observables on noisy quantum devices remains a central challenge for near-term quantum algorithms. While quantum error mitigation techniques can reduce noise-induced bias, they often rely on unverifiable assumptions about the ci...
How to find expressible and trainable parameterized quantum circuits?
Peter Röseler, Dennis Willsch, Kristel Michielsen·Mar 15, 2026
Whether parameterized quantum circuits (PQCs) can be systematically constructed to be both trainable and expressive remains an open question. Highly expressive PQCs often exhibit barren plateaus, while several trainable alternatives admit efficient c...