Phase space tableau simulation for quantum computation

• URL: http://arxiv.org/abs/2506.04033v1
• Date: Wed, 04 Jun 2025 14:56:42 GMT
• Title: Phase space tableau simulation for quantum computation
• Authors: Selman Ipek, Atak Talay Yucel, Farzad Shahi, Cagdas Ozdemir, Cihan Okay,
• Abstract summary: We introduce a tableau-based classical simulation method for quantum computation, formulated within the phase space framework of the extended stabilizer theory of closed non-contextual operators.<n>We implement the simulator and benchmark its performance on basic quantum algorithms, including the hidden shift and Deutsch--Jozsa algorithms.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce a novel tableau-based classical simulation method for quantum computation, formulated within the phase space framework of the extended stabilizer theory of closed non-contextual operators. This method enables the efficient classical simulation of a broader class of quantum circuits beyond the stabilizer formalism. We implement the simulator and benchmark its performance on basic quantum algorithms, including the hidden shift and Deutsch--Jozsa algorithms.

Related papers

• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Towards robust variational quantum simulation of Lindblad dynamics via stochastic Magnus expansion [10.144001671935907]
  We introduce a novel and general framework for the variational quantum simulation of Lindblad equations.<n>We demonstrate the effectiveness of our algorithm through numerical examples in both classical and quantum implementations.
  arXiv  Detail & Related papers  (2025-03-28T02:37:56Z)
• A simple quantum simulation algorithm with near-optimal precision scaling [0.46040036610482665]
  Quantum simulation is a foundational application for quantum computers.<n>Existing simulation techniques are for the most part too intricate to implement on early fault-tolerant quantum hardware.<n>We propose a quantum Hamiltonian dynamics simulation algorithm that aims to be both straightforward to implement and at the same time have near-optimal scaling in simulation precision.
  arXiv  Detail & Related papers  (2024-12-14T04:04:35Z)
• Polynomial time and space quantum algorithm for the simulation of non-Markovian quantum dynamics [5.19702850808286]
  We developed an efficient quantum algorithm for the simulation of non-Markovian quantum dynamics, based on the Feynman path.<n>It demonstrates the quantum advantage by overcoming the exponential cost on classical computers.<n>The algorithm is efficient regardless of whether entanglement due to non-Markovianity is low or high, making it a unified framework for non-Markovian dynamics in open quantum system.
  arXiv  Detail & Related papers  (2024-11-27T09:25:17Z)
• Classical simulation of universal measurement-based quantum computation using multipartite Bell scenarios [0.0]
  We introduce a new classical simulation algorithm based on non-signaling polytopes of multipartite Bell scenarios. In our model, the simultaneous presence of non-stabilizerness and entanglement is necessary for quantum speedup.
  arXiv  Detail & Related papers  (2024-10-31T08:40:51Z)
• Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation [0.0]
  Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves exponential speedups (polynomial runtime) over existing simulators. The findings may have implications for quantum algorithm design, error correction, and the development of more efficient quantum simulators.
  arXiv  Detail & Related papers  (2024-07-28T20:02:21Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
  We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
  arXiv  Detail & Related papers  (2022-09-05T07:23:03Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

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.