Related papers: How to decompose arbitrary continuous-variable qua…
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used…
Using the operator formulation we discuss the bosonization of the two-dimensional derivative-coupling model. The fully bosonized quantum Hamiltonian is obtained by computing the composite operators as the leading terms in the Wilson short…
The realization of robust universal quantum computation with any platform ultimately requires both the coherent storage of quantum information and (at least) one entangling operation between individual elements. The use of…
Exponential operator decompositions are an important tool in many fields of physics, for example, in quantum control, quantum computation, or condensed matter physics. In this work, we present a method for obtaining such decompositions,…
The decomposition of multiport interferometers is a fundamental tool in quantum optics and computing. This note aims to serve as a concise reference for performing the decomposition according to the most common design approaches, offering a…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
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,…
Gaussian states, operations, and measurements are central building blocks for continuous-variable quantum information processing which paves the way for abundant applications, especially including network-based quantum computation and…
We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series…
We propose an experimental design for universal continuous-variable quantum computation that incorporates recent innovations in linear-optics-based continuous-variable cluster state generation and cubic-phase gate teleportation. The first…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit…
Beam-splitter operations are an indispensable resource for processing quantum information encoded in bosonic modes. However, in hybrid quantum systems, it can be challenging to implement reliable beam-splitters between two distinct bosonic…
We introduce a general method based on the operators of the Dyson-Masleev transformation to map the Hamiltonian of an arbitrary model system into the Hamiltonian of a circuit Quantum Electrodynamics (cQED) processor. Furthermore, we…
Nature provides us with a restricted set of microscopic interactions. The question is whether we can synthesize out of these fundamental interactions an arbitrary unitary operator. In this paper we present a constructive algorithm for…
We study the possibility for a global unitary applied on an arbitrary number of qubits to be decomposed in a sequential unitary procedure, where an ancillary system is allowed to interact only once with each qubit. We prove that sequential…
Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and…
It is shown that if one can perform a restricted set of fast manipulations on a quantum system, one can implement a large class of dynamical evolutions by effectively removing or introducing selected Hamiltonians. The procedure can be used…
Decomposing complex unitary evolution into a series of constituent components is a cornerstone of practical quantum information processing. While the decompostion of an $n\times n$ unitary into a series of $2\times2$ subunitaries is well…
Two-level boson systems displaying a quantum phase transition from a spherical (symmetric) to a deformed (broken) phase are studied. A formalism to diagonalize Hamiltonians with $O(2L+1)$ symmetry for large number of bosons is worked out.…
We present control schemes for open quantum systems that combine decoupling and universal control methods with coding procedures. By exploiting a general algebraic approach, we show how appropriate encodings of quantum states result in…