相关论文: Universal quantum processors with arbitrary radix …

We have studied quantum systems on finite-dimensional Hilbert spaces and found that all these systems are connected through local transformations. Actually, we have shown that these transformations give rise to a gauge group that connects…

An active area of investigation in the search for quantum advantage is Quantum Machine Learning. Quantum Machine Learning, and Parameterized Quantum Circuits in a hybrid quantum-classical setup in particular, could bring advancements in…

We provide a universal construction of the category of finite-dimensional C*-algebras and completely positive trace-nonincreasing maps from the rig category of finite-dimensional Hilbert spaces and unitaries. This construction, which can be…

We present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work of Nielsen [quant-ph/0108020], who proposed a scheme in…

Universal properties of many-body systems in conformal quantum mechanics in arbitrary dimensions are presented. Specially, a general structure of discrete energy spectra and eigenstates is found. Finally, a simple construction of a…

We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are…

We use classes of Hilbert lattice equations for an alternative representation of Hilbert lattices and Hilbert spaces of arbitrary quantum systems that might enable a direct introduction of the states of the systems into quantum computers.…

The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…

We analyze and compare the optimality of approximate and probabilistic universal programmable quantum processors. We define several characteristics how to quantify the optimality and we study in detail performance of three types of…

There has been no lack of coverage in the past few years in scientific journals of the topic of quantum computation. Rightly so, as this is a novel idea with--so far--at least one very important practical application (prime factorisation)…

Programmable photonic quantum processors face a critical challenge: despite significant advances in quantum state preparation and manipulation, measurements remain limited to projective techniques. Here, we demonstrate a programmable…

We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states. This allows, for instance, the construction of a quantum computer based on just single qubit operations, Bell…

Quantum computer versus quantum algorithm processor in CMOS are compared to find (in parallel) all Hamiltonian cycles in a graph with m edges and n vertices, each represented by k bits. A quantum computer uses quantum states analogous to…

A logical qubit is a two-dimensional subspace of a higher dimensional system, chosen such that it is possible to detect and correct the occurrence of certain errors. Manipulation of the encoded information generally requires arbitrary and…

Many experimental proposals for noisy intermediate scale quantum devices involve training a parameterized quantum circuit with a classical optimization loop. Such hybrid quantum-classical algorithms are popular for applications in quantum…

This paper addresses the problem of designing universal quantum circuits to transform $k$ uses of a $d$-dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are…

An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only…

We study a sequence of quantum gates in finite-dimensional Hilbert spaces given by the normalized eigenvectors of the unitary operators. The corresponding sequence of the Hamilton operators is also given. From the Hamilton operators we…

We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…

Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…