Related papers: Simulation of quantum computation with magic state…
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations to a universal set by the addition of `magic' quantum states. In this context, we develop a general…
The Wigner function of quantum systems is an effective instrument to construct the approximate classical description of the systems for which the classical approximation is possible. During the last time, the Wigner function formalism is…
In this article we introduce a novel quantum state, the perfect quantum optical vortex state which exhibits a highly localised distribution along a ring in the quadrature space. We examine its nonclassical properties using the Wigner…
Wigner's theorem asserts that an isometric (probability conserving) transformation on a quantum state space must be generated by a Hamiltonian that is Hermitian. It is shown that when the Hermiticity condition on the Hamiltonian is relaxed,…
Quasiprobability representations are well-established tools in quantum information science, with applications ranging from the classical simulability of quantum computation to quantum process tomography, quantum error correction, and…
The pursuit of quantum advantage in simulating many-body quantum systems on quantum computers has gained momentum with advancements in quantum hardware. This work focuses on leveraging the symmetry properties of these systems, particularly…
Quantum simulation is an important application of future quantum computers with applications in quantum chemistry, condensed matter, and beyond. Quantum simulation of fermionic systems presents a specific challenge. The Jordan-Wigner…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Developing space- and time-efficient logical magic state preparation protocols will likely be an essential step towards building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for…
Quantum simulation is a rapidly evolving tool with great potential for research at the frontiers of physics, and is particularly suited to be used in computationally intensive lattice simulations, such as problems with non-equilibrium. In…
Quantum state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the…
We show that a quantum state may be represented as the sum of a joint probability and a complex quantum modification term. The joint probability and the modification term can both be observed in successive projective measurements. The…
A quantum state is fully characterized by its density matrix or equivalently by its quasiprobabilities in phase space. A scheme to identify the quasiprobabilities of a quantum state is an important tool in the recent development of quantum…
The discrimination of any pair of unknown quantum states is performed by devices processing three parts of inputs: copies of the pair of unknown states we want to discriminate are respectively stored in two program systems and copies of…
The presence of unique quantum correlations is the core of quantum information processing and general quantum theory. We address the fundamental question of how quantum correlations of a generic quantum system can be probed using…
(Abridged.) Quantum computers promise to solve some problems exponentially faster than traditional computers, but we still do not fully understand why this is the case. While the most studied model of quantum computation uses qubits, which…
We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via quantum polynomial…
We study the computational power of unitary Clifford circuits with solely magic state inputs (CM circuits), supplemented by classical efficient computation. We show that CM circuits are hard to classically simulate up to multiplicative…
We formulate a discrete two-state stochastic process with elementary rules that give rise to Born statistics and reproduce the probabilities from the Schr\"odinger equation under an associated Hamiltonian matrix, which we identify. We…
We describe a universal scheme of quantum computation by state injection on rebits (states with real density matrices). For this scheme, we establish contextuality and Wigner function negativity as computational resources, extending results…