Related papers: Qubitization of Bosons
We study the hardness of classically simulating Gaussian boson sampling at nonzero photon distinguishability. We find that similar to regular boson sampling, distinguishability causes exponential attenuation of the many-photon interference…
We analyse the matrix factorization problem. Given a noisy measurement of a product of two matrices, the problem is to estimate back the original matrices. It arises in many applications such as dictionary learning, blind matrix…
Boson-sampling has been presented as a simplified model for linear optical quantum computing. In the boson-sampling model, Fock states are passed through a linear optics network and sampled via number-resolved photodetection. It has been…
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, the…
Quantum bits, or qubits, are the fundamental building blocks of present quantum computers. Hence, it is important to be able to characterize the state of a qubit as accurately as possible. By evaluating the qubit characterization problem…
Efficient encoding of electronic operators into qubits is essential for quantum chemistry simulations. The majority of methods map single electron states to qubits, effectively handling electron interactions. Alternatively, pairs of…
We show that a theory of complex scattering between many-body (Fock) states can be constructed such that its classical limit is a canonical transformation thus encoding quantum interference in the semiclassical form of the associated…
We develop theoretical methods for the implementation of creation and destruction operators in separate registers of a quantum computer, allowing for a transparent and dynamical creation and destruction of particle modes in second…
Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…
We compare the basic resource requirements for first and second quantized bosonic mappings in a system consisting of $N$ particles in $M$ modes. In addition to the standard binary first quantized mapping, we investigate the unary first…
BosonSampling is an intermediate model of quantum computation where linear-optical networks are used to solve sampling problems expected to be hard for classical computers. Since these devices are not expected to be universal for quantum…
We propose boson sampling from a system of coupled photons and Bose-Einstein condensed atoms placed inside a multi-mode cavity as a simulation process testing quantum advantage of quantum systems over classical computers. Consider a…
While universal quantum computers ideally solve problems such as factoring integers exponentially more efficiently than classical machines, the formidable challenges in building such devices motivate the demonstration of simpler,…
Practical quantum state tomography is usually performed by carrying out repeated measurements on many copies of a given state. The accuracy of the reconstruction depends strongly on the dimensionality of the system and the number of copies…
Two-qubit logical gates are proposed on the basis of two atoms trapped in a cavity setup. Losses in the interaction by spontaneous transitions are efficiently suppressed by employing adiabatic transitions and the Zeno effect. Dynamical and…
We show that measuring pairs of qubits in the Bell basis can be used to obtain a simple quantum algorithm for efficiently identifying an unknown stabilizer state of n qubits. The algorithm uses O(n) copies of the input state and fails with…
We study the mapping which occurs when a single qubit in an arbitrary state interacts with another qubit in a given, fixed state resulting in some unitary transformation on the two qubit system which, in effect, makes two copies of the…
Bosonic quantum error correcting codes are primarily designed to protect against single-photon loss. To correct for this type of error, one can encode the logical qubit in code spaces with a definite photon parity, such as cat codes or…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We present a fully digital approach for simulating single-mode squeezed states on a superconducting quantum processor using an enhanced bosonic encoding strategy. By mapping up to 2^{n} photonic Fock states onto n qubits, our framework…