相关论文: Quantum operation, quantum Fourier transform and s…
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…
The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are…
Engineering quantum operations is one of the main abilities we need for developing quantum technologies and designing new fundamental tests. Here we propose a scheme for realising a controlled operation acting on a travelling quantum field,…
The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…
The results of quantum process tomography on a three-qubit nuclear magnetic resonance quantum information processor are presented, and shown to be consistent with a detailed model of the system-plus-apparatus used for the experiments. The…
For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on…
We develop a comprehensive theory of phase for finite-dimensional quantum systems. The only physical requirement we impose is that phase is complementary to amplitude. To implement this complementarity we use the notion of mutually unbiased…
A class of unitary operations generated by idealized, semiclassical fields is studied. The operations implemented by sharp potential kicks are revisited and the possibility of performing them by softly varying external fields is examined.…
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…
The structure of all completely positive quantum operations is investigated which transform pure two-qubit input states of a given degree of entanglement in a covariant way. Special cases thereof are quantum NOT operations which transform…
The quantum Fourier transform (QFT) is a key primitive for quantum computing that is typically used as a subroutine within a larger computation, for instance for phase estimation. As such, we may have little control over the state that is…
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm,…
We study a quantum computer with fixed and permanent interaction of diagonal type between qubits. It is controlled only by one-qubit quick transformations. It is shown how to implement Quantum Fourier Transform and to solve Shroedinger…
Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in…
Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity,…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
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…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
We propose three core ideas: 1. the wave-particle duality of the qudit quantum space; 2. the classification of all elementary quantum gates by ordered pairs of qudit functionals; 3. a new type of quantum gates called the "quantum wave…
The concept of qudit (a d-level system) cluster state is proposed by generalizing the qubit cluster state (Phys. Rev. Lett. \textbf{86}, 910 (2001)) according to the finite dimensional representations of quantum plane algebra. We…