Related papers: Quantum Abacus for counting and factorizing number…
Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a…
As a qubit is a two-level quantum system whose state space is spanned by |0>, |1>, so a qudit is a d-level quantum system whose state space is spanned by |0>,...,|d-1>. Quantum computation has stimulated much recent interest in algorithms…
Qubits are a great way to build a quantum computer, but a limited way to program one. We replace the usual "states and gates" formalism with a "props and ops" (propositions and operators) model in which (a) the C*-algebra of observables…
We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms.…
We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…
The author analyzes quantum computation with the hybrid qubit (HQ) that is encoded using the three-electron configuration of a double quantum dot. All gate operations are controlled with electric signals, while the qubit remains at an…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
One of the major promises of quantum computing is the realization of SIMD (single instruction - multiple data) operations using the phenomenon of superposition. Since the dimension of the state space grows exponentially with the number of…
The paradigm behind digital quantum computing inherits the idea of using binary information processing. Nature in fact gives much more rich structures of physical objects that can be used for encoding information, which is especially…
We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm…
The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales…
Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional…
We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum computation: preparation of the initial…
As an extension of two-level quantum bits (qubits), multilevel systems, so-called qudits, where d represents the Hilbert space dimension, have been predicted to reduce the number of iterations in quantum computation algorithms. This has…
We present a quantum version of the classical probabilistic algorithms $\grave{a}$ la Rabin. The quantum algorithm is based on the essential use of Grover's operator for the quantum search of a database and of Shor's Fourier transform for…
The light's image is the primary source of information carrier in nature. Indeed, a single photon's image possesses a vast information capacity that can be harnessed for quantum information processing. Our scheme for implementing quantum…
Quantum computer versus quantum algorithm processor in CMOS are compared to find (in parallel) all Hamiltonian cycles in a graph with m edges and n vertices, each represented by k bits. A quantum computer uses quantum states analogous to…
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…
Quantum computational algorithms exploit quantum mechanics to solve problems exponentially faster than the best classical algorithms. Shor's quantum algorithm for fast number factoring is a key example and the prime motivator in the…