相关论文: Quantum operation, quantum Fourier transform and s…

Contemporary quantum computers encode and process quantum information in binary qubits (d = 2). However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting…

We built up a explicit realization of (0+1)-dimensional q-deformed superspace coordinates as operators on standard superspace. A q-generalization of supersymmetric transformations is obtained, enabling us to introduce scalar superfields and…

Very recently the most general ensemble of qubits are identified using the notion of linearity; any of these qubits gets accepted by a Hadamard gate to generate the equal superposition of the qubit and its orthogonal. Towards more…

We construct a quantum algorithm that performs function-dependent phase transform and requires no initialization of an ancillary register. The algorithm recovers the initial state of an ancillary register regardless of whether its state is…

We consider a mechanism to generate controllable qudit-qudit interactions in a charge-position paradigm for a quantum computer, through the use of auxiliary states. By controlling the tunneling rates onto these auxiliaries from the qudits…

A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum…

Quantum operations (QO) describe any state change allowed in quantum mechanics, such as the evolution of an open system or the state change due to a measurement. We address the problem of which unitary transformations and which observables…

Suppose that a quantum circuit with K elementary gates is known for a unitary matrix U, and assume that U^m is a scalar matrix for some positive integer m. We show that a function of U can be realized on a quantum computer with at most…

The ability to manipulate quantum systems lies at the heart of the development of quantum technology. The ultimate goal of quantum control is to realize arbitrary quantum operations (AQuOs) for all possible open quantum system dynamics.…

We interpret quantum computing as a geometric evolution process by reformulating finite quantum systems via Connes' noncommutative geometry. In this formulation, quantum states are represented as noncommutative connections, while gauge…

Completely positive quantum operations are frequently discussed in the contexts of statistical mechanics and quantum information. They are customarily given by maps forming positive operator-values measures. To intuitively understand…

By encoding a qudit in a harmonic oscillator and investigating the d --> infinity limit, we give an entirely new realization of continuous-variable quantum computation. The generalized Pauli group is generated by number and phase operators…

Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…

Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…

- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has…

We give a detailed exposition of the "vectorized" notation for dealing with quantum operations. This notation is used to highlight the relationships between representations of completely-positive dynamics. Vectorization considerably…

We identify "proper quantum computation" with computational processes that cannot be efficiently simulated on a classical computer. For optical quantum computation, we establish "no-go" theorems for classes of quantum optical experiments…

In quantum physics, the density operator completely describes the state. Instead, in classical physics the mean value of every physical quantity is evaluated by means of a probability distribution. We study the possibility to describe pure…

We study Fourier theory on quantum Euclidean space. A modified version of the general definition of the Fourier transform on a quantum space is used and its inverse is constructed. The Fourier transforms can be defined by their Bochner's…

Lectures on quantum computing. Contents: Algorithms. Quantum circuits. Quantum Fourier transform. Elements of number theory. Modular exponentiation. Shor`s algorithm for finding the order. Computational complexity of Schor`s algorithm.…