High-performance parallel classical scheme for simulating shallow quantum circuits

• URL: http://arxiv.org/abs/2103.00693v1
• Date: Mon, 1 Mar 2021 02:05:17 GMT
• Title: High-performance parallel classical scheme for simulating shallow quantum circuits
• Authors: Shihao Zhang, Jiacheng Bao, Yifan Sun, Lvzhou Li, Houjun Sun, and Xiangdong Zhang
• Abstract summary: We propose a high-performance two-stage classical scheme to solve a full-sampling variant of the 2D HLF problem. We show our scheme is a practically scalable, high-efficient and operationally convenient tool for simulating and verifying graph-state circuits performed by current quantum hardware.
• Score: 4.963372236375303
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recently, constant-depth quantum circuits are proved more powerful than their classical counterparts at solving certain problems, e.g., the two-dimensional (2D) hidden linear function (HLF) problem regarding a symmetric binary matrix. To further investigate the boundary between classical and quantum computing models, in this work we propose a high-performance two-stage classical scheme to solve a full-sampling variant of the 2D HLF problem, which combines traditional classical parallel algorithms and a gate-based classical circuit model together for exactly simulating the target shallow quantum circuits. Under reasonable parameter assumptions, a theoretical analysis reveals our classical simulator consumes less runtime than that of near-term quantum processors for most problem instances. Furthermore, we demonstrate the typical all-connected 2D grid instances by moderate FPGA circuits, and show our designed parallel scheme is a practically scalable, high-efficient and operationally convenient tool for simulating and verifying graph-state circuits performed by current quantum hardware.

Related papers

• Solution of the Electric Field Integral Equation Using a Hybrid Quantum-Classical Scheme: Investigation of Accuracy and Efficiency [2.5430418469482543]
  We use a hybrid quantum-classical scheme to solve the electromagentic scattering from 3D perfect electrically conducting objects with arbitrary shapes in electromagnetics.<n>The computational complexity of the hybrid VQLS-classical scheme is lower than the conventional fast solvers in classical computing.
  arXiv  Detail & Related papers  (2025-12-03T13:57:15Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Solving quantum-inspired dynamics on quantum and classical annealers [0.0]
  We propose a benchmarking suite inspired by physical dynamics to challenge both quantum and classical computers.<n>We convert the real-time propagator of an $n$-qubit, possibly non-Hermitian, Hamiltonian into a quadratic-unconstrained binary optimisation problem.<n>The resulting QUBO instances are executed on D-Wave quantum annealers as well as using two classical solvers, Simulated Annealing and VeloxQ.
  arXiv  Detail & Related papers  (2025-09-04T07:27:11Z)
• Disentangling unitary dynamics with classically simulable quantum circuits [0.0]
  We study both quantum circuit and Hamiltonian dynamics. We find that expectations of Pauli operators can be simulated efficiently even for deep Clifford circuits. For the Hamiltonian dynamics we find that the classical simulation generically quickly becomes inefficient.
  arXiv  Detail & Related papers  (2024-10-11T17:18:26Z)
• An Efficient Classical Algorithm for Simulating Short Time 2D Quantum Dynamics [2.891413712995642]
  We introduce an efficient classical algorithm for simulating short-time dynamics in 2D quantum systems. Our results reveal the inherent simplicity in the complexity of short-time 2D quantum dynamics. This work advances our understanding of the boundary between classical and quantum computation.
  arXiv  Detail & Related papers  (2024-09-06T09:59:12Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Integrating Quantum Algorithms Into Classical Frameworks: A Predictor-corrector Approach Using HHL [0.562479170374811]
  We adapt a well-known algorithm for linear systems of equations, originally proposed by Harrow, Hassidim and Lloyd (HHL), by adapting it into a predictor-corrector instead of a direct solver. This strategy enables the intelligent omission of computationally costly steps commonly found in many classical algorithms, while simultaneously mitigating the notorious readout problems associated with extracting a quantum state. The versatility of the approach is illustrated through applications in various fields such as smoothed particle hydrodynamics, plasma simulations, and reactive flow configurations.
  arXiv  Detail & Related papers  (2024-06-28T15:31:10Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation [0.0]
  We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms.
  arXiv  Detail & Related papers  (2021-05-09T05:10:59Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Computational power of one- and two-dimensional dual-unitary quantum circuits [0.6946929968559495]
  Quantum circuits that are classically simulatable tell us when quantum computation becomes less powerful than or equivalent to classical computation. We make use of dual-unitary quantum circuits (DUQCs), which have been recently investigated as exactly solvable models of non-equilibrium physics.
  arXiv  Detail & Related papers  (2021-03-16T17:37:11Z)
• Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices [0.0]
  We introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
  arXiv  Detail & Related papers  (2020-04-23T18:35:26Z)
• 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.