相关论文: Quantum Computation and the localization of Modula…
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different…
Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. However, many studies rely on toy datasets or heavy feature reduction, raising concerns about their scalability.…
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle…
Modular tensor categories are generalizations of the representation categories of quantum groups at roots of unity axiomatizing the properties necessary to produce 3-dimensional TQFTs. Although other constructions have since been found,…
Modular localization is the concise conceptual formulation of causal localization in the setting of local quantum physics. Unlike QM it does not refer to individual operators but rather to ensembles of observables which share the same…
Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed…
To remedy the failure of minimal coupling method in describing the quantum dynamics of two localized Brownian oscillators interacting with a common medium, a scheme is introduced to modeling the medium by a continuum of complex scalar…
Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows…
A family of quantum Hamiltonians is said to be universal if any other finite-dimensional Hamiltonian can be approximately encoded within the low-energy space of a Hamiltonian from that family. If the encoding is efficient, universal…
We consider a quantum particle constrained to a curved layer of a constant width built over an infinite smooth surface. We suppose that the latter is a locally deformed plane and that the layer has the hard-wall boundary. Under this…
A model of quantum computing is presented, based on properties of connections with a prescribed monodromy group on holomorphic vector bundles over bases with nontrivial topology. Such connections with required properties appear in the…
The full spectrum and eigenfunctions of the quantum version of a nonlinear oscillator defined on an N-dimensional space with nonconstant curvature are rigorously found. Since the underlying curved space generates a position-dependent…
In quantum computing, the computation is achieved by linear operators in or between Hilbert spaces. In this work, we explore a new computation scheme, in which the linear operators in quantum computing are replaced by (higher) functors…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field…
A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…
An infinite family of quasi-maximally superintegrable Hamiltonians with a common set of (2N-3) integrals of the motion is introduced. The integrability properties of all these Hamiltonians are shown to be a consequence of a hidden…
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…
A polynomial depth quantum circuit effects, by definition a poly-local unitary transformation of tensor product state space. It is a physically reasonable belief [Fy][L][FKW] that these are precisely the transformations which will be…
Feynman's prescription for a quantum simulator was to find a hamitonian for a system that could serve as a computer. P\'olya and Hilbert conjecture was to demonstrate Riemann's hypothesis through the spectral decomposition of hermitian…