Quantum TechnologyarXiv2026-06-30Skeptical (25)
Simulation of Two-qubit Gate Variability and Fidelity of Spin Qubits Built on Nanosheet Technology
Trung Nguyen, Sarah Dweik, Hiu Yung Wong
Silicon spin qubits are promising for large-scale quantum-computer integration because they can fully leverage the well-developed semiconductor infrastructure. However, the low fidelity of two-qubit entanglement gates remains a key barrier to large-scale integrations. Recent simulations of silicon spin-qubit two-qubit gates have been performed on silicon-on-insulator (SOI) platforms, while nanosheet-based charge-qubit work has been limited to single-qubit operation using a two-dimensional Schrödinger approximation. In this work, we study silicon spin-qubit double quantum dots built on nanosheet technology using the Quantum Technology Computer-Aided Design (QTCAD) simulation suite to run three-dimensional Poisson and Schroedinger solvers, followed by a many-body solver to extract exchange interactions. We evaluate the exchange energy sensitivity to process and bias variations and then use QuTiP to solve the master equation for a two-qubit gate. The results show that millivolt-level bias variations at the plunger and middle barrier gates can reduce the gate fidelity below 99%, a common threshold target for many fault-tolerant quantum-computing algorithms. Gate-referred 1/f charge-noise effects are also analyzed through the resulting coherence time.
Quantum TechnologyarXiv2026-06-30Skeptical (25)
Efficient entanglement of three remote single-atom quantum-network nodes
Matthias Seubert, Leonardo Ruscio, Tobias Frank et al.
Entanglement distributed over a set of individually addressable qubit nodes is the enabling resource for a plethora of applications ranging from tests of quantum physics to secure and modular quantum information networks. Entanglement between two memory qubits has been realized on various platforms, but extension to more nodes remains rare and formidably challenging. The principal bottleneck is the efficiency of the light-matter interfaces connecting the qubit nodes to their communication channels. Here, we efficiently generate, distribute and store a three-qubit entangled state across three independent laboratories containing single atoms coupled to optical resonators. We sequentially entangle the atoms pairwise, two by heralded photonic entanglement swapping and two by heralded state transfer. We reach a three-qubit entanglement fidelity of 77(1)% and an entanglement lifetime above 200us. The observed qubit correlations violate Mermin's inequality while closing the detection loophole. Our three-qubit entanglement-generation efficiency is 0.16%. This unprecedented efficiency of our scheme establishes a clear route towards multi-node quantum networks.
Quantum TechnologyarXiv2026-06-30Skeptical (25)
Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding
Kenta Kasai
In classical sparse-graph coding, spatial coupling is a mechanism by which belief-propagation (BP) decoding attains the maximum-a-posteriori (MAP) or area-threshold performance of the uncoupled system. Since MacKay-Neal/Hsu-Anastasopoulos (MN/HA) punctured sparse ensembles achieve capacity under MAP decoding, it is natural to ask whether spatially coupled MN/HA-type Calderbank-Shor-Steane (CSS) codes can reach the hashing bound on the quantum erasure channel under seeded BP decoding. We answer this question at the density evolution (DE) level for hard-erasure CSS decoding. On an erased coordinate, the two binary Pauli components remain unresolved, equivalently the erased qubit is represented by the four Pauli possibilities. We first define the CSS ensemble through sparse punctured matrices and the corresponding dense parity-check matrices. For fixed finite Z-side, X-side, and check degrees, we then derive a five-message uncoupled DE recursion, decompose it into Z-side and X-side constituent systems, and define the two constituent potentials. Applying the coupled-vector potential method to the two constituents separately proves that seeded BP decoding on the resulting finite-degree factor graphs reaches the smaller of the Z-side degree ratio and the X-side complementary degree ratio. In the X/Z equal-rate specialization, where the Z-side and X-side constituent design rates are equal, this BP threshold is the hashing-bound channel parameter determined by the design rate. Thus the paper gives a DE-level proof that seeded BP decoding with finite-degree factor graphs achieves the hashing bound for the X/Z equal-rate family. Finite-length BP concentration, block-error convergence, and a finite-code realization of the ideal DE seed are separate questions.
Quantum TechnologyarXiv2026-06-30Skeptical (25)
Quantum Information as a New Lens for Precision Neutrino Physics
Khushboo Dixit, Ritam Kundu, Papia Panda et al.
We present a quantum-information-theoretic study of three-flavor neutrino oscillations in long-baseline experiments by mapping flavor states to qubit-like representations and quantifying quantum correlations through total concurrence. The local minima of this entanglement measure identify energy regions where the flavor state is closest to separability, enabling cleaner extraction of oscillation parameters. We explain how these local minima offer opportunities for precision measurements and provide insight into the accurate determination of neutrino oscillation parameters. We then propose a strategy to improve parameter extraction by aligning the benchmark oscillation regions of NO$ν$A and T2K with the minimum entanglement achievable in each experiment. This shifts the concurrence minima toward higher-event-count energy regions, leading to tighter constraints and reducing the tension arising from their different energy regimes. For normal ordering, we obtain $(0.581^{+0.0136}_{-0.0150},,195^{+38}_{-32},^\circ)$ in the $(\sin^2θ_{23},δ_{\rm CP})$ plane and $(0.580^{+0.0140}_{-0.0153},,2.515^{+0.0344}_{-0.0344}\times10^{-3},\mathrm{eV}^2)$ in the $(\sin^2θ_{23},Δm^2_{31})$ plane, yielding improved joint constraints. Using GLoBES simulations together with real data, we assess how local minima of quantum correlations influence leptonic CP-violation sensitivity, $θ_{23}$ octant-degeneracy resolution, and mass-ordering determination. Our results show that minimizing entanglement can significantly affect these key sensitivities, highlighting quantum information measures as complementary probes of neutrino flavor oscillations and offering new insight into the role of quantum correlations in precision neutrino physics.
Quantum TechnologyarXiv2026-06-30Skeptical (25)
The contact temperature of arbitrary quantum states
Alain Joye, Marco Merkli
An intuitive scheme to assign a temperature to an arbitrary state of a quantum system is to investigate the heat flow resulting from the coupling to a thermometer. We introduce a simple model of a universal thermometer with the following property. When it is prepared in a Gibbs equilibrium state at inverse temperature $β\in\mathbb R$ and brought into thermal contact with a system in any state, the heat flow between the system and thermometer vanishes for a unique value of $β$. We call this value the contact temperature $β_{\rm op}\in\mathbb R$ of the system state. The thermometer is universal in that it yields a unique contact temperature for arbitrary states of finite dimensional quantum systems.
Quantum TechnologyarXiv2026-06-30Skeptical (25)
An efficient Pauli decomposition algorithm for structured matrices
Daniel J. Spencer, Kishor Bharti, Alexey V. Gorshkov
Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only $k = \mathsf{poly}(n)$ Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in $n$. We present a randomized classical algorithm that does take advantage of this sparsity and recovers the exact Pauli decomposition with success probability at least $1 - δ$, for any $δ$. Under the stated access model, the algorithm executes with query and runtime complexity that is polynomial in $n$, $k$, and $\log(1/δ)$. These results show that, even though finding the Pauli decomposition is exponentially hard for general matrices, it becomes efficiently solvable for matrices that are known to be sparse in the Pauli basis, a regime that is relevant to near-term quantum algorithms operating on structured classical input.