Related papers: Geometric Control Methods for Quantum Computations
Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit…
Superposed orders of quantum channels have already been proved - both theoretically and experimentally - to enable unparalleled opportunities in the quantum communication domain. As a matter of fact, superposition of orders can be exploited…
We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than Nielsen's original construction…
A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are…
This paper presents a generalization of conventional sliding mode control designs for systems in Euclidean spaces to fully actuated simple mechanical systems whose configuration space is a Lie group for the trajectory-tracking problem. A…
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…
We extend standard Markovian open quantum systems (quantum channels) by allowing for Hamiltonian controls and elucidate their geometry in terms of Lie semigroups. For standard dissipative interactions with the environment and different…
Strong, fast pulses, called ``bang-bang'' controls can be used to eliminate the effects of system-environment interactions. This method for preventing errors in quantum information processors is treated here in a geometric setting which…
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a…
Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several…
Designing multi-qubit quantum logic gates with experimental constraints is an important problem in quantum computing. Here, we develop a new quantum optimal control algorithm for finding unitary transformations with constraints on the…
Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can…
We explore a field theoretical approach to quantum computing and control. This book consists of three parts. The basics of systems theory and field theory are reviewed in Part I. In Part II, a gauge theory is reinterpreted from a systems…
Alternative mathematical explorations in quantum computing can be of great scientific interest, especially if they come with penetrating physical insights. In this paper, we present a critical revisitation of our geometric (Clifford)…
Universal quantum computation using optical coherent states is studied. A teleportation scheme for a coherent-state qubit is developed and applied to gate operations. This scheme is shown to be robust to detection inefficiency.
A unitary evolution in time may be treated as a curve in the manifold of the special unitary group. The length of such a curve can be related to the energetic cost of the associated computation, meaning a geodesic curve identifies an…
How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However,…
We study the Chern-Simons approach to the topological quantum computing. We use quantum $\mathcal{R}$-matrices as universal quantum gates and study the approximations of some one-qubit operations. We make some modifications to the known…