Related papers: Classical simulation of fermionic linear optics au…
We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for fermionic linear optics with non-Gaussian…
Fermionic linear optics is a limited form of quantum computation which is known to be efficiently simulable on a classical computer. We revisit and extend this result by enlarging the set of available computational gates: in addition to…
Particular complexity of linear quantum optical networks is deserved recently certain attention due to possible implications for theory of quantum computation. Two relevant models of bosons are discussed in presented work. Symmetric product…
We consider the realization of universal quantum computation through braiding of Majorana fermions supplemented by unprotected preparation of noisy ancillae. It has been shown by Bravyi [Phys. Rev. A 73, 042313 (2006)] that under the…
Fermionic linear optics is efficiently classically simulatable. Here it is shown that the set of states achievable with fermionic linear optics and particle measurements is the closure of a low dimensional Lie group. The weakness of…
Aaronson and Arkhipov recently used computational complexity theory to argue that classical computers very likely cannot efficiently simulate linear, multimode, quantum-optical interferometers with arbitrary Fock-state inputs [Aaronson and…
We propose efficient classical algorithms which (strongly) simulate the action of bosonic linear optics circuits applied to superpositions of Gaussian states. Our approach relies on an augmented covariance matrix formalism to keep track of…
We provide an alternative view of the efficient classical simulatibility of fermionic linear optics in terms of Slater determinants. We investigate the generic effects of two-mode measurements on the Slater number of fermionic states. We…
Fermionic linear optics corresponds to the dynamics of free fermions, and is known to be efficiently simulable classically. We define fermionic anyon models by deforming the fermionic algebra of creation and annihilation operators, and…
We investigate non-Gaussian states of light as ancillary inputs for generating nonlinear transformations required for quantum computing with continuous variables. We consider a recent proposal for preparing a cubic phase state, find the…
Noisy intermediate-scale quantum (NISQ) computers could solve quantum-mechanical simulation problems that are beyond the capabilities of classical computers. However, NISQ devices experience significant errors which, if not corrected, can…
We demonstrate that a tensor product structure and optical analogy of quantum entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical analogy, we discuss…
We provide a scheme for efficient simulation of a broad class of quantum optics experiments. Our efficient simulation extends the continuous variable Gottesman-Knill theorem to a large class of non-Gaussian mixed states, thereby identifying…
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In particular, we define a model of computation…
We present a general framework for the efficient simulation of realistic fermionic systems with modern machine learning inspired representations of quantum many-body states, towards a universal tool for ab initio electronic structure. These…
Over the past decade classical optical systems with gain or loss, modelled by non-Hermitian parity-time symmetric Hamiltonians, have been deeply investigated. Yet, their applicability to the quantum domain with number-resolved photonic…
Notions of a Gaussian state and a Gaussian linear map are generalized to the case of anticommuting (Grassmann) variables. Conditions under which a Gaussian map is trace preserving and (or) completely positive are formulated. For any…
Simulating quantum states on a classical computer is hard, typically requiring prohibitive resources in terms of memory and computational power. Efficient simulation, however, can be achieved for certain classes of quantum states, in…
It is well known in quantum optics that any process involving the preparation of a multimode gaussian state, followed by a gaussian operation and gaussian measurements, can be efficiently simulated by classical computers. Here, we provide…
The current shift in the quantum optics community towards large-size experiments -- with many modes and photons -- necessitates new classical simulation techniques that go beyond the usual phase space formulation of quantum mechanics. To…