相关论文: Quantum Computation and the localization of Modula…
Current quantum devices execute specific tasks that are hard for classical computers and have the potential to solve problems such as quantum simulation of material science and chemistry, even without error correction. For practical…
In this paper, we focus on computing local minimizers of a multivariate polynomial optimization problem under certain genericity conditions. By using a technique in computer algebra and the second-order optimality condition, we provide a…
Here is discussed the Hamiltonian approach to construction of deterministic universal (in approximate sense) programmable quantum circuits with qubits or any other quantum systems with dimension of Hilbert space is $n \ge 2$.
We define a model of quantum computation with local fermionic modes (LFMs) -- sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of $m$ LFMs and the Hilbert space of $m$ qubits,…
We propose a method for quantization of Lagrangians for which the Hamiltonian, as a function of momentum, is a branched function with cusps. Appropriate boundary conditions, which we identify, insure unitary time evolution. In special cases…
Using the formalism of discrete quantum group gauge theory, one can construct the quantum algebras of observables for the Hamiltonian Chern-Simons model. The resulting moduli algebras provide quantizations of the algebra of functions on the…
In the current era of noisy quantum devices, there is a need for quantum algorithms that are efficient and robust against noise. Towards this end, we introduce the projected cooling algorithm for quantum computation. The projected cooling…
In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form braids of their world lines in 2+1 dimensional space-time. In…
A proposal for a magnetic quantum processor that consists of individual molecular spins coupled to superconducting coplanar resonators and transmission lines is carefully examined. We derive a simple magnetic quantum electrodynamics…
Quantum Hamiltonian complexity studies computational complexity aspects of local Hamiltonians and ground states; these questions can be viewed as generalizations of classical computational complexity problems related to local constraint…
Holonomic Quantum Computation (HQC) is an all-geometrical approach to quantum information processing. In the HQC strategy information is encoded in degenerate eigen-spaces of a parametric family of Hamiltonians. The computational network of…
We put forward an interpretation of scalar quantum field theory as relativistic quantum mechanics by curing well known problems related to locality. A probabilistic interpretation of quantum field theory similar to quantum mechanics is…
We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end.…
Quantum mechanics permits certain kinds of non-local effects. This paper demonstrates how these can be used for distributed computation with minimal communication between various processors. The problem considered is that of estimating the…
The usual methods for formulating and solving the quantum mechanics of a particle moving in a magnetic field respect neither locality nor any global symmetries which happen to be present. For example, Landau's solution for a particle moving…
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…
Quantum kernels quantify similarity between data points by measuring the inner product between quantum states, computed through quantum circuit measurements. By embedding data into quantum systems, quantum kernel feature maps, that may be…
We present two universal models of quantum computation with a time-independent, frustration-free Hamiltonian. The first construction uses 3-local (qubit) projectors, and the second one requires only 2-local qubit-qutrit projectors. We build…
We present a local framework for investigating non-unitary evolution groups pertinent to effective field theories in general semi-classical spacetimes. Our approach is based on a rigorous local stability analysis of the algebra of…
Stochastic realization of the wave function in quantum mechanics, with the inclusion of soliton representation of extended particles, is discussed. The concept of Stochastic Qubits is used for quantum computing modeling.