Related papers: Generalized Boolean Functions and Quantum Circuits…
Geometric phases induced in quantum evolutions have built-in noise-resilient characters, and thus can find applications in many robust quantum manipulation tasks. Here, we propose a feasible and fast scheme for universal quantum computation…
We propose a universal quantum circuit design that can estimate any arbitrary one-dimensional periodic functions based on the corresponding Fourier expansion. The quantum circuit contains N-qubits to store the information on the different…
In 2005, H{\o}yer and \v{S}palek showed that constant-depth quantum circuits augmented with multi-qubit Fanout gates are quite powerful, able to compute a wide variety of Boolean functions as well as the quantum Fourier transform. They also…
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…
The fidelity of certain gates on noisy quantum computers may be improved when they are implemented using more than two levels of the involved transmons. The main impediments to achieving this potential are the dynamic gate phase errors that…
The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the…
In the paper, we consider quantum circuits for the Quantum Fourier Transform (QFT) algorithm. The QFT algorithm is a very popular technique used in many quantum algorithms. We present a generic method for constructing quantum circuits for…
We show in detail how the Jordan-Wigner transformation can be used to simulate any fermionic many-body Hamiltonian on a quantum computer. We develop an algorithm based on appropriate qubit gates that takes a general fermionic Hamiltonian,…
The wave functions of quantum Calogero-Sutherland systems for trigonometric case are related to polynomials in l variables (l is a rank of root system) and they are the generalization of Gegenbauer polynomials and Jack polynomials. Using…
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…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
Non-Gaussian operations are essential for most bosonic quantum technologies. Yet, realizable non-Gaussian gates are rather limited in type and generally suffer from accuracy-duration trade-offs. In this work, we propose to use quantum…
Despite significant advances in quantum algorithms, quantum programs in practice are often expressed at the circuit level, forgoing helpful structural abstractions common to their classical counterparts. Consequently, as many quantum…
The relationship between quantum physics and discrete mathematics is reviewed in this article. The Boolean functions unitary representation is considered. The relationship between Zhegalkin polynomial, which defines the algebraic normal…
We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed universal quantum gates can be realized by using non-Abelian geometric phases. We show how a set of non-adiabatic holonomic one- and two-qubit…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus,…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
The physical implementation of holonomic quantum computation is challenging due to the needed complex controllable interactions in multilevel quantum systems. Here we propose to implement nonadiabatic holonomic quantum computation with…
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type…