相关论文: Cartoon Computation: Quantum-like computing withou…
Quantum computation and quantum information are of great current interest in computer science, mathematics, physical sciences and engineering. They will likely lead to a new wave of technological innovations in communication, computation…
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…
We present "Diagrams of States", a way to graphically represent and analyze how quantum information is elaborated during the execution of quantum circuits. This introductory tutorial illustrates the basics, providing useful examples of…
This paper is a `spiritual child' of the 2005 lecture notes Kindergarten Quantum Mechanics, which showed how a simple, pictorial extension of Dirac notation allowed several quantum features to be easily expressed and derived, using language…
An implementation of a quantum computer based on space states in double quantum dots is discussed. There is no charge transfer in qubits during calculation, therefore, uncontrollable entan-glement between them due to long-range Coulomb…
Quantum computers, besides offering substantial computational speedups, are also expected to provide the possibility of preserving the privacy of a computation. Here we show the first such experimental demonstration of blind quantum…
Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we consider the application of quantum computers to scientific computing and…
In this paper, we will present some ideas to use 3D topology for quantum computing. Topological quantum computing in the usual sense works with an encoding of information as knotted quantum states of topological phases of matter, thus being…
We introduce and explore the notion of texture of an arbitrary quantum state, in a selected basis. In the first part of this letter we develop a resource theory and show that state texture is adequately described by an easily computable…
We show that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a pre-defined causal order. The simplest example of such a transformation is the classical…
The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity…
With the rapid progress in quantum hardware and software, the need for verification of quantum systems becomes increasingly crucial. While model checking is a dominant and very successful technique for verifying classical systems, its…
Quantum parallelism is the main feature of quantum computation. In 1985 D. Deutsch showed that a single quantum computation may be sufficient to state whether a two-valued function of a two-valued variable is constant or not. Though the…
In recent years, quantum computing has promised a revolution in computing performance, based on massive parallelism enabled by many entangled qubits. Josephson junction integrated circuits have emerged as the key technology to implement…
An adiabatic cyclic evolution of control parameters of a quantum system ends up with a holonomic operation on the system, determined entirely by the geometry in the parameter space. The operation is given either by a simple phase factor (a…
Quantum computing is a fascinating interdisciplinary research field that promises to revolutionize computing by efficiently solving previously intractable problems. Recent years have seen tremendous progress on both the experimental…
Entanglement is essential for quantum computation. However, disentanglement is also necessary. It can be achieved without the need of classical operations (measurements). Two examples are analyzed: the discrete Fourier transform and error…
Quantum algorithms have the potential to provide exponential speedups over some of the best known classical algorithms. These speedups may enable quantum devices to solve currently intractable problems such as those in the fields of…
Quantum computers promise significant speedups in solving problems intractable for conventional computers but, despite recent progress, remain limited in scaling and availability. Therefore, quantum software and hardware development heavily…
We consider a family of unstructured problems, for which we propose a method for constructing analog, continuous-time quantum algorithms that are more efficient than their classical counterparts. In this family of problems, which we refer…