相关论文: Universal Quantum Gates For Tensors
One of the most challenging problems for the realization of a scalable quantum computer is to design a physical device that keeps the error rate for each quantum processing operation low. These errors can originate from the accuracy of…
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…
A typical quantum experiment has a bunch of apparatuses placed so that quantum systems can pass between them. We regard each use of an apparatus, along with some given outcome on the apparatus (a certain detector click or a certain meter…
We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the…
As physical systems, qubits must evolve from input to output state. We describe a simple scheme in which the effect of a quantum gate is described by the action of an effective Hamiltonian acting for some characteristic time. This model…
We consider the problem of deciding if a set of quantum one-qudit gates $\mathcal{S}=\{g_1,\ldots,g_n\}\subset G$ is universal, i.e if the closure $\overline{<\mathcal{S}>}$ is equal to $G$, where $G$ is either the special unitary or the…
It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
In the rapidly evolving field of quantum computing, tensor networks serve as an important tool due to their multifaceted utility. In this paper, we review the diverse applications of tensor networks and show that they are an important…
We illustrate a rigorous approach to express the totally symmetric isotropic tensors of arbitrary rank in the $n$-dimensional Euclidean space as a linear combination of products of Kronecker deltas. By making full use of the symmetries, one…
I present a method of quantization using cohomology groups extended via coefficient groups of different types. This is possible according to the Universal Coefficient Theorem (UCT). I also show that by using this method new features of…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
We propose a method for quantum computation which uses control of spin-orbit coupling in a linear array of single electron quantum dots. Quantum gates are carried out by pulsing the exchange interaction between neighboring electron spins,…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
Dual unitary gates are highly non-local two-qudit unitary gates that have been studied extensively in quantum many-body physics and quantum information in the recent past. A special class of dual unitary gates consists of rank-four perfect…
We consider the design of self-testers for quantum gates. A self-tester for the gates F_1,...,F_m is a classical procedure that, given any gates G_1,...,G_m, decides with high probability if each G_i is close to F_i. This decision has to…
A set of universal quantum gates is a vital part of the theory of quantum computing, but is absent in the developing theory of Relativistic Quantum Information (RQI). Yet, the Unruh--DeWitt (UDW) detector formalism can be elevated to…
The optimal implementation of quantum gates for closed $N$-qubit systems is one of the key challenges for practical realization of many quantum information processing tasks. In the present article, based on the generalized Bloch vectors…
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…
We harness general relativistic effects to gain quantum control on a stationary qubit in an optical cavity by controlling the non-inertial motion of a different probe atom. Furthermore, we show that by considering relativistic trajectories…