Parity-unfolded distillation architecture for noise-biased platforms

• URL: http://arxiv.org/abs/2604.15436v1
• Date: Thu, 16 Apr 2026 18:00:32 GMT
• Title: Parity-unfolded distillation architecture for noise-biased platforms
• Abstract summary: parity-unfolded architecture is a fault-tolerant quantum computing scheme.<n>A state $|Z_krangle = Z1/2k|+rangle$ can be prepared fault-tolerantly using $2k+3 + O(2k/2)$ biased-noise qubits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce the parity-unfolded architecture, a fault-tolerant quantum computing scheme that relies on direct preparation and teleportation of small-angle rotations $ Z^{1/2^{k}}$ rather than approximating them with the conventional (Clifford + $T$) gate set. The architecture is enabled by efficient distillation of gates from an arbitrary level of the Clifford hierarchy, which we refer to as parity unfolding. With it, a state $|Z_k\rangle = Z^{1/2^{k}}|{+}\rangle$ can be prepared fault-tolerantly using $2^{k+3} + O(2^{k/2})$ biased-noise qubits on a planar chip with nearest-neighbour connectivity. For algorithms requiring native $Z^{1/2^{k}}$ gates, such as the Quantum Fourier Transform and phase estimation, the proposed scheme allows to reduce resource overheads for up to $k=7$, i.e., up to $T^{1/32}$. Furthermore, when used for the synthesis of arbitrary small-angle rotations, parity-unfolded distillation of ($T$ + $\sqrt{T}$) reduces the minimum achievable logical error rate by 43% while cutting the resource requirements by 26%, when compared to unfolded distillation of only the $T$ gate.

Related papers

• Scalable Quantum Machine Learning: Trainability, Expressivity and Efficiency [0.5076419064097732]
  We propose a unitary brick-wall: a $k$-particle fermionic architecture for nearest-neighbor hardware.<n>The brick-wall has dynamical Lie algebra $mathfraku(n)$ and directly parametrizes $U(n)$ via Givens rotations.<n>It achieves similar hardness guarantees at $8klog n$ evaluations per gradient step, the same factor $3n/(8k)$ reduction.
  arXiv  Detail & Related papers  (2026-07-27T05:23:32Z)
• Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent [39.805192541498634]
  We study nonstationary linear computation (GLBs), where the expected reward is modeled through a nonlinear link function with an unknown time-varying parameter.<n>We propose a new algorithm for nonstationary GLBs that utilize discounted online mirror descent (DOMD) for parameter estimation, thereby incurring only $O(1)$ for memory costs per round.
  arXiv  Detail & Related papers  (2026-05-25T08:40:32Z)
• Adiabatic Quantum Phase Estimation [47.3103723337301]
  Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $$ in Heisenberg-limited time $T= (1/)$.<n>Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware.<n>We present a simple adiabatic protocol for QPE that achieves the optimal Heisenberg-limited scaling $T = Oleft( frac1 logleft(-1right)right)$ in both the precision $$
  arXiv  Detail & Related papers  (2026-05-21T17:31:36Z)
• Zero-level $CCZ$ Distillation [2.6945797019995363]
  Magic state distillation is a key component of fault-tolerant quantum computation.<n>We propose a zero-level distillation protocol that efficiently generates a high-fidelity logical $CCZ magic state.<n>The proposed method improves the logical error rate by approximately one and two orders of magnitude at $p = 10-3$ and $p = 10-4$, respectively.
  arXiv  Detail & Related papers  (2026-05-21T01:22:28Z)
