Related papers: From Qubits to Continuous-Variable Quantum Computa…
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…
The quantum properties of electromagnetic, mechanical or other harmonic oscillators can be revealed by investigating their strong coherent coupling to a single quantum two level system in an approach known as cavity quantum electrodynamics…
A quantum circuit is generalized to a nonunitary one whose constituents are nonunitary gates operated by quantum measurement. It is shown that a specific type of one-qubit nonunitary gates, the controlled-NOT gate, as well as all one-qubit…
By factorization of the Hamiltonian describing the quantum mechanics of the continuous q-Hermite polynomial, the creation and annihilation operators of the q-oscillator are obtained. They satisfy a q-oscillator algebra as a consequence of…
We consider continuous structures which are obtained from finite dimensional Hilbert spaces over $\mathbb{C}$ by adding some unitary operators. Quantum automata and circuits are naturally interpretable in such structures. We consider…
Quantum Variational Circuits (QVCs) are often claimed as one of the most potent uses of both near term and long term quantum hardware. The standard approaches to optimizing these circuits rely on a classical system to compute the new…
Instead of a quantum computer where the fundamental units are 2-dimensional qubits, we can consider a quantum computer made up of d-dimensional systems. There is a straightforward generalization of the class of stabilizer codes to…
A set of generators of generalized Pauli matrices play a crucial role in quantum computation based on n level systems of an atom. In this paper we show how to construct them by making use of Rabi oscillations. We also construct the…
Quantum computing promises to exploit the laws of quantum mechanics for processing information in ways fundamentally different from today's classical computers, leading to unprecedented efficiency. One-way quantum computation, sometimes…
Quantum machine learning (QML) seeks to exploit the intrinsic properties of quantum mechanical systems, including superposition, coherence, and quantum entanglement for classical data processing. However, due to the exponential growth of…
Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics can be harnessed and exploited. A number of models of quantum computation exist, including the now well-studied…
Quantum computing offers advantages over classical computation, yet the precise features that set the two apart remain unclear. In the standard quantum circuit model, adding a 1-qubit basis-changing gate -- commonly chosen to be the…
We propose a scalable qudit-based quantum processor using rotational states of polar molecules. Previously, molecular internal states were used to enlarge Hilbert space, whereas our approach uses optical tweezer arrays to achieve scalable…
We present a new approach to scalable quantum computing--a ``qubus computer''--which realises qubit measurement and quantum gates through interacting qubits with a quantum communication bus mode. The qubits could be ``static'' matter qubits…
Digital-analog quantum computing with two-level systems is a computational paradigm that combines an analog Hamiltonian with single-qubit gates to achieve universality. We extend this framework to $d$-level systems by conjugating an analog…
We use one photon to simulate an n-qubit quantum system for the first time. We propose a new scheme to realize universal quantum computation in polynomial time O(n^5). A generating set of gates can be realized with high accuracy in the lab.…
A universal programmable quantum processor uses program quantum states to apply an arbitrary quantum channel to an input state. We generalize the concept of a finite-dimensional programmable quantum processor to infinite dimension assuming…
We propose a method of compiling that permits to identify quantum circuits able to simulate arbitrary $n$-qubit unitary operations via the adjustment of angles in single-qubit gates therein. The method of compiling itself extends older…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
We propose a realization of quantum computing using polarized photons. The information is coded in two polarization directions of the photons and two-qubit operations are done using conditional Faraday effect. We investigate the performance…