Stabilizer Tensor Networks with Magic State Injection

• URL: http://arxiv.org/abs/2411.12482v2
• Date: Tue, 15 Apr 2025 03:48:04 GMT
• Title: Stabilizer Tensor Networks with Magic State Injection
• Authors: Azar C. Nakhl, Ben Harper, Maxwell West, Neil Dowling, Martin Sevior, Thomas Quella, Muhammad Usman,
• Abstract summary: We report a new framework with significantly enhanced ability to simulate circuits with an extensive number of non-Clifford operations.<n>Specifically, for random $T$-doped $N$-qubit Clifford circuits the computational cost of circuits prepared with magic state injection scales as $mathcalO(textpoly(N))$ when the circuit has $t lesssim N$ $T$-gates.
• Score: 0.4934360430803066
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work augments the recently introduced Stabilizer Tensor Network (STN) protocol with magic state injection, reporting a new framework with significantly enhanced ability to simulate circuits with an extensive number of non-Clifford operations. Specifically, for random $T$-doped $N$-qubit Clifford circuits the computational cost of circuits prepared with magic state injection scales as $\mathcal{O}(\text{poly}(N))$ when the circuit has $t \lesssim N$ $T$-gates compared to an exponential scaling for the STN approach, which is demonstrated in systems of up to $200$ qubits. In the case of the Hidden Bit Shift circuit, a paradigmatic benchmarking system for extended stabilizer methods with a tunable amount of magic, we report that our magic state injected STN framework can efficiently simulate $4000$ qubits and $320$ $T$-gates. These findings provide a promising outlook for the use of this protocol in the classical modelling of quantum circuits that are conventionally difficult to simulate efficiently.

Related papers

• Exponentially Accelerated Sampling of Pauli Strings for Nonstabilizerness [9.107796201474187]
  Quantum magic, quantified by nonstabilizerness, measures departures from stabilizer structure and underlies potential quantum speedups.<n>We introduce an efficient classical algorithm that exactly computes stabilizer Rényi entropies and stabilizer nullity for generic many-body wavefunctions of $N$ qubits.
  arXiv  Detail & Related papers  (2026-01-02T17:37:04Z)
• Efficient Parallel Training Methods for Spiking Neural Networks with Constant Time Complexity [63.56009745101597]
  Spiking Neural Networks (SNNs) often suffer from high time complexity $O(T)$ due to the sequential processing of $T$ spikes.<n>We propose a novel Fixed-point Parallel Training (FPT) method to accelerate SNN training without modifying the network architecture.
  arXiv  Detail & Related papers  (2025-06-10T13:27:27Z)
• Efficient mutual magic and magic capacity with matrix product states [0.0]
  We introduce the mutual von-Neumann SRE and magic capacity, which can be efficiently computed in time. We find that mutual SRE characterizes the critical point of ground states of the transverse-field Ising model. The magic capacity characterizes transitions in the ground state of the Heisenberg and Ising model, randomness of Clifford+T circuits, and distinguishes typical and atypical states.
  arXiv  Detail & Related papers  (2025-04-09T19:12:26Z)
• Stabilizer Entanglement Enhances Magic Injection [8.474797307449121]
  We show that entanglement acts as a conduit that teleports magic across the system, thereby enhancing magic injection.<n>We extend our analysis to tripartite stabilizer entanglement, non-stabilizer entanglement, and magic injection via shallow-depth brickwork circuits.
  arXiv  Detail & Related papers  (2025-03-26T18:00:04Z)
• Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states [0.552480439325792]
  We investigate the classical simulatability of $N$-qubit Clifford circuits doped with $t$ number of $T$-gates. We use a simple disentangling algorithm to reduce the entanglement of the MPS component in CAMPS using control-Pauli gates. This work establishes a versatile framework based on CAMPS for understanding classical simulatability of $t$-doped circuits.
  arXiv  Detail & Related papers  (2024-12-23T01:26:40Z)
• Scalable approach to monitored quantum dynamics and entanglement phase transitions [0.0]
  Measurement-induced entanglement phase transitions in monitored quantum circuits have stimulated activity in a diverse research community. We present a solution by introducing a scalable protocol in $U(1)$ symmetric circuits.
  arXiv  Detail & Related papers  (2024-06-27T09:59:58Z)
• Stochastic Spiking Attention: Accelerating Attention with Stochastic Computing in Spiking Networks [33.51445486269896]
  Spiking Neural Networks (SNNs) have been recently integrated into Transformer architectures due to their potential to reduce computational demands and to improve power efficiency. We propose a novel framework leveraging computing (SC) to effectively execute the dot-product attention for SNN-based Transformers.
  arXiv  Detail & Related papers  (2024-02-14T11:47:19Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport [92.96250725599958]
  Kernel-based optimal transport (OT) estimators offer an alternative, functional estimation procedure to address OT problems from samples. We show that our SSN method achieves a global convergence rate of $O (1/sqrtk)$, and a local quadratic convergence rate under standard regularity conditions.
  arXiv  Detail & Related papers  (2023-10-21T18:48:45Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• Classical simulation of quantum circuits with partial and graphical stabiliser decompositions [0.0]
  We show how, by considering certain non-stabiliser entangled states which have more favourable decompositions, we can speed up simulations. We additionally find a new technique of partial stabiliser decompositions that allow us to trade magic states for stabiliser terms. With our techniques we manage to reliably simulate 50-qubit 1400 T-count hidden shift circuits in a couple of minutes on a consumer laptop.
  arXiv  Detail & Related papers  (2022-02-18T14:04:30Z)
• Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions [0.0]
  We introduce an enhanced technique for strong classical simulation of quantum circuits. This technique combines the sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus.
  arXiv  Detail & Related papers  (2021-09-02T16:42:52Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions [0.9634136878988853]
  Power-law interactions with strength decaying as $1/ralpha$ in the distance provide an experimentally realizable resource for information processing. We leverage the power of these interactions to implement a fast quantum fanout gate with an arbitrary number of targets. We show that power-law systems with $alpha le D$ are difficult to simulate classically even for short times, under a standard assumption that factoring is classically intractable.
  arXiv  Detail & Related papers  (2020-07-01T18: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.