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
Magic and communication complexity
Uma Girish, Alex May, Natalie Parham +1 more·Oct 8, 2025
We establish novel connections between magic in quantum circuits and communication complexity. In particular, we show that functions computable with low magic have low communication cost. Our first result shows that the $\mathsf{D}\|$ (deterministic ...
Multi-qubit Toffoli with exponentially fewer T gates
David Gosset, Robin Kothari, Chenyi Zhang·Oct 8, 2025
Prior work of Beverland et al. has shown that any exact Clifford+$T$ implementation of the $n$-qubit Toffoli gate must use at least $n$ $T$ gates. Here we show how to get away with exponentially fewer $T$ gates, at the cost of incurring a tiny $1/\ma...
Preparation of initial states with open and periodic boundary conditions on quantum devices using matrix product states
Yibin Guo, Manuel Schneider, Takis Angelides +3 more·Oct 8, 2025
We present a framework for preparing quantum states from matrix product states (MPS) with open and periodic boundary conditions on quantum devices. The MPS tensors are mapped to unitary gates, which are subsequently decomposed into native gates on qu...
Communication-Optimal Blind Quantum Protocols
Ethan Davies, Alastair Kay·Oct 8, 2025
A user, Alice, wants to get server Bob to implement a quantum computation for her. However, she wants to leave him blind to what she's doing. What are the minimal communication resources Alice must use in order to achieve information-theoretic securi...
Software Framework for Optically Accessible Quantum Memory Using Group-IV Color Centers in Diamond
Yannick Strocka, Mohamed Belhassen, Tim Schröder +1 more·Oct 8, 2025
In the rapidly evolving field of quantum technology, the precise and detailed description of quantum components is not just a necessity but the foundation for advancing research, development, and applications. Optically accessible quantum memories ar...
A Hardware-Efficient Mølmer-Sørensen Gate for Superconducting Quantum Computers
M. AbuGhanem·Oct 8, 2025
The Mølmer-Sørensen gate, a cornerstone entangling operation in trapped-ion systems, represents a promising alternative to standard entangling gates in superconducting quantum architectures. However, its performance on superconducting hardware has re...
Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
Jonathan Allcock, Joao F. Doriguello, Gábor Ivanyos +1 more·Oct 8, 2025
Bell sampling is a simple yet powerful tool based on measuring two copies of a quantum state in the Bell basis, and has found applications in a plethora of problems related to stabiliser states and measures of magic. However, it was not known how to ...
Near-Asymptotically-Good Quantum Codes with Transversal CCZ Gates and Sublinear-Weight Parity-Checks
Louis Golowich, Venkatesan Guruswami·Oct 8, 2025
It is a major challenge to construct good quantum codes supporting fault-tolerant (e.g. transversal) non-Clifford gates with low-weight parity-check measurements. In this paper, we construct the first known quantum codes with linear dimension and dis...
Breaking the Treewidth Barrier in Quantum Circuit Simulation with Decision Diagrams
Bin Cheng, Ziyuan Wang, Ruixuan Deng +2 more·Oct 8, 2025
Classical simulation of quantum circuits is a critical tool for validating quantum hardware and probing the boundary between classical and quantum computational power. Existing state-of-the-art methods, notably tensor network approaches, have computa...
Constant-Overhead Addressable Gates via Single-Shot Code Switching
Louis Golowich, Kathleen Chang, Guanyu Zhu·Oct 8, 2025
It is a major challenge to perform addressable and parallel logical operations on constant-rate quantum LDPC (qLDPC) codes. Indeed, the overhead of targeting specific logical qubits represents a crucial bottleneck in many quantum fault-tolerance sche...
Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming
Nikos A Mitsiou, Ioannis Krikidis, George K Karagiannidis·Oct 7, 2025
Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability. However, conventional fully digital designs face significant challenges due to high hardware complexity and power consumpti...
Batched high-rate logical operations for quantum LDPC codes
Qian Xu, Hengyun Zhou, Dolev Bluvstein +5 more·Oct 7, 2025
High-rate quantum LDPC (qLDPC) codes reduce memory overhead by densely packing many logical qubits into a single block of physical qubits. Here we extend this concept to high-rate computation by constructing \emph{batched} fault-tolerant operations t...
Robust Non-Adiabatic Holonomic Gating in Qutrits via Inverse-Engineered Pulse Shaping and Error Compensation
Jie Lu, Jie-Dong Huang, Yang Qian +3 more·Oct 7, 2025
Systematic control errors, specifically Rabi frequency fluctuations and frequency detuning, constitute a primary bottleneck for high-fidelity quantum gates across leading platforms. In this work, we present a robust pulse engineering framework for no...
Entanglement dynamics and performance of two-qubit gates for superconducting qubits under non-Markovian effects
Kiyoto Nakamura, Joachim Ankerhold·Oct 7, 2025
Within a numerically exact simulation technique, the dissipative dynamics of a two-qubit architecture is considered in which each qubit couples to its individual noise source (reservoir). The goal is to reveal the role of subtle qubit-reservoir corre...
Optimal ancilla-free Clifford+T synthesis for general single-qubit unitaries
Hayata Morisaki, Kaoru Sano, Seiseki Akibue·Oct 7, 2025
We propose two Clifford+$T$ synthesis algorithms that are optimal with respect to $T$-count. The first algorithm, called deterministic synthesis, approximates any single-qubit unitary by a single-qubit Clifford+$T$ circuit with the minimum $T$-count....
Low Overhead Universal Quantum Computation with Triorthogonal Codes
Dawei Jiao, Mahdi Bayanifar, Alexei Ashikhmin +1 more·Oct 7, 2025
We study the use of triorthogonal codes for universal fault-tolerant quantum computation and propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both universality and a ...
Recovery of the second law in fully quantum thermodynamics
Naoto Shiraishi, Ryuji Takagi·Oct 7, 2025
Quantum thermodynamics investigates how robust the second law of thermodynamics serves as the unique fundamental law in the small quantum world. To tackle this problem, the quantum coherence constitutes a major difficulty of investigations, which pro...
Dynamical quantum codes and logic gates on a lattice with sparse connectivity
Dominic J. Williamson, Bence Hetényi·Oct 6, 2025
We introduce several dynamical schemes that take advantage of mid-circuit measurement and nearest-neighbor gates on a lattice with maximum vertex degree three to implement topological codes and perform logic gates between them. We first review exampl...
Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms
Frederik K. Marqversen, Gefen Baranes, Maxim Sirotin +1 more·Oct 6, 2025
Modular architectures offer a scalable path toward fault-tolerant quantum computing by interconnecting smaller quantum processing units (QPUs) provided that high-rate, fault-tolerant interfaces can be realized across modules. We present a comprehensi...
Self-dual bivariate bicycle codes with transversal Clifford gates
Zijian Liang, Yu-An Chen·Oct 6, 2025
Bivariate bicycle codes are promising candidates for high-threshold, low-overhead fault-tolerant quantum memories. Meanwhile, color codes are the most prominent self-dual CSS codes, supporting transversal Clifford gates that have been demonstrated ex...