STAR-Magic Mutation: Even More Efficient Analog Rotation Gates for Early Fault-Tolerant Quantum Computer

• URL: http://arxiv.org/abs/2603.22891v1
• Date: Tue, 24 Mar 2026 07:39:39 GMT
• Title: STAR-Magic Mutation: Even More Efficient Analog Rotation Gates for Early Fault-Tolerant Quantum Computer
• Abstract summary: We introduce STAR-magic mutation, an efficient protocol for implementing logical rotation gates on fault-tolerant quantum computers.<n>We also propose a novel quantum computing architecture designed for early fault-tolerant quantum computers, dubbed STAR ver.3"
• Score: 2.370310454459195
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce STAR-magic mutation, an efficient protocol for implementing logical rotation gates on early fault-tolerant quantum computers. This protocol judiciously combines two of the latest state preparation protocols: transversal multi-rotation protocol and magic state cultivation. It achieves a logical rotation gate with a favorable error scaling of $\mathcal{O}(θ_L^{2(1-Θ(1/d))}p_{\text{ph}})$, while requiring only the ancillary space of a single surface code patch. Here, $θ_L$ is the logical rotation angle, $p_{\text{ph}}$ is the physical error rate, and $d$ is the code distance. This scaling marks a significant improvement over the previous state-of-the-art, $\mathcal{O}(θ_L p_{\text{ph}})$, making our protocol particularly powerful for implementing a sequence of small-angle rotation gates, like Trotter-based circuits. Notably, for $θ_L \lesssim 10^{-5}$, our protocol achieves a two-order-of-magnitude reduction in both the execution time and the error rate of analog rotation gates compared to the standard $T$-gate synthesis using cultivated magic states. Building upon this protocol, we also propose a novel quantum computing architecture designed for early fault-tolerant quantum computers, dubbed ``STAR ver.~3". It employs a refined circuit compilation strategy based on Clifford+$T$+$φ$ gate set, rather than the conventional Clifford+$T$ or Clifford+$φ$ gate sets. We establish a theoretical bound on the feasible circuit size on this architecture and illustrate its capabilities by analyzing the spacetime costs for simulating the dynamics of quantum many-body systems. Specifically, we demonstrate that our architecture can simulate biologically-relevant molecules or lattice models at scales beyond the reach of exact classical simulation, with only a few hundred thousand physical qubits, even assuming a realistic error rate of $p_{\text{ph}}=10^{-3}$.

Related papers

• Optimal Lower Bounds for Hamiltonian Simulation [42.227880669333835]
  For Hamiltonian $H = sum_j h_j$, we proveally tight lower bounds on the gate and query complexities of simulating time evolution on a quantum computer.<n>Our hold for arbitrary term norms $|h_j|$, time $t$, and trace-distance error $$.
  arXiv  Detail & Related papers  (2026-07-22T07:41:32Z)
• Quantum-classical crossover in fault-tolerant quantum dynamics simulation [56.198154828333685]
  We introduce a scalable fault-tolerant framework that combines coherent observable estimation with a space-time-efficient implementation of non-Clifford rotations.<n>A benchmark against state-of-the-art tensor-network and variational Monte Carlo algorithms reveals a concrete crossover for mixed-field Ising dynamics.
  arXiv  Detail & Related papers  (2026-07-17T16:54:25Z)
• Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation [7.286087490326675]
  We introduce a high-rate STAR architecture for local lattice Hamiltonian simulation based on a symmetry-driven co-design of the algorithm, QEC code, and neutral-atom hardware.<n>Disjoint logical representatives allow STAR injections to be performed in parallel on all $k$ logical qubits in a code block.<n>These results provide a concrete route toward early fault-tolerant quantum simulation with high-rate codes.
  arXiv  Detail & Related papers  (2026-06-23T17:55:45Z)
• 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)
• Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation [0.0]
  We estimate the cost of simulating the two-dimensional Fermi-Hubbard model on a biplanar spin-optical quantum computing architecture.<n>We benchmark lattice surgery and magic state preparation within each plane.<n>We find that fallback-based rotation synthesis methods become a scalability bottleneck.
  arXiv  Detail & Related papers  (2026-05-06T18:00:09Z)
• Error-structure-tailored early fault-tolerant quantum computing [2.824800547988445]
  In quantum algorithms, logical rotation gates $R_Z_L(varphi)$ serve as essential components.<n>In this work, we consider error-structure-tailored fault tolerance, where fault-tolerance conditions are analyzed.<n>We design 1-fault-tolerant continuous-angle rotation gates in stabilizer codes, implemented via dispersive-coupling Hamiltonians.
  arXiv  Detail & Related papers  (2025-11-25T06:51:46Z)
• Addressable fault-tolerant universal quantum gate operations for high-rate lift-connected surface codes [0.8919684307774216]
  Quantum low-density parity check (qLDPC) codes are among the leading candidates to realize error-corrected quantum memories with low qubit overhead.<n>In this work, we introduce a construction to implement all Clifford quantum gate operations on the recently introduced lift-connected surface (LCS) codes.
  arXiv  Detail & Related papers  (2025-11-13T11:01:44Z)
• Measurement-Based Fault-Tolerant Quantum Computation on High-Connectivity Devices: A Resource-Efficient Approach toward Early FTQC [2.511618458985613]
  We propose a measurement-based FTQC architecture for high-connectivity platforms such as trapped ions and neutral atoms.<n>Key idea is to use verified logical ancillas combined with Knill's error-correcting teleportation.<n>We present two implementations benchmarked under circuit-level depolarizing noise.
  arXiv  Detail & Related papers  (2025-10-21T14:02:20Z)
• Batched high-rate logical operations for quantum LDPC codes [2.722479714583866]
  High-rate quantum LDPC codes reduce memory overhead by densely packing many logical qubits into a single block of physical qubits.<n>We extend this concept to high-rate computation by constructing emphbatched fault-tolerant operations that apply the same logical gate across many code blocks in parallel.
  arXiv  Detail & Related papers  (2025-10-07T17:26:10Z)
• A distillation-teleportation protocol for fault-tolerant QRAM [95.99192129224721]
  We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation.<n>For coherently accessing classical memories of size $2n$, our protocol consumes only $mathrmpoly(n)$ fault-tolerant quantum resources.
  arXiv  Detail & Related papers  (2025-05-26T17:42:56Z)
• Parametrized multiqubit gate design for neutral-atom based quantum platforms [0.0]
  A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm.<n>Parametrized gates in particular have found use in both near-term algorithms and circuit compilation.
  arXiv  Detail & Related papers  (2024-11-29T15:47:19Z)
• Fault-tolerant fermionic quantum computing [39.58317527488534]
  We introduce fermionic fault-tolerant quantum computing, a framework which removes this overhead altogether.<n>We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Q-Newton: Hybrid Quantum-Classical Scheduling for Accelerating Neural Network Training with Newton's Gradient Descent [37.59299233291882]
  We propose Q-Newton, a hybrid quantum-classical scheduler for accelerating neural network training with Newton's GD.<n>Q-Newton utilizes a streamlined scheduling module that coordinates between quantum and classical linear solvers.<n>Our evaluation showcases the potential for Q-Newton to significantly reduce the total training time compared to commonly used quantum machines.
  arXiv  Detail & Related papers  (2024-04-30T23:55:03Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  We simulate the logical Hadamard gate in the surface code under a circuit-level noise model. Our paper is the first to do this for a unitary gate on a quantum error-correction code.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.