530.12
Quantum Matter
Qubits, error correction and the quantum many-body problem.
Drawer contents
Filled from
AarXiv
Search threads
quantum error correction
quantum computing algorithm hardware
530.12
Qubits, error correction and the quantum many-body problem.
Drawer contents
Filled from
Search threads
quantum error correction
quantum computing algorithm hardware
Junchao Wang, Zeyuan Wang, Lei Li, Feng Wang + 2 more
Neutral atom quantum computing utilizes laser-trapped neutral atoms as qubits and realizes quantum logic gate operations through Rydberg-state interactions. In recent years, it has become one of the most vibrant directions in quantum computing hardware. This paper systematically reviews the working principles of…
Eric Kubischta, Ian Teixeira
We apply time-reversal symmetry to quantum codes and show that it imposes parity selection rules on the physical error algebra. A time-reversal-invariant logical qubit on an odd number of spins is a Kramers doublet, forcing every even-weight Pauli to act as a scalar. Consequently, all even-weight Knill--Laflamme…
Yuntai Song, Zejun Liu, Zhencheng Wang, Jong Yeon Lee + 1 more
Topologically ordered phases naturally realize quantum error correction through nonlocal encoding of quantum information. More recently, conformal field theories have been shown to realize approximate quantum error-correcting codes, but such constructions generally require fine tuning to criticality. Here we introduce…
Weiyuan Gong, Hong-Ye Hu
Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration. In practice, however, analog control parameters inevitably drift because of environmental…
Kelvin Onggadinata, Si Yan Koh, Arghya Maity, Kuan Eng Johnson Goh + 4 more
High-dimensional nuclear spins offer a hardware-efficient route to quantum error correction (QEC), with the spin cat code providing intrinsic robustness against phase errors -- the dominant noise channel in donor-in-silicon architectures. However, realizing the full potential of this encoding requires gate operations…
Daniel Sierra-Sosa, Begonya Garcia-Zapirain, Cristian Marquez, Kelly Garces
Quantum processors have crossed the one-hundred-qubit mark, but noise continues to limit circuit performance, while full quantum error correction remains too costly for routine use. Error suppression and mitigation therefore play an important role in extracting value from current hardware, yet independent comparisons…
Jianqi Sheng
Fast preparation of quantum error-correcting codes is essential for scalable quantum memories, but geometric locality and $U(1)$ charge conservation impose an unavoidable transport constraint. We combine exact complementary-channel geometry, charge-sector Haar analysis, and a gate-resolved connected-moment expansion to…
Ryutaroh Matsumoto
A classical linear code $C$ of length $n$ is said to have symbol locality $(r, δ)$ if for any index $j$ there exists a repair group $J_j \subseteq \{1, \ldots, n\}$ with $j\in J_j$ and $|J_j| \leq r+δ-1$ such that any $δ-1$ or fewer erasures in $J_j$ can be corrected by using codeword symbols only in $J_j$. Later it…
Hongbo Wu, Ling Hu, Jiasheng Mai, Munan Zhang + 9 more
Dynamic quantum circuits (DQCs) provide a hardware-efficient route to quantum computing by reducing physical-qubit overhead and compressing circuit topology through mid-circuit measurements, qubit reset and reuse, and classical feed-forward control. Here, we demonstrate the advantages of DQCs on a single hybrid…
Lakshika Rathi, Pau Escofet, Joshua Viszlai, Margaret Martonosi
Fault-tolerant Quantum Computing (FTQC) relies on Quantum Error Correction (QEC) codes that encode logical qubits across many physical qubits to detect and correct errors. The surface code is among the most widely studied codes due to its high error threshold, the existence of efficient decoders, and hardware-friendly…
Bonan Su, Yuan Feng, Li Zhou, Mingsheng Ying
Fault-tolerant quantum computation enables the deployment of practical quantum algorithms but incurs substantial overhead from error correction, making resource estimation a central concern. Beyond case-by-case analyses, existing quantum programming languages either require programmers to manipulate low-level hardware…
Stefanie Muroya, Krishnendu Chatterjee, Thomas A. Henzinger
While most research on quantum programming considers an idealized, noise-free semantics for quantum programs, we reason about quantum programs that are executed on real, noisy hardware. We consider the error models published by quantum hardware vendors to give a hardware-dependent semantics to quantum programs. This…
Kai Wang, Zhen-Yang Peng
All realistic quantum systems are inevitably in contact with the environment. Suppressing theimpact of environmental noise is a critical challenge in cutting-edge quantum technologies. In thiswork, we introduce and systematically analyze a scheme for the protection of quantum states againstamplitude-damping (AD) noise…
Yicheng Guang, Neel Vora, Yilun Xu, Yueqi Chen + 1 more
As quantum computing continues to demonstrate promise and attract growing attention, there is an increasing need for more precise experiments to advance the development of quantum devices, as well as higher circuit throughput to validate more domain applications. However, this need is hindered by a memory bottleneck at…
Shaikha S. Al-Qahtani, Siyao Li, Joseph J. Boutros
We establish conditions and give proofs on how an error-correcting code can attain infinite diversity in a time-entanglement quantum key distribution (TE-QKD) reconciliation. The shocking result, never encountered in the literature on coding and communication theory, is that a decoder exhibits an infinite diversity…
Wei Zi, Pei Yuan, Junhong Nie, Shengyu Zhang
Hamming weight computation maps an $n$-bit input to the number of ones it contains. It is a basic subroutine in quantum computing, and the core building block for symmetric Boolean functions, whose value depends only on the Hamming weight of the input. Moreover, symmetric Boolean functions are among the most common…
Nicole Holzmann
Quantum computing is a deep technology whose progress cannot be driven effectively from one direction alone. While the field has developed a growing catalogue of mathematically grounded algorithmic speedups, industrial impact will depend just as much on starting from real industrial decision contexts and working…
Boyang Chen, Minbo Gao, Xinzhao Wang, Shuo Zhou
We give a query-optimal algorithm for simulating a general $n$-qubit time-dependent Hamiltonian $H(t)$ on $[0,T]$, assuming that $H$ is Lipschitz continuous and $\|H(t)\|\leqα$. In the standard $\mathrm{HAM\mbox{-}T}$ access model, the algorithm approximates the time-ordered propagator $U_H(T)$ to error $\varepsilon$…