• Optimal Scalar Quantization for Matrix Multiplication: Closed-Form Density and Phase Transition [50.36362492608702]
  We study entrywise scalar quantization of two matrices prior to multiplication.<n>We obtain a closed-form optimal point density [ star(u) propto exp!left(-fracu26right)bigl( (1-2)+2u22bigr), qquad u=fracx_X,, and prove a correlation-driven phase transition.
  arXiv  Detail & Related papers  (2026-03-20T01:53:44Z)
• Rate-optimal community detection near the KS threshold via node-robust algorithms [43.490963168751364]
  We study community detection in the emphsymmetric $k$stochastic block model, where $n$ nodes are evenly partitioned into $k$ with intra- and inter-cluster connections.<n>Our main result is a novel graph bisection algorithm via robust majority voting, which allows us to significantly improve the misclassification rate to $1/mathrmpoly(k) for initial estimation near the KS threshold.
  arXiv  Detail & Related papers  (2025-11-20T18:11:01Z)
• Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping [0.0]
  We devise a deterministic quantum algorithm to produce antisymmetric states of single-particle orbitals in the first quantization mapping.<n>We show example circuits for two- and three-particle systems and discuss the generalization to an arbitrary number of particles.
  arXiv  Detail & Related papers  (2025-09-08T23:27:25Z)
• Proving the Limited Scalability of Centralized Distributed Optimization via a New Lower Bound Construction [57.93371273485736]
  We consider a centralized distributed learning setup where all workers jointly find an unbiased bound LDeltaepsilon2,$ better poly-logarithmically in $n$, even in the homogeneous (i.i.d.) case, where all workers access the same distribution.
  arXiv  Detail & Related papers  (2025-06-30T13:27:39Z)
• Reducing T Gates with Unitary Synthesis [0.41873449350124814]
  This work presents a novel FT synthesis algorithm that directly synthesizes arbitrary single-qubit unitaries.<n>By leveraging tensor network-based search, our approach enables native $U3$ synthesis, reducing the $T$ count, Clifford gate count, and approximation error.
  arXiv  Detail & Related papers  (2025-03-20T04:53:54Z)
• MIRAGE: Quantum Circuit Decomposition and Routing Collaborative Design using Mirror Gates [1.1494662473750505]
  Transpilation is critical to ensure that quantum gates are on physically linked qubits. We propose $textitMIRAGE$, a collaborative design and transpilation approach to minimize $texttSWAP$ gates. We show how systems that implement the $texttiSWAP$ family of gates can benefit from mirror gates.
  arXiv  Detail & Related papers  (2023-08-07T18:52:08Z)
• Oblivious Stochastic Composite Optimization [47.48197617884748]
  We show that our algorithms converge without any prior knowledge on the parameters of the problem.<n>All three algorithms work without prior knowledge of the diameter of the feasible set, the Lipschitz constant or smoothness of the objective function.<n>We extend our framework to relative scale and demonstrate the efficiency and robustness of our methods on large-scale semidefinite programs.
  arXiv  Detail & Related papers  (2023-06-30T08:34:29Z)
• Estimating the minimizer and the minimum value of a regression function under passive design [72.85024381807466]
  We propose a new method for estimating the minimizer $boldsymbolx*$ and the minimum value $f*$ of a smooth and strongly convex regression function $f$. We derive non-asymptotic upper bounds for the quadratic risk and optimization error of $boldsymbolz_n$, and for the risk of estimating $f*$.
  arXiv  Detail & Related papers  (2022-11-29T18:38:40Z)
• Private Frequency Estimation via Projective Geometry [47.112770141205864]
  We propose a new algorithm ProjectiveGeometryResponse (PGR) for locally differentially private (LDP) frequency estimation. For a universe size of $k$ and with $n$ users, our $varepsilon$-LDP algorithm has communication cost $lceillogkrceil bits in the private coin setting and $varepsilonlog e + O(1)$ in the public coin setting. In many parameter settings used in practice this is a significant improvement over the O(n+k2)$optimal cost that is achieved by the recent PI-
  arXiv  Detail & Related papers  (2022-03-01T02:49:55Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Cost-optimal single-qubit gate synthesis in the Clifford hierarchy [0.0]
  A synthesis algorithm can be used to approximate any unitary gate up to arbitrary precision. Current procedures do not yet support individual assignment of base gate costs.
  arXiv  Detail & Related papers  (2020-05-12T07:21:12Z)
• Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms [1.9240845160743125]
  We demonstrate a continuous two-qubit gate set that can provide a 3x reduction in circuit depth as compared to a standard decomposition. We benchmark the fidelity of the iSWAP-like and CPHASE gate families as well as 525 other fSim gates spread evenly across the entire fSim parameter space.
  arXiv  Detail & Related papers  (2020-01-23T02:12:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.