Universal magic state concentration

• URL: http://arxiv.org/abs/2608.13376v1
• Date: Thu, 13 Aug 2026 15:37:46 GMT
• Title: Universal magic state concentration
• Abstract summary: We introduce universal magic state concentration: a fixed stabilizer protocol that converts a few copies of an unknown pure non-stabilizer qubit state into an exact target magic state.<n>We show that $mathrmlin_3$ governs the optimal state dependence of any protocol up to nine input copies, and we showcase an eight-copy protocol with improved success probability.<n>As a corollary, any unknown pure qubit magic state suffices for universal quantum computation via exact $mathrmCCZ$ injection.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Magic plays a dual role in quantum computation: it promotes stabilizer dynamics from efficient classical simulability to universality, but it presents a central challenge for fault tolerance, since non-stabilizer operations are harder to protect against noise. Magic state distillation addresses this issue; however, existing protocols typically assume prior structure in the input, such as proximity to the target or a specified noise model. Here we introduce universal magic state concentration: a fixed stabilizer protocol that converts a few copies of an unknown pure non-stabilizer qubit state into an exact target magic state. Motivated by the obstruction to exact $T$-state concentration, we show that $\mathrm{CCZ}$ states behave fundamentally differently. Six input copies are necessary and sufficient to distill one exact $\mathrm{CCZ}$ state, with an optimal success probability determined by the linearized order-three stabilizer Rényi entropy $M^{\mathrm{lin}}_3$. Beyond this, we show that $M^{\mathrm{lin}}_3$ governs the optimal state dependence of any protocol up to nine input copies, and we showcase an eight-copy protocol with improved success probability. Furthermore, block repetition of our protocols yields asymptotic distillation rates that achieve optimal scaling up to logarithmic factors. As a corollary, any unknown pure qubit magic state suffices for universal quantum computation via exact $\mathrm{CCZ}$ injection. Together, these results identify the stabilizer Rényi entropy as a fundamental operational quantity in magic state distillation.

Related papers

• Non-local Magic: closed-form solution and equivalence with magic of purification [0.9481925300137773]
  Non-local magic quantifies the non-stabilizerness of a bipartite quantum state that cannot be removed by local unitary transformations.<n>We introduce the magic of purification, defined as the minimum pure-state magic over all purifications of a mixed state.<n>We prove that non-local magic coincides with the minimum magic of purification along the unitary orbit of the reduced density operator.
  arXiv  Detail & Related papers  (2026-09-03T17:21:11Z)
• The Optimal Rate Function in Covariant Quantum State Tomography [40.87574349486165]
  We characterize quantum tomography protocols by their emphrate function<n>This function governs the exponential rate at which a protocol assigns probability to a particular estimate $$ of the true state $$.<n>For any $$ and $$ we construct a family of protocols whose rate functions converge to the quantum relative entropy $D(|)$.
  arXiv  Detail & Related papers  (2026-06-15T16:47:46Z)
• Extremizing Measures of Magic on Pure States by Clifford-stabilizer States [0.0]
  We formalize the notions of $G$-stabilizer spaces, states, and codes for arbitrary finite subgroups.<n>Our main theorem shows that any $G$-invariant pure state is an extremal point of a broad class of derived functionals.<n>We classify such states for qubits, qutrits, ququints, and two-qubit systems.
  arXiv  Detail & Related papers  (2025-12-22T18:33:03Z)
• Pre-Distillation of Magic States via Composite Schemes [1.2949520455740091]
  We propose a general framework for pre-distillation, based on composite pulse sequences that suppress systematic errors in the generation of magic states.<n>Across all platforms, our approach yields high-fidelity $mathcalT$ gates with reduced noise, lowering the number of distillation levels by up to three.
  arXiv  Detail & Related papers  (2025-10-01T12:06:14Z)
• Magic Steady State Production: Non-Hermitian and Stochastic pathways [42.87502453001109]
  We introduce a protocol that prepares magic steady states by leveraging non-Hermitian dynamics.<n>We find the optimal parameters to prepare $|Hrangle$ and $|Trangle$ states.
  arXiv  Detail & Related papers  (2025-07-11T15:18:48Z)
• Efficient benchmarking of logical magic state [8.565601028339385]
  We show that benchmarking schemes measuring one copy of the magic state per round requires $Omega (1/epsilon2)$ samples for single-qubit magic states.<n>We propose two approaches to overcome this limitation: (i) Bell measurements on two copies of the twirled state and (ii) single-copy schemes leveraging twirled multi-qubit magic states.
  arXiv  Detail & Related papers  (2025-05-14T18:00:04Z)
• Non-stabilizerness of Neural Quantum States [41.94295877935867]
  We introduce a methodology to estimate non-stabilizerness or "magic", a key resource for quantum complexity, with Neural Quantum States (NQS)<n>We study the magic content in an ensemble of random NQS, demonstrating that neural network parametrizations of the wave function capture finite non-stabilizerness besides large entanglement.
  arXiv  Detail & Related papers  (2025-02-13T19:14:15Z)
• Magic State Injection on IBM Quantum Processors Above the Distillation Threshold [1.7359033750147501]
  This work employs a qubit-efficient rotated heavy-hexagonal surface code for IBM quantum processors.<n>We report error thresholds for both logical bit- and phase-flip errors, of $approx0.37%$ and $approx0.31%$, respectively.<n>Our work demonstrates the potential for realising non-Clifford logical gates by producing high-fidelity logical magic states on IBM quantum devices.
  arXiv  Detail & Related papers  (2024-12-02T12:35:52Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• The role of shared randomness in quantum state certification with unentangled measurements [36.19846254657676]
  We study quantum state certification using unentangled quantum measurements. $Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification. We develop a unified lower bound framework for both fixed and randomized measurements.
  arXiv  Detail & Related papers  (2024-01-17T23:44:52Z)
• Improved Graph Formalism for Quantum Circuit Simulation [77.34726150561087]
  We show how to efficiently simplify stabilizer states to canonical form. We characterize all linearly dependent triplets, revealing symmetries in the inner products. Using our novel controlled-Pauli $Z$ algorithm, we improve runtime for inner product computation from $O(n3)$ to $O(nd2)$ where $d$ is the maximum degree of the graph.
  arXiv  Detail & Related papers  (2021-09-20T05:56:25Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.