Related papers: Quantum Computing with Superqubits
Quantum computers promise dramatic speed ups for many computational tasks. For large-scale quantum computation however, the inevitable coupling of physical qubits to the noisy environment imposes a major challenge for a real-life…
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…
The meaning of quantum group transformation properties is discussed in some detail by comparing the (co)actions of the quantum group with those of the corresponding Lie group, both of which have the same algebraic (matrix) form of the…
Well defined quantum field theory (QFT) for the electroweak force including quantum electrodynamics (QED) and the weak force is obtained by considering natural unitary representations of a group $K\subset U(2,2)$, where $K$ is locally…
In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…
We study a quantum computing system using microwave photons in transmission line resonators on a superconducting chip as qubits. We show that all control necessary for quantum computing can be implemented by coupling to Josephson devices on…
We analyze fermionic modes as fundamental entities for quantum information processing. To this end we construct a density operator formalism on the underlying Fock space and demonstrate how it can be naturally and unambiguously equipped…
We extend Einstein's hole argument into the quantum domain, and argue that quantum observables for quasiclassical superpositional states of gravitational fields require additional information to be well-defined, namely, relative positions…
We analyze a new scheme for quantum information processing, with superconducting charge qubits coupled through a cavity mode, in which quantum manipulations are insensitive to the state of the cavity. We illustrate how to physically…
Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…
We investigate supergroups with Grassmann parameters replaced by odd Clifford parameters. The connection with non-anticommutative supersymmetry is discussed. A Berezin-like calculus for odd Clifford variables is introduced. Fermionic…
We review a recently proposed SuperGeometric (SG) approach to Quantum Field Theories (QFTs) that allow for scalar-fermion field transformations in a manifestly reparameterisation covariant manner. By adopting natural choices for the…
Quantum computers with Kerr-nonlinear parametric oscillators (KPOs) have recently been proposed by the author and others. Quantum computation using KPOs is based on quantum adiabatic bifurcations of the KPOs, which lead to quantum…
In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of…
A nuclear physics example of the U(6/2) supersymmetry group is considered. It is shown that this group contains a supersymmetric subgroup with a structure similar to the SUSY model of the quantum field theory (QFT). A comparison of two…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…
This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models, within a range of alternative quantum bases. We focus on transitioning these states from the…
It is indicated that principal models of computation are indeed significantly related. The quantum field computation model contains the quantum computation model of Feynman. (The term "quantum field computer" was used by Freedman.) Quantum…
The operator algebra of fermionic modes is isomorphic to that of qubits, the difference between them is twofold: the embedding of subalgebras corresponding to mode subsets and multiqubit subsystems on the one hand, and the parity…