Scalable simulation of random quantum circuits using projected entangled-pair states

• URL: http://arxiv.org/abs/2504.04769v1
• Date: Mon, 07 Apr 2025 06:47:48 GMT
• Title: Scalable simulation of random quantum circuits using projected entangled-pair states
• Authors: Sung-Bin B. Lee, Hee Ryang Choi, Daniel Donghyon Ohm, Seung-Sup B. Lee,
• Abstract summary: We use the simple update of projected entangled-pair states (PEPSs) in the Vidal gauge to simulate the states of random quantum circuits (RQCs)<n>We find the universal scaling behaviors of the state fidelity by performing large-scale simulations for $n leq 104$ or $chi leq 128$ on a conventional CPU.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Classical simulation of a programmable quantum processor is crucial in identifying the threshold of a quantum advantage. We use the simple update of projected entangled-pair states (PEPSs) in the Vidal gauge to simulate the states of random quantum circuits (RQCs), which center around recent quantum advantage claims. Applied to square lattices of qubits akin to state-of-the-art superconducting processors, our PEPS simulation is exact for circuit depths less than $D_\mathrm{tr}$ = $\beta\log_2\chi$, where $\chi$ is the maximum bond dimension and $2 \lesssim \beta \lesssim 4$ depends on the choice of two-qubit gates, independent of the qubit number $n$. We find the universal scaling behaviors of the state fidelity by performing large-scale simulations for $n \leq 10^{4}$ or $\chi \leq 128$ on a conventional CPU. Our method has computational cost scaling polynomially with $n$ for circuit depth $D =O(\log n)$ and is more advantageous than matrix product state (MPS) approaches if $n$ is large. This work underscores PEPSs as a scalable tool for benchmarking quantum algorithms, with future potential for sampling applications using advanced contraction techniques.

Related papers

• Optimized Quantum Simulation Algorithms for Scalar Quantum Field Theories [0.3394351835510634]
  We provide practical simulation methods for scalar field theories on a quantum computer that yield improveds. We implement our approach using a series of different fault-tolerant simulation algorithms for Hamiltonians. We find in both cases that the bounds suggest physically meaningful simulations can be performed using on the order of $4times 106$ physical qubits and $1012$ $T$-gates.
  arXiv  Detail & Related papers  (2024-07-18T18:00:01Z)
• 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)
• Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs [1.0765359420035392]
  We show that the Quantum Approximate Optimization Algorithm (QAOA) for higher-order, random-coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes. We show that the best quantum processors generally find lower energy solutions up to $p=3$ for 27 qubit systems and up to $p=2$ for 127 qubit systems.
  arXiv  Detail & Related papers  (2023-12-02T01:47:05Z)
• 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)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• 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)
• Fast quantum circuit cutting with randomized measurements [0.0]
  We propose a new method to extend the size of a quantum computation beyond the number of physical qubits available on a single device. This is accomplished by randomly inserting measure-and-prepare channels to express the output state of a large circuit as a separable state across distinct devices.
  arXiv  Detail & Related papers  (2022-07-29T15:13:04Z)
• 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)
• 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)
• 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.