Related papers: Quantum operation, quantum Fourier transform and s…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
Quantum computation has received great attention in recent years for its possible application to difficult problem in classical calculation. Despite the experimental problems of implementing quantum devices, theoretical physicists have…
An operational description of quantum phenomena concerns developing models that describe experimentally observed behaviour. $\textit{Higher-order quantum operations}\unicode{x2014}$quantum operations that transform quantum…
This paper discusses the compilation, optimization, and error mitigation of quantum algorithms, essential steps to execute real-world quantum algorithms. Quantum algorithms running on a hybrid platform with QPU and CPU/GPU take advantage of…
Using a quantumlike description for light propagation in nonhomogeneous optical fibers, quantum information processing can be implemented by optical means. Quantum-like bits (qulbits) are associated to light modes in the optical fiber and…
We generalize the binary quantum counting algorithm of Lesovik, Suslov, and Blatter [Phys. Rev. A 82, 012316 (2010)] to higher counting bases. The algorithm makes use of qubits, qutrits, and qudits to count numbers in a base 2, base 3, or…
An essential element of classical computation is the "if-then" construct, that accepts a control bit and an arbitrary gate, and provides conditional execution of the gate depending on the value of the controlling bit. On the other hand,…
Using the the convex semidefinite programming method and superoperator formalism we obtain the finite quantum tomography of some mixed quantum states such as: qudit tomography, N-qubit tomography, phase tomography and coherent spin state…
We study the physical resources required to implement general quantum operations, and provide new bounds on the minimum possible size which an environment must be in order to perform certain quantum operations. We prove that contrary to a…
We present a new implementation of quantum computation that treats quantum computers as a special type of Bayesian Network called a QuDot Net. QuDot Nets allow for the efficient representation of some qubit systems. Single qubit quantum…
Many insights into the quantum world can be found by studying it from amongst more general operational theories of physics. In this thesis, we develop an approach to the study of such theories purely in terms of the behaviour of their…
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…
This paper initiates a systematic study of quantum functions, which are (partial) functions defined in terms of quantum mechanical computations. Of all quantum functions, we focus on resource-bounded quantum functions whose inputs are…
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…
Fourier and fractional-Fourier transformations are widely used in theoretical physics. In this paper we make quantum perspectives and generalization for the fractional Fourier transformation (FrFT). By virtue of quantum mechanical…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
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…
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…
The Quantum Fourier Transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing Quantum Fourier Transform adders and multipliers and propose some modifications that extend their…
We propose in this work a concept of integrability for quantum systems, which corresponds to the concept of noncommutative integrability for systems in classical mechanics. We determine a condition for quantum operators which can be a…