Related papers: How to decompose arbitrary continuous-variable qua…
We propose a method for decomposing continuous-variable operations into a universal gate set, without the use of any approximations. We fully characterize a set of transformations admitting exact decompositions and describe a process for…
If suitable quantum optical interactions were available, transforming optical field mode operators in a nonlinear fashion, the all-photonics platform could be one of the strongest contenders for realizing a quantum computer. Unlike other,…
Electron transport in realistic physical and chemical systems often involves the non-trivial exchange of energy with a large environment, requiring the definition and treatment of open quantum systems. Because the time evolution of an open…
Unitary operation is an essential step for quantum information processing. We first propose an iterative procedure for decomposing a general unitary operation without resorting to controlled-NOT gate and single-qubit rotation library. Based…
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
Unitary transformations are routinely modeled and implemented in the field of quantum optics. In contrast, nonunitary transformations that can involve loss and gain require a different approach. In this theory work, we present a universal…
Quadratic bosonic Hamiltonians and their associated unitary transformations form a fundamental class of operations in quantum optics, modelling key processes such as squeezing, displacement, and beam-splitting. Their Heisenberg-picture…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
We develop a universal approach enabling the study of any multimode quantum optical system evolving under a quadratic Hamiltonian. Our strategy generalizes the standard symplectic analysis and permits the treatment of multimode systems even…
Decoupling systems into independently evolving components has a long history of simplifying seemingly complex systems. They enable a better understanding of the underlying dynamics and causal structures while providing more efficient means…
Beam-splitter operations are widely used to process information encoded in bosonic modes. In hybrid quantum systems, however, it might be challenging to implement a reliable beam-splitter operation between two distinct bosonic modes.…
Encoding quantum information within bosonic modes offers a promising direction for hardware-efficient and fault-tolerant quantum information processing. However, achieving high-fidelity universal control over the bosonic degree of freedom…
A time evolution operator in the interaction picture is given by exponentiating an interaction Hamiltonian $H$. Important examples of Hamiltonians, often encountered in quantum optics, condensed matter and high energy physics, are of a…
In this work, we decompose the time-evolution of the Bose-Hubbard model into a sequence of logic gates that can be implemented on a continuous-variable photonic quantum computer. We examine the structure of the circuit that represents this…
A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we…
A key task in quantum computation is the application of a sequence of gates implementing a specific unitary operation. However, the decomposition of an arbitrary unitary operation into simpler quantum gates is a nontrivial problem. Here we…
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…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…