Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
28,188
This Month
0
Today
0
Research Volume
13,351 papers in 12 months (+7% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
How hard is it to verify a classical shadow?
Georgios Karaiskos, Dorian Rudolph, Johannes Jakob Meyer +2 more·Oct 9, 2025
Classical shadows are succinct classical representations of quantum states which allow one to encode a set of properties P of a quantum state rho, while only requiring measurements on logarithmically many copies of rho in the size of P. In this work,...
Randomized and quantum approximate matrix multiplication
Simon Apers, Arjan Cornelissen, Samson Wang·Oct 9, 2025
The complexity of matrix multiplication is a central topic in computer science. While the focus has traditionally been on exact algorithms, a long line of literature also considers randomized algorithms, which return an approximate solution in faster...
The communication power of indefinite causal order
Xuanqiang Zhao, Benchi Zhao, Cyril Branciard +1 more·Oct 9, 2025
Quantum theory is in principle compatible with scenarios where physical processes occur in an indefinite order, potentially yielding advantages in a broad range of information processing tasks. However, advantages in communication, the most basic for...
A Formalization of the Generalized Quantum Stein's Lemma in Lean
Alex Meiburg, Leonardo A. Lessa, Rodolfo R. Soldati·Oct 9, 2025
The Generalized Quantum Stein's Lemma is a theorem in quantum hypothesis testing that provides an operational meaning to the relative entropy within the context of quantum resource theories. Its original proof was found to have a gap, which led to a ...
Hardness of recognizing phases of matter
Thomas Schuster, Dominik Kufel, Norman Y. Yao +1 more·Oct 9, 2025
We prove that recognizing the phase of matter of an unknown quantum state is quantum computationally hard. More specifically, we show that the quantum computational time of any phase recognition algorithm must grow exponentially in the range of corre...
Localizing entanglement in high-dimensional states
Christopher Vairogs, Akanksha Chablani, Leo Lee +3 more·Oct 9, 2025
In this work, we study the asymptotic behavior of protocols that localize entanglement in large multi-qubit states onto a subset of qubits by measuring the remaining qubits. We use the maximal average n-tangle that can be generated on a fixed subsyst...
Learning and certification of local time-dependent quantum dynamics and noise
Daniel Stilck França, Tim Möbus, Cambyse Rouzé +1 more·Oct 9, 2025
Hamiltonian learning protocols are essential tools to benchmark quantum computers and simulators. Yet rigorous methods for time-dependent Hamiltonians and Lindbladians remain scarce despite their wide use. We close this gap by learning the time-depen...
Quantum Probe Tomography
Sitan Chen, Jordan Cotler, Hsin-Yuan Huang·Oct 9, 2025
Characterizing quantum many-body systems is a fundamental problem across physics, chemistry, and materials science. While significant progress has been made, many existing Hamiltonian learning protocols demand digital quantum control over the entire ...
Average-case quantum complexity from glassiness
Alexander Zlokapa, Bobak T. Kiani, Eric R. Anschuetz·Oct 9, 2025
Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms. For example, it can obstruct constant-time Langevin dynamics and message-passing in random $k$-SAT and max-cut i...
Compiling Any $\mathsf{MIP}^{*}$ into a (Succinct) Classical Interactive Argument
Andrew Huang, Yael Tauman Kalai·Oct 9, 2025
We present a generic compiler that converts any $\mathsf{MIP}^{*}$ protocol into a succinct interactive argument where the communication and the verifier are classical, and where post-quantum soundness relies on the post-quantum sub-exponential hardn...
Quartic quantum speedups for community detection
Alexander Schmidhuber, Alexander Zlokapa·Oct 9, 2025
Community detection is a foundational problem in data science. Its natural extension to hypergraphs captures higher-order correlations beyond pairwise interactions. In this work, we develop a quantum algorithm for hypergraph community detection that ...
Optimal Distillation of Qubit Clocks
Sujay Kazi, Iman Marvian·Oct 9, 2025
We study coherence distillation under time-translation-invariant operations: given many copies of a quantum state containing coherence in the energy eigenbasis, the aim is to produce a purer coherent state while respecting the time-translation symmet...
Fractional quantum Hall states under density decoherence
Zijian Wang, Ruihua Fan, Tianle Wang +2 more·Oct 9, 2025
Fractional quantum Hall states are promising platforms for topological quantum computation due to their capacity to encode quantum information in topologically degenerate ground states and in the fusion space of non-abelian anyons. We investigate how...
Guess your neighbor's input: Quantum advantage in Feige's game
Simon Schmidt, Sigurd A. L. Storgaard, Michael Walter +1 more·Oct 9, 2025
In this article, we study a nonlocal game with two questions and three answers per player, which was first considered by Feige in 1991, and show that there is quantum advantage in this game. We prove that the game is a robust self-test for the $3$-di...
Completeness for Fault Equivalence of Clifford ZX Diagrams
Maximilian Rüsch, Benjamin Rodatz, Aleks Kissinger·Oct 9, 2025
Two circuits are considered to be equivalent under noise if the effect of faults on one circuit is no worse than the effect of faults on the other circuit. We call this relationship fault equivalence. Fault equivalence offers a way to transform circu...
Universality and kernel-adaptive training for classically trained, quantum-deployed generative models
Andrii Kurkin, Kevin Shen, Susanne Pielawa +2 more·Oct 9, 2025
The instantaneous quantum polynomial (IQP) quantum circuit Born machine (QCBM) has been proposed as a promising quantum generative model over bitstrings. Recent works have shown that the training of IQP-QCBM is classically tractable w.r.t. the so-cal...
High-Sensitivity Optical Detection of Electron-Nuclear Spin Clusters in Diamond
Louis Chambard, Alrik Durand, Julien Voisin +3 more·Oct 9, 2025
We perform sensitive nuclear magnetic resonance (NMR) with spin ensembles which are polarized by nitrogen vacancy centers (NV centers) in diamond at room-temperature. With a near shot-noise-limited photoluminescence detection and a highly uniform mag...
An Improved Quantum Algorithm for 3-Tuple Lattice Sieving
Lynn Engelberts, Yanlin Chen, Amin Shiraz Gilani +3 more·Oct 9, 2025
The assumed hardness of the Shortest Vector Problem in high-dimensional lattices is one of the cornerstones of post-quantum cryptography. The fastest known heuristic attacks on SVP are via so-called sieving methods. While these still take exponential...
Agnostic Product Mixed State Tomography via Robust Statistics
Alvan Arulandu, Ilias Diakonikolas, Daniel Kane +1 more·Oct 9, 2025
We study the complexity of two closely related learning problems, one quantum and one classical. In the quantum setting, we consider agnostic tomography for the natural class of product mixed states. Given $N$ copies of an $n$-qubit state $ρ$, the go...
Learning Coulomb Potentials and Beyond with Free Fermions in Continuous Space
Andreas Bluhm, Marius Lemm, Tim Möbus +1 more·Oct 9, 2025
The first-principles formulation of quantum mechanics relevant for quantum chemistry and trapped quantum gases involves particles in the continuous space $\mathbb R^d$. We present a unified framework and modular algorithm for learning external potent...