Related papers: Phase space tableau simulation for quantum computa…
Noise detrimentally affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, LOWESA (low weight efficient simulation…
Recent advances in the field of quantum technologies have opened up the road for the realization of small-scale quantum simulators of lattice gauge theories which, among other goals, aim at improving our understanding on the…
This article first gives a concise introduction to quantum phase transitions, emphasizing similarities with and differences to classical thermal transitions. After pointing out the computational challenges posed by quantum phase…
The Wigner function formalism has played a pivotal role in examining the non-classical aspects of quantum states and their classical simulatability. Nevertheless, its application in qubit systems faces limitations due to negativity induced…
We propose a computationally efficient method to solve the dynamics of operators of bosonic quantum systems coupled to their environments. The method maps the operator under interest to a set of complex-valued functions, and its adjoint…
We reformulate the full quantum dynamics of spin systems using a phase space representation based on SU(2) coherent states which generates an exact mapping of the dynamics of any spin system onto a set of stochastic differential equations.…
We present a classical protocol, using the matrix product state representation, to simulate cluster-state quantum computation at a cost polynomial in the number of qubits in the cluster and exponential in d -- the width of the cluster. We…
Perturbation theories provide valuable insights on quantum many-body systems. Systems of interacting particles, like electrons, are often treated perturbatively around exactly solvable Gaussian points. Systems of interacting qubits have…
In this paper we consider the possibility to use numerical simulations for a computer assisted analysis of integrability of dynamical systems. We formulate a rather general method of recovering the obstruction to integrability for the…
Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…
The phase-space formulation of quantum mechanics has recently seen increased use in testing quantum technologies, including metho ds of tomography for state verification and device validation. Here, an overview of quantum mechanics in phase…
Quantum simulation of non-Markovian open quantum dynamics is essential but challenging for standard quantum computers due to their non-Hermitian nature, leading to non-unitary evolution, and the limitations of available quantum resources.…
This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…
In classical computation, a problem can be solved in multiple steps where calculated results of each step can be copied and used repeatedly. While in quantum computation, it is difficult to realize a similar multi-step computation process…
Simulating nonlinear classical dynamics on a quantum computer is an inherently challenging task due to the linear operator formulation of quantum mechanics. In this work, we provide a systematic approach to alleviate this difficulty by…
We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…
We review some recent progress in quantum field theory in non-commutative space, focusing onto the fuzzy sphere as a non-perturbative regularisation scheme. We first introduce the basic formalism, and discuss the limits corresponding to…
As quantum devices continue to grow in size but remain affected by noise, it is crucial to determine when and how they can outperform classical computers on practical tasks. A central piece in this effort is to develop the most efficient…
Hamiltonian simulation is a promising application for quantum computers to achieve a quantum advantage. We present classical algorithms based on tensor network methods to optimize quantum circuits for this task. We show that, compared to…
We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…