Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
28,250
This Month
22
Today
0
Research Volume
13,405 papers in 12 months (-22% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
Generalized Entanglement of Purification Criteria for 2-Producible States in Multipartite Systems
Tian-Ren Jin, Yu-Ran Zhang, Heng Fan·Oct 6, 2025
Multipartite entanglement has a much more complex structure than bipartite entanglement. A state that lacks generic multipartite entanglement is 2-producible, i.e. it can be written as a tensor product of at most 2-partite entangled states. Recently,...
Embedding-Aware Noise Modeling of Quantum Annealing
Seon-Geun Jeong, Mai Dinh Cong, Dae-Il Noh +2 more·Oct 6, 2025
Quantum annealing provides a practical realization of adiabatic quantum computation and has emerged as a promising approach for solving large-scale combinatorial optimization problems. However, current devices remain constrained by sparse hardware co...
Double-pair Coulomb and Breit photon correction to the correlated relativistic energy
Péter Jeszenszki, Edit Mátyus·Oct 6, 2025
The simplest, algebraic quantum-electrodynamical corrections, due to the double-negative energy subspace and instantaneous interactions, are computed to the no-pair energy of two-spin-1/2-fermion systems. Numerical results are reported for two-electr...
Expander qLDPC Codes against Long-range Correlated Errors in Memory
Yash Deepak Kashtikar, Pranay Mathur, Sudharsan Senthil +1 more·Oct 6, 2025
Fault-tolerance using constant space-overhead against long-range correlated errors is an important practical question. In the pioneering works [Terhal and Burkard, PRA 2005], [Aliferis et al, PRA 2005], [Aharonov et al, PRL 2006], fault-tolerance usi...
Quantum Reverse Shannon Theorem Simplified
Gilad Gour·Oct 6, 2025
We revisit the quantum reverse Shannon theorem, a central result in quantum information theory that characterizes the resources needed to simulate quantum channels when entanglement is freely available. We derive a universal additive upper bound on t...
Efficient three-qubit gates with giant atoms
Guangze Chen, Anton Frisk Kockum·Oct 6, 2025
Three-qubit gates are highly beneficial operations in quantum computing, enabling compact implementations of quantum algorithms and efficient generation of multipartite entangled states. However, realizing such gates with high fidelity remains challe...
Integrated photonic platform with high-speed entanglement generation and witnessing
Gong Zhang, Chao Wang, Koon Tong Goh +10 more·Oct 6, 2025
High-speed generation and efficient entanglement detection on a photonic chip are essential for quantum information applications but hard to achieve due to common photonic chips' material properties and limited component performance. In this work, we...
Computational Certified Deletion Property of Magic Square Game and its Application to Classical Secure Key Leasing
Yuki Takeuchi, Duo Xu·Oct 6, 2025
We present the first construction of a computational Certified Deletion Property (CDP) achievable with classical communication, derived from the compilation of the non-local Magic Square Game (MSG). We leverage the KLVY compiler to transform the non-...
Quantum capacity amplification via privacy
Peixue Wu, Yunkai Wang·Oct 6, 2025
We investigate superadditivity of quantum capacity through private channels whose Choi-Jamiolkowski operators are private states. This perspective links the security structure of private states to quantum capacity and clarifies the role of the shield...
Subsystem many-hypercube codes: High-rate concatenated codes with low-weight syndrome measurements
Ryota Nakai, Hayato Goto·Oct 6, 2025
Quantum error-correcting codes (QECCs) require high encoding rate in addition to high threshold unless a sufficiently large number of physical qubits are available. The many-hypercube (MHC) codes defined as the concatenation of the [[6,4,2]] quantum ...
Fast surgery for quantum LDPC codes
Nouédyn Baspin, Lucas Berent, Lawrence Z. Cohen·Oct 6, 2025
Quantum LDPC codes promise significant reductions in physical qubit overhead compared with topological codes. However, many existing constructions for performing logical operations come with distance-dependent temporal overheads. We introduce a schem...
Continuum Model of Isospectrally Patterned Lattices
Fotis K. Diakonos, P. Schmelcher·Oct 6, 2025
Isospectrally patterned lattices (IPL) have recently been shown to exhibit a rich band structure comprising both regimes of localized as well as extended states. The localized states show a single center localization behaviour with a characteristic l...
Quantum generative model on bicycle-sharing system and an application
Fumio Nemoto, Nobuyuki Koike, Daichi Sato +2 more·Oct 6, 2025
Recently, bicycle-sharing systems have been implemented in numerous cities, becoming integral to daily life. However, a prevalent issue arises when intensive commuting demand leads to bicycle shortages in specific areas and at particular times. To ad...
Comparative Analysis on Two Quantum Algorithms for Solving the Heat Equation
Samantha Tseng, Abhyudaya Chouhan, Dominic Cupidon·Oct 6, 2025
As of now, an optimal quantum algorithm solving partial differential equations eludes us. There are several different methods, each with their own strengths and weaknesses. In past years comparisons of these existing methods have been made, but new w...
Black-Box Separation Between Pseudorandom Unitaries, Pseudorandom Isometries, and Pseudorandom Function-Like States
Aditya Gulati, Yao-Ting Lin, Tomoyuki Morimae +1 more·Oct 6, 2025
Pseudorandom functions (PRFs) are one of the most fundamental primitives in classical cryptography. On the other hand, in quantum cryptography, it is possible that PRFs do not exist but their quantum analogues could exist, and still enabling many app...
Robust iSWAP gates for semiconductor spin qubits with local driving
Qi-Pei Liu, Zheng-Yuan Xue·Oct 6, 2025
Scalable quantum computation demands high-fidelity two-qubit gates. However, decoherence and control errors are inevitable, which can decrease the quality of implemented quantum operations. We propose a robust iSWAP gate protocol for semiconductor sp...
Lovász Meets Lieb-Schultz-Mattis: Complexity in Approximate Quantum Error Correction
Jinmin Yi, Ruizhi Liu, Zhi Li·Oct 6, 2025
Approximate quantum error correction (AQEC) provides a versatile framework for both quantum information processing and probing many-body entanglement. We reveal a fundamental tension between the error-correcting power of an AQEC and the hardness of c...
The average determinant of the reduced density matrices for each qubit as a global entanglement measure
Dafa Li·Oct 6, 2025
In this paper, we propose the average determinant of reduced density matrices for each qubit as a global entanglement measure. By means of the properties of reduced density matrices, we can investigate the present measure. We propose a decomposition ...
Quantum Cryptography and Hardness of Non-Collapsing Measurements
Tomoyuki Morimae, Yuki Shirakawa, Takashi Yamakawa·Oct 6, 2025
One-way puzzles (OWPuzzs) introduced by Khurana and Tomer [STOC 2024] are a natural quantum analogue of one-way functions (OWFs), and one of the most fundamental primitives in ''Microcrypt'' where OWFs do not exist but quantum cryptography is possibl...
FewBodyToolkit.jl: a Julia package for solving quantum few-body problems
Lucas Happ·Oct 6, 2025
Few-body physics explores quantum systems of a small number of particles, bridging the gap between single-particle and many-body regimes. To provide an accessible tool for such studies, we present FewBodyToolkit.jl, a Julia package for quantum few-bo...