Related papers: Grassmann representation in qubit informatics and …
We introduce a unified Gaussian quantum operator representation for fermions and bosons. The representation extends existing phase-space methods to Fermi systems as well as the important case of Fermi-Bose mixtures. It enables simulations…
Key to realising quantum computers is minimising the resources required to build logic gates into useful processing circuits. While the salient features of a quantum computer have been shown in proof-of-principle experiments, difficulties…
Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g. (artificial) atoms or ions, admit encoding of more…
In quantum computation and information science, the geometrical representations based on the Bloch sphere representation for transformations of two state systems have been traditionally used. While this representation is very useful for the…
Simulating the dynamics of electrons and other fermionic particles in quantum chemistry, materials science, and high-energy physics is one of the most promising applications of fault-tolerant quantum computers. However, the overhead in…
We implement in systems of fermions the formalism of pseudoclassical paths that we recently developed for systems of bosons and show that quantum states of fermionic fields can be described, in the Heisenberg picture, as linear combinations…
A characterization of qubit quantum channels is introduced. In analogy to what happens in the context of Bosonic channels we exploit the possibility of representing the states of the system in terms of characteristic function. The latter…
A reasonable quantum information theory for fermions must respect the parity super-selection rule to comply with the special theory of relativity and the no-signaling principle. This rule restricts the possibility of any quantum state to…
This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any…
A quantum computing system is typically represented by a set of non-interacting (local) two-state systems - qubits. Many physical systems can naturally have more accessible states, both local and non-local. We show that the resulting…
It is apparent to anyone who thinks about it that, to a large degree, the basic concepts of Newtonian physics are quite intuitive, but quantum mechanics is not. My purpose in this talk is to introduce you to a new, much more intuitive way…
We analyze qubit channels by exploiting the possibility of representing two-level quantum systems in terms of characteristic functions. To do so, we use functions of non-commuting variables (Grassmann variables), defined in terms of…
We use our Clifford algebra technique, that is nilpotents and projectors which are binomials of the Clifford algebra objects $\gamma^a$ with the property $\{\gamma^a,\gamma^b\}_+ = 2 \eta^{ab}$, for representing quantum gates and quantum…
In this paper, we present the experimental realization of multi-qubit gates $% \Lambda_n(not) $ in macroscopic ensemble of three-qubit and four-qubit molecules. Instead of depending heavily on the two-bit universal gate, which served as the…
We provide evidence that quantum mechanics can be interpreted as a rational algorithm for finding the least complex description for the correlations in the outputs of sensors in a large array. In particular, by comparing the…
The Heisenberg representation of quantum operators provides a powerful technique for reasoning about quantum circuits, albeit those restricted to the common (non-universal) Clifford set H, S and CNOT. The Gottesman-Knill theorem showed that…
We put forward a strategy to encode a quantum operation into the unmodulated dynamics of a quantum network without the need of external control pulses, measurements or active feedback. Our optimization scheme, inspired by supervised machine…
Quantum computational logics represent a logical abstraction from the circuit-theory in quantum computation. In these logics formulas are supposed to denote pieces of quantum information (qubits, quregisters or mixtures of quregisters),…
In the paper an approach is presented allowing to model quantum logic circuits by electronic gates for discrete spatially modulated electromagnetic signals. The designed circuitry is for modeling low scale quantum nets of general design and…
Logical gates studied in quantum computation suggest a natural logical abstraction that gives rise to a new form of unsharp quantum logic. We study the logical connectives corresponding to the following gates: the Toffoli gate, the NOT and…