Related papers: Quantum Algorithm Processors to Reveal Hamiltonian…
Quantum computers hold great promise to enhance machine learning, but their current qubit counts restrict the realisation of this promise. In an attempt to placate this limitation techniques can be applied for evaluating a quantum circuit…
We consider quantum formalism limited by the classical simulating computer with the fixed memory. The memory is redistributed in the course of modeling by the variation of the set of classical states and the accuracy of the representation…
The energy gap is calculated for the ground state quantum computer circuit, which was recently proposed by Mizel et.al. When implementing a quantum algorithm by Hamiltonians containing only pairwise interaction, the inverse of energy gap…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…
We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the…
Quantum++ is a modern general-purpose multi-threaded quantum computing library written in C++11 and composed solely of header files. The library is not restricted to qubit systems or specific quantum information processing tasks, being…
This course of lectures has been taught for several years at the Lomonosov Moscow State University; its modified version in 2021 is read in the Zhejiang University (Hangzhou), in the framework of summer school on quantum computing. The…
Quantum devices, from simple fixed-function tools to the ultimate goal of a universal quantum computer, will require high quality, frequent repetition of a small set of core operations, such as the preparation of entangled states. These…
We found that the actual computational time-cost of the QFT is O(n 2^n) for large n in a quantum computer using nuclear spins. The computational cost of a quantum algorithm has usually been estimated as the sum of the universal gates…
Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation…
By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with…
Faster algorithms, novel cryptographic mechanisms, and alternative methods of communication become possible when the model underlying information and computation changes from a classical mechanical model to a quantum mechanical one. Quantum…
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…
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…
This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulae, written in terms of matrix coefficients, characterizing operators implementable…
This research paper gives an overview of quantum computers - description of their operation, differences between quantum and silicon computers, major construction problems of a quantum computer and many other basic aspects. No special…
How to implement multi-qubit gates is an important problem in quantum information processing. Based on cross phase modulation, we present an approach to realizing a family of multi-qubit gates that deterministically operate on single…
The concept of negative probabilities can be used to decompose the interaction of two qubits mediated by a quantum controlled-NOT into three operations that require only classical interactions (that is, local operations and classical…
A possibility of performing the C-NOT gate operation at the ground and the first excited states of two harmonic oscillators interacting via a two-level system subject to complete control is demonstrated. The system resembles Turing machine,…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…