Minimizing the negativity of quantum circuits in overcomplete quasiprobability representations

• URL: http://arxiv.org/abs/2306.10758v2
• Date: Thu, 8 Feb 2024 12:33:46 GMT
• Title: Minimizing the negativity of quantum circuits in overcomplete quasiprobability representations
• Authors: Denis A. Kulikov, Vsevolod I. Yashin, Aleksey K. Fedorov, and Evgeniy O. Kiktenko
• Abstract summary: We develop an approach for minimizing the total negativity of a given quantum circuit with respect to quasiprobability representations, that are overcomplete. Our approach includes both optimization over equivalent quasistochastic vectors and matrices, which appear due to the overcompleteness. We also study the negativity minimization of noisy brick-wall random circuits via a combination of increasing frame dimension and applying gate merging technique.
• Score: 0.6428333375712125
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The problem of simulatability of quantum processes using classical resources plays a cornerstone role for quantum computing. Quantum circuits can be simulated classically, e.g., using Monte Carlo sampling techniques applied to quasiprobability representations of circuits' basic elements, i.e., states, gates, and measurements. The effectiveness of the simulation is determined by the amount of the negativity in the representation of these basic elements. Here we develop an approach for minimizing the total negativity of a given quantum circuit with respect to quasiprobability representations, that are overcomplete, i.e., are such that the dimensionality of corresponding quasistochastic vectors and matrices is larger than the squared dimension of quantum states. Our approach includes both optimization over equivalent quasistochastic vectors and matrices, which appear due to the overcompleteness, and optimization over overcomplete frames. We demonstrate the performance of the developed approach on some illustrative cases, and show its significant advantage compared to the standard overcomplete quasistochastic representations. We also study the negativity minimization of noisy brick-wall random circuits via a combination of increasing frame dimension and applying gate merging technique. We demonstrate that the former approach appears to be more efficient in the case of a strong decoherence.

Related papers

• Tensor networks based quantum optimization algorithm [0.0]
  In optimization, one of the well-known classical algorithms is power iterations. We propose a quantum realiziation to circumvent this pitfall. Our methodology becomes instance agnostic and thus allows one to address black-box optimization within the framework of quantum computing.
  arXiv  Detail & Related papers  (2024-04-23T13:49:11Z)
• Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy trade-offs [1.0749601922718608]
  Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms. We introduce a general approach to implement unitary and non-unitary diagonal operators with efficient-adjustable-depth quantum circuits.
  arXiv  Detail & Related papers  (2024-04-03T15:42:25Z)
• Forward and Backward Constrained Bisimulations for Quantum Circuits using Decision Diagrams [3.788308836856851]
  We develop efficient methods for the simulation of quantum circuits on classic computers. In particular, we show that constrained bisimulation can boost decision-diagram-based quantum circuit simulation by several orders of magnitude.
  arXiv  Detail & Related papers  (2023-08-18T12:40:47Z)
• Randomized semi-quantum matrix processing [0.0]
  We present a hybrid quantum-classical framework for simulating generic matrix functions. The method is based on randomization over the Chebyshev approximation of the target function. We prove advantages on average depths, including quadratic speed-ups on costly parameters.
  arXiv  Detail & Related papers  (2023-07-21T18:00:28Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Quantum Circuits in Additive Hilbert Space [0.0]
  We show how conventional circuits can be expressed in the additive space and how they can be recovered. In particular in our formalism we are able to synthesize high-level multi-controlled primitives from low-level circuit decompositions. Our formulation also accepts a circuit-like diagrammatic representation and proposes a novel and simple interpretation of quantum computation.
  arXiv  Detail & Related papers  (2021-11-01T19:05:41Z)
• 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)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• 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.