Related papers: How to decompose arbitrary continuous-variable qua…
The promise of universal quantum computing requires scalable single- and inter-qubit control interactions. Currently, three of the leading candidate platforms for quantum computing are based on superconducting circuits, trapped ions, and…
Gaussian states are the backbone of quantum information protocols with continuous variable systems, whose power relies fundamentally on the entanglement between the different modes. In the case of global pure states, knowledge of the…
Having a broad range of methods available for implementing unitary operations is crucial for quantum information tasks. We study a dissipative process commonly used to describe dissipatively coupled systems and show that the process can…
Implementing quantum algorithms is essential for quantum computation. We study the implementation of three quantum algorithms by performing homodyne measurements on a two-dimensional temporal continuous-variable cluster state. We first…
Decomposing unitary operations into native gates is an essential step for implementing quantum algorithms. For qubit-based devices, where native gates are typically single- and two-qubit operations, a range of decomposition techniques have…
Quantum computers are the ideal platform for quantum simulations. Given enough coherent operations and qubits, such machines can be leveraged to simulate strongly correlated materials, where intricate quantum effects give rise to…
In order to achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very…
We introduce a framework for realizing universal fermionic quantum processing with globally controlled itinerant fermionic particles. Our approach is tailored to the example of neutral atoms in optical lattices, but transposes to other…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
We show that a universal set of gates for quantum computation with optics can be quantum teleported through the use of EPR entangled states, homodyne detection, and linear optics and squeezing operations conditioned on measurement outcomes.…
We demonstrate how structured decompositions of unitary operators can be employed to derive control schemes for finite-level quantum systems that require only sequences of simple control pulses such as square wave pulses with finite rise…
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a…
The paradigm behind digital quantum computing inherits the idea of using binary information processing. Nature in fact gives much more rich structures of physical objects that can be used for encoding information, which is especially…
We show how to construct a universal set of quantum logic gates using control over exchange interactions and single- and two-spin measurements only. Single-spin unitary operations are teleported instead of being executed directly, thus…
A general scheme is presented to decompose a $d$-by-$d$ unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level…
Bosonic Gaussian unitaries are fundamental building blocks of central continuous-variable quantum technologies such as quantum-optic interferometry and bosonic error-correction schemes. In this work, we present the first time-efficient…
The non-adiabatic holonomic quantum computation with the advantages of fast and robustness attracts widespread attention in recent years. Here, we propose the first scheme for realizing universal single-qubit gates based on an…
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating…
A universal algorithm to construct N-particle (classical and quantum) completely integrable Hamiltonian systems from representations of coalgebras with Casimir element is presented. In particular, this construction shows that quantum…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…