Related papers: Super-Golden-Gates for PU(2)
We propose a simple formalism to design unitary gates robust against given systematic errors. This formalism generalizes our previous observation [Y. Kondo and M. Bando, J. Phys. Soc. Jpn. 80, 054002 (2011)] that vanishing dynamical phase…
We analyze the accuracy of quantum phase gates acting on "0-$\pi$ qubits" in superconducting circuits, where the gates are protected against thermal and Hamiltonian noise by continuous-variable quantum error-correcting codes. The gates are…
Transversal gates are the ideal gates in a fault-tolerant scenario; relatively easy to implement, and minimally error propagating. Their availability will maximise fault tolerant thresholds, enabling universal quantum computation in a wider…
Non-adiabatic and non-closed evolutionary paths play a significant role in the fidelity of quantum gates. We propose a high-fidelity quantum control framework based on the quasi-topological number ($\nu_{\text{qua}}$), which extends the…
Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. In many cases, such qubits are actually made out of multilevel systems but with only two states being used for computational purpose.…
In this note we present explicit canonical forms for all the elements in the two-qubit CNOT-Dihedral group, with minimal numbers of controlled-S (CS) and controlled-X (CX) gates, using the generating set of quantum gates [X, T, CX, CS]. We…
The prospect of coupling a two-dimensional (2D) semiconductor heterostructure to a superconductor opens new research and technology opportunities, including fundamental problems in mesoscopic superconductivity, scalable superconducting…
We propose a feasible scheme to implement a universal set of quantum gates based on geometric phases and superadiabatic quantum control. Consolidating the advantages of both strategies, the proposed quantum gates are robust and fast. The…
We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity.…
Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the B gate is the unique gate that can…
We solve $\mathcal{N}=1$ supersymmetric $A_{2}$ type $U(N)\times U(N)$ matrix models obtained by deforming $\mathcal{N}=2$ with symmetric tree level superpotentials of any degree exactly in the planar limit. These theories can be…
It is known that a semi-classical analysis is not always adequate for atomtronics devices, but that a fully quantum analysis is often necessary to make reliable predictions. While small numbers of atoms at a small number of sites are…
The program of classifying symmetry protected topological (SPT) phases in 1D has been recently completed and has opened the doors to study closely the properties of systems belonging to these phases. It was recently found that being able to…
We propose a method to generate arbitrary symmetric states of N qubits, which can be easily associated with their entanglement classes. It is particularly suited to quantum optics systems like trapped ions or superconducting circuits. We…
We show the complete integrability of N=2 nonstandard KP flows establishing the biHamiltonian structures. One of Hamiltonian structures is shown to be isomorphic to the nonlinear N=2 $\hat W_{\infty}$ algebra with the bosonic sector having…
Type A N-fold supersymmetry of one-dimensional quantum mechanics can be constructed by using sl(2) generators represented on a finite dimensional functional space. Using this sl(2) formalism we show a general method of constructing Type A…
Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical…
Consider the universal gate set for quantum computing consisting of the gates X, CX, CCX, omega^dagger H, and S. All of these gates have matrix entries in the ring Z[1/2,i], the smallest subring of the complex numbers containing 1/2 and i.…
From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either…
In quantum mechanics, the connection between the operator algebraic realization and the logical models of measurement of state observables has long been an open question. In the approach that is presented here, we introduce a new…