Related papers: Phase space simulation method for quantum computat…
We study the class of discrete Wigner functions proposed by Gibbons et al. [Phys. Rev. A 70, 062101 (2004)] to describe quantum states using a discrete phase-space based on finite fields. We find the extrema of such functions for small…
Quantum algorithms profit from the interference of quantum states in an exponentially large Hilbert space and the fact that unitary transformations on that Hilbert space can be broken down to universal gates that act only on one or two…
The most scalable proposed methods of simulating lattice fermions on noisy quantum computers employ encodings that eliminate nonlocal operators using a constant factor more qubits and a nontrivial stabilizer group. In this work, we…
Simulating quantum circuits is a computationally intensive task that relies heavily on tensor products and matrix multiplications, which can be inefficient. Recent advancements, eliminate the need for tensor products and matrix…
Classically simulating circuits with bosonic codes is challenging due to the prohibitive cost of simulating quantum systems with many, possibly infinite, energy levels. We propose an algorithm to simulate circuits with encoded…
In a recent work arXiv:2201.07655v2 we showed that there is a constant $\lambda >0$ such that it is possible to efficiently classically simulate a quantum system in which (i) qudits are placed on the nodes of a graph, (ii) each qudit…
Magic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states and plays a fundamental role from quantum state complexity to universal fault-tolerant quantum computing. However, analytical or…
We investigate features of the quasi-joint-probability distribution for finite-state quantum systems, especially the two-state and three-state quantum systems, comparing different types of quasi-joint-probability distributions based on the…
While quantum simulation is one of the most promising applications of modern quantum devices, accessible simulation times are fundamentally limited by finite coherence times due to omnipresent noise. Based on the ideas of relational…
We study the efficiency of quantum algorithms which aim at obtaining phase space distribution functions of quantum systems. Wigner and Husimi functions are considered. Different quantum algorithms are envisioned to build these functions,…
Quantum computers promise significant speedups in solving problems intractable for conventional computers but, despite recent progress, remain limited in scaling and availability. Therefore, quantum software and hardware development heavily…
Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic…
A phase-space approach is used and benchmarked for the simulation of the continuous-time evolution of large registers of qubits. It is based on a statistical ensemble of independent mean-field trajectories, where mean field is introduced at…
In this article we introduce a quasiprobability distribution of work that is based on the Wigner function. This construction rests on the idea that the work done on an isolated system can be coherently measured by coupling the system to a…
Simulating the dynamics of complex quantum systems is a central application of quantum devices. Here, we propose leveraging the power of measurements to simulate short-time quantum dynamics of physically prepared quantum states in classical…
In this paper, we address the phase space formulation of the Jaynes-Cummings model through the explicit construction of the full Wigner function for a hybrid bipartite quantum system composed of a two-level atom and a quantized coherent…
An effective simulation of quantum entanglement is presented using classical fields modulated with n pseudorandom phase sequences (PPSs) that constitute a n2^n-dimensional Hilbert space with a tensor product structure. Applications to…
Imaginary time evolution is a powerful technique for computing the ground state of quantum Hamiltonians, where the convergence to ground state in asymptotic imaginary time is guaranteed. However, implementing this method on quantum…
Quantum circuit simulators running on classical computers offer a vital platform for designing, testing, and optimizing quantum algorithms, driving innovation despite limited access to real quantum hardware. However, their scalability is…
Pauli-based computation (PBC) is a universal model for quantum computation with qubits where the input state is a magic (resource) state and the computation is driven by a sequence of adaptively chosen and compatible multiqubit Pauli…