Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.06219

Highly robust logical qubit encoding in an ensemble of V-symmetrical qutrits

Luis Octavio Castaños-Cervantes·Manuel Calixto·Julio Guerrero
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose using even and odd Sch\"odinger cat states formed from coherent states of U(3) of an ensemble of qutrits with a symmetrical V-configuration (a qubit-disguised qutrit) to encode a logical qubit. These carefully engineered logical qubit states are parameter independent stationary states of the effective master equation governing the evolution of the ensemble and, consequently, constitute dark states and are invulnerable to dissipation and correlated collective dephasing. In particular, the logical qubit states are immune to single qutrit decay (the analogous of single photon loss process for qutrits) and simultaneous decay and driving of two qutrits (the analogous two-photon loss and driving processes for qutrits). In addition, we show how to implement the single-qubit quantum NOT gate and the Hadamard gate followed by either the phase gate or the phase and $Z$ gates. We study analytically the case of two qutrits and conclude that the logical qubit states exhibit parity-sensitive inhomogeneous broadening and local correlated dephasing: the even logical state is completely immune to these processes, while odd one is vulnerable. Nevertheless, in the presence of these interactions one can also define another odd state with mixed permutation symmetry that is immune to both inhomogeneous broadening and local correlated dephasing. We suggest that these results can be extrapolated to an arbitrary number of qutrits. The effective master equation is deduced from a physical system composed of two parametrically coupled cavities with one of them interacting dispersively with an ensemble of three-level atoms (the qutrits). In principle this physical system can be implemented by means of two coplanar waveguide resonators, a SQUID parametrically coupling them, and a cloud of alkali atoms close to one of the resonators.

Explore related subjects

quant-phmath-phmath.MP

Keep this discovery

BibTeXRIS

Luis Octavio Castaños-Cervantes, Manuel Calixto, Julio Guerrero. 2025-12-05. Highly robust logical qubit encoding in an ensemble of V-symmetrical qutrits. https://arxiv.org/abs/2512.06219

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