Classical simulation of quantum circuits with partial and graphical stabiliser decompositions

• URL: http://arxiv.org/abs/2202.09202v1
• Date: Fri, 18 Feb 2022 14:04:30 GMT
• Title: Classical simulation of quantum circuits with partial and graphical stabiliser decompositions
• Authors: Aleks Kissinger, John van de Wetering, Renaud Vilmart
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent developments in classical simulation of quantum circuits make use of clever decompositions of chunks of magic states into sums of efficiently simulable stabiliser states. We show here how, by considering certain non-stabiliser entangled states which have more favourable decompositions, we can speed up these simulations. This is made possible by using the ZX-calculus, which allows us to easily find instances of these entangled states in the simplified diagram representing the quantum circuit to be simulated. We additionally find a new technique of partial stabiliser decompositions that allow us to trade magic states for stabiliser terms. With this technique we require only $2^{\alpha t}$ stabiliser terms, where $\alpha\approx 0.396$, to simulate a circuit with T-count $t$. This matches the $\alpha$ found by Qassim et al., but whereas they only get this scaling in the asymptotic limit, ours applies for a circuit of any size. Our method builds upon a recently proposed scheme for simulation combining stabiliser decompositions and optimisation strategies implemented in the software QuiZX. 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.

Related papers

• 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)
• Simulation-free Schr\"odinger bridges via score and flow matching [89.4231207928885]
  We present simulation-free score and flow matching ([SF]$2$M) Our method generalizes both the score-matching loss used in the training of diffusion models and the recently proposed flow matching loss used in the training of continuous flows. Notably, [SF]$2$M is the first method to accurately model cell dynamics in high dimensions and can recover known gene regulatory networks simulated data.
  arXiv  Detail & Related papers  (2023-07-07T15:42:35Z)
• Speedy Contraction of ZX Diagrams with Triangles via Stabiliser Decompositions [0.30938904602244344]
  We use the ZX calculus to iteratively decompose magic states into stabiliser terms. We show that this technique greatly speeds up the simulation of quantum circuits involving multi-controlled gates. We also use our software to contract diagrams representing the gradient variance of parametrised quantum circuits.
  arXiv  Detail & Related papers  (2023-07-04T16:13:53Z)
• Stochastic Approach For Simulating Quantum Noise Using Tensor Networks [0.8258451067861933]
  We show that our simulation error is relatively low, even for large numbers of qubits. By using the slicing technique, we can simulate up to 100 qubitOA circuits with high depth using supercomputers.
  arXiv  Detail & Related papers  (2022-10-28T03:44:59Z)
• 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)
• Fast Stabiliser Simulation with Quadratic Form Expansions [0.8122270502556371]
  This is a representation of a quantum state which specifies a formula for the expansion in the standard basis. We show how, with deft management of the quadratic form expansion representation, we may simulate individual stabiliser operations in $O(n2)$ time.
  arXiv  Detail & Related papers  (2021-09-17T16:17:21Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• 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)
• Long-time simulations with high fidelity on quantum hardware [1.8909337252764988]
  We show that it is possible to implement long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on the Rigetti and IBM quantum computers. This is a factor of 150 longer than is possible using the iterated Trotter method.
  arXiv  Detail & Related papers  (2021-02-08T16:18:50Z)
• 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)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.