相关论文: Holonomic Quantum Computation
We propose an implementation of holonomic (geometrical) quantum gates by means of semiconductor nanostructures. Our quantum hardware consists of semiconductor macroatoms driven by sequences of ultrafast laser pulses ({\it all optical…
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described…
As a result of the capabilities of quantum information, the science of quantum information processing is now a prospering, interdisciplinary field focused on better understanding the possibilities and limitations of the underlying theory,…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
Quantum computation based on geometric phase is generally believed to be more robust against certain errors or noises than the conventional dynamical strategy. However, the gate error caused by the decoherence effect is inevitable, and thus…
We discuss fundamentals of quantum computing and information - quantum gates, circuits, algorithms, theorems, error correction, and provide collection of QISKIT programs and exercises for the interested reader.
Quantum phase estimation is fundamental to advancing quantum science and technology. While much of the research has concentrated on estimating a single phase, the simultaneous estimation of multiple phases can yield significantly enhanced…
This review presents an entry-level introduction to topological quantum computation -- quantum computing with anyons. We introduce anyons at the system-independent level of anyon models and discuss the key concepts of protected fusion…
A phase space mathematical formulation of quantum mechanical processes accompanied by and ontological interpretation is presented in an axiomatic form. The problem of quantum measurement, including that of quantum state filtering, is…
The basic idea of quantum computing is surprisingly similar to that of kernel methods in machine learning, namely to efficiently perform computations in an intractably large Hilbert space. In this paper we explore some theoretical…
In this article we present a pedagogical introduction of the main ideas and recent advances in the area of topological quantum computation. We give an overview of the concept of anyons and their exotic statistics, present various models…
A central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems. Research in quantum computation involves contributions from both physics…
Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can…
The paper presents shortly the geometric approach to the problem of a general quantization formalism, both physically meaningful and mathematically consistent.
Because the subject of relativistic quantum field theory (QFT) contains all of non-relativistic quantum mechanics, we expect quantum field computation to contain (non-relativistic) quantum computation. Although we do not yet have a quantum…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
This is an introduction to software methods of quantum fault tolerance. Broadly speaking, these methods describe strategies for using the noisy hardware components of a quantum computer to perform computations while continually monitoring…
I present a method of performing geometric quantization using cohomology groups extended via coefficient groups of different types. This is possible according to the Universal Coefficient Theorem (UTC). I also show that by using this method…
Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the…
Major breakthrough in quantum computation has recently been achieved using quantum annealing to develop analog quantum computers instead of gate based computers. After a short introduction to quantum computation, we retrace very briefly the…