Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
27,548
This Month
1,041
Today
0
Research Volume
12,927 papers in 12 months (-5% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
Energy, Bosons and Computational Complexity
Ulysse Chabaud, Sevag Gharibian, Saeed Mehraban +4 more·Oct 9, 2025
We investigate the role of energy, i.e. average photon number, as a resource in the computational complexity of bosonic systems. We show three sets of results: (1. Energy growth rates) There exist bosonic gate sets which increase energy incredibly ra...
Quantum Relative Entropy Decay Composition Yields Shallow, Unstructured k-Designs
Nicholas Laracuente·Oct 9, 2025
A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits up to thei...
Non-Clifford Gates are Required for Long-Term Memory
Jon Nelson, Joel Rajakumar, Michael J. Gullans·Oct 9, 2025
We show that all Clifford circuits under interspersed depolarizing noise lose memory of their input exponentially quickly, even when given access to a constant supply of fresh qubits in arbitrary states. This is somewhat surprising given the result o...
Dynamical error reshaping for dual-rail erasure qubits
Filippos Dakis, Shruti Puri, Sophia E. Economou +1 more·Oct 9, 2025
Erasure qubits -- qubits designed to have an error profile that is dominated by detectable leakage errors -- are a promising way to cut down the resources needed for quantum error correction. There have been several recent experiments demonstrating e...
Universal Fault Tolerance with Non-Transversal Clifford Gates
Benjamin Anker, Milad Marvian·Oct 9, 2025
We propose a scheme for the fault-tolerant implementation of arbitrary Clifford circuits. To achieve this, we extend previous work on flag gadgets for syndrome extraction to a general framework that flags any Clifford circuit. This framework opens ne...
Clifford+V synthesis for multi-qubit unitary gates
Soichiro Yamazaki, Seiseki Akibue·Oct 9, 2025
We developed a general framework for synthesizing target gates by using a finite set of basic gates, which is a crucial step in quantum compilation. When approximating a gate in SU($n$), a naive brute-force search requires a computational complexity ...
Transversal gates for probabilistic implementation of multi-qubit Pauli rotations
Nobuyuki Yoshioka, Alireza Seif, Andrew Cross +1 more·Oct 9, 2025
We introduce a general framework for weak transversal gates -- probabilistic implementation of logical unitaries realized by local physical unitaries -- and propose a novel partially fault-tolerant quantum computing architecture that surpasses the st...
Adaptive Quantum Homeopathy
Lennart Bittel, Lorenzo Leone·Oct 9, 2025
Randomness is a fundamental resource in quantum information, with crucial applications in cryptography, algorithms, and error correction. A central challenge is to construct unitary $k$-designs that closely approximate Haar-random unitaries while min...
Symmetric Self-Dual Quantum Codes on High Dimensional Expanders
Kyle Gulshen, Tali Kaufman·Oct 9, 2025
We construct a family of constant-rate highly-symmetric self-dual qLDPC codes on high dimensional expanders. This is the first self-dual code constructed on high dimensional expanders and also the first such code with a rich (e.g. transitive) symmetr...
Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
Daniel Grier, Daniel M. Kane, Jackson Morris +2 more·Oct 9, 2025
We construct a family of distributions $\{\mathcal{D}_n\}_n$ with $\mathcal{D}_n$ over $\{0, 1\}^n$ and a family of depth-$7$ quantum circuits $\{C_n\}_n$ such that $\mathcal{D}_n$ is produced exactly by $C_n$ with the all zeros state as input, yet a...
Speed limits of two-qutrit gates
Bora Basyildiz, Zhexuan Gong, Sahel Ashhab·Oct 9, 2025
The speed of elementary quantum gates sets a limit on the speed at which quantum circuits can be applied and, as a result, the size of the computations that can be performed on a quantum computer. This limitation stems from the fact that present-day ...
Asymptotic Gate Count Bounds for Ancilla-Free Single-Qubit Synthesis with Arithmetic Gates
Kaoru Sano, Hayata Morisaki, Seiseki Akibue·Oct 8, 2025
We study ancilla-free approximation of single-qubit unitaries $U\in {\rm SU}(2)$ by gate sequences over Clifford+$G$, where $G\in\{T,V\}$ or their generalization. Let $p$ denote the characteristic factor of the gate set (e.g., $p=2$ for $G=T$ and $p=...
Nonlinear Coupling between Motional Modes in Trapped Ion Quantum Processors
Wes Johnson, Brandon Ruzic·Oct 8, 2025
Trapped-ion crystals are a leading platform for quantum information science, but achieving the high-fidelity entangling gates required for fault-tolerant quantum computing becomes harder as system size increases. As systems scale, spectral crowding m...
On Quantum Computation Using Bias-Preserving Gates
Debadrito Roy, Aryaman Manish Kolhe, V. Lalitha +1 more·Oct 8, 2025
Certain types of quantum computing platforms, such as those realized using Rydberg atoms or Kerr-cat qubits, are natively more susceptible to Pauli-Z noise than Pauli-X noise, or vice versa. On such hardware, it is useful to ensure that computations ...
Error correction phase transition in noisy random quantum circuits
Jon Nelson, Joel Rajakumar, Michael J. Gullans·Oct 8, 2025
In this work, we study the task of encoding logical information via a noisy quantum circuit. It is known that at superlogarithmic depth, the output of any noisy circuit without reset gates or intermediate measurements becomes indistinguishable from t...
Simulation of Quantum Repeater Networks under Decoherence and Purification Constraints
Wenhan Li, Shiyu Zhang·Oct 8, 2025
Long-distance quantum communication requires reliable entanglement distribution, but direct generation with protocols such as Barrett--Kok suffers from exponentially decreasing success probability with distance, making it impractical over hundreds of...
Proposals for experimentally realizing (mostly) quantum-autonomous gates
José Antonio Marín Guzmán, Yu-Xin Wang, Tom Manovitz +4 more·Oct 8, 2025
Autonomous quantum machines (AQMs) execute tasks without requiring time-dependent external control. Motivations for AQMs include the restrictions imposed by classical control on quantum machines' coherence times and geometries. Most AQM work is theor...
End-to-end quantum algorithms for tensor problems
Enrico Fontana, Sivaprasad Omanakuttan, Junhyung Lyle Kim +4 more·Oct 8, 2025
We present a comprehensive end-to-end quantum algorithm for tensor problems, including tensor PCA and planted kXOR, that achieves potential superquadratic quantum speedups over classical methods. We build upon prior works by Hastings~(\textit{Quantum...
Transversal dimension jump for product qLDPC codes
Christine Li, John Preskill, Qian Xu·Oct 8, 2025
We introduce transversal dimension jump, a code-switching protocol for lifted product (LP) quantum low-density parity-check (qLDPC) codes across different chain-complex dimensions, enabling universal fault-tolerant quantum computation with low overhe...
From Quantum Circuits with Ultraslow Dynamics to Classical Plaquette Models
Vikram Ravindranath, Hanchen Liu, Xiao Chen·Oct 8, 2025
We introduce a family of hybrid quantum circuits involving unitary gates and projective measurements that display a measurement-induced phase transition. Remarkably, the volume-law phase featuring logarithmic entanglement growth for certain initial s...