Related papers: Qubitization of Bosons
Since the dawn of quantum computation science, a range of quantum algorithms have been proposed, yet few have experimentally demonstrated a definitive quantum advantage. Shor's algorithm, while renowned, has not been realized at a scale 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…
Using a quantumlike description for light propagation in nonhomogeneous optical fibers, quantum information processing can be implemented by optical means. Quantum-like bits (qulbits) are associated to light modes in the optical fiber and…
Two-mode cavities can be prepared in quantum states which represent symmetric multi-qubit states. However, the qubits are impossible to address individually and as such cannot be independently measured or otherwise manipulated. We propose…
Simulating a system of two driven coupled qubits, we show that the time-averaged probability to find one driven qubit in its ground or excited state can be controlled by an ac drive in the second qubit. Moreover, off-diagonal elements of…
Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful…
We provide several applications of a previously introduced isomorphism between physical operations acting on two systems and entangled states [1]. We show: (i) how to implement (weakly) non-local two qubit unitary operations with a small…
Quantum machine learning aspires to overcome intractability that currently limits its applicability to practical problems. However, quantum machine learning itself is limited by low effective dimensions achievable in state-of-the-art…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
We discuss a new approach to simulate quantum algorithms using classical probabilistic bits and circuits. Each qubit (a two-level quantum system) is initially mapped to a vector in an eight dimensional probability space (equivalently, to a…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
Using the quantum map formalism, we provide a framework to construct fuzzy and coarse grained quantum states of many-body systems that account for limitations in the resolution of real measurement devices probing them. The first set of maps…
The novel experimental realization of three-level optical quantum systems is presented. We use the polarization state of biphotons to generate a specific sequence of states that are used in the extended version of BB84 protocol. We…
In the paper is discussed complete probabilistic description of quantum systems with application to multiqubit quantum computations. In simplest case it is a set of probabilities of transitions to some fixed set of states. The probabilities…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…
We analyze a coupling scheme for qubits in different cavities of circuit-QED architecture. In contrast to the usual scheme where the cavities are coupled by an interface capacitance we employ a bridge qubit connecting cavities to mediate…
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in…
Inspired by recent advances in the manipulation of superconducting circuits coupled to mechanical modes in the quantum regime, we propose a protocol for generating superpositions of orthogonally squeezed states in a quantum harmonic…
We introduce a protocol for the fast simulation of $n$-dimensional quantum systems on $n$-qubit quantum computers with tunable couplings. A mapping is given between the control parameters of the quantum computer and the matrix elements of…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…