Related papers: Universal quantum computing based on monodromy rep…

The quantum mechanical formalism doesn't support our intuition, nor does it elucidate the key concepts that govern the behaviour of the entities that are subject to the laws of quantum physics. The arrays of complex numbers are kin to the…

Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…

Quantum computing, leveraging the principles of quantum mechanics, has been found to significantly enhance computational capabilities in principle, in some cases beyond classical computing limits. This paper explores quantum computing's…

Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…

In spite of their evident logical character, particle statistics symmetries are not among the inherently quantum features exploited in quantum computation. A difficulty may be that, being a constant of motion of a unitary evolution, a…

Measurement-based quantum computation has emerged from the physics community as a new approach to quantum computation where the notion of measurement is the main driving force of computation. This is in contrast with the more traditional…

The processing unit of a solid-state quantum computer consists in an array of coupled qubits, each locally driven with on-chip microwave lines that route carefully-engineered control signals to the qubits in order to perform logical…

In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be…

It has recently been observed that, in contrast to the classical case, holomorphic structures on line bundles over the quantum projective line are not uniquely determined by degree. We formulate a fixed-point-theoretic framework for the…

Quantum computing is currently gaining significant attention, not only from the academic community but also from industry, due to its potential applications across several fields for addressing complex problems. For any practical problem…

Quantum computers are a promising candidate to radically expand computational science through increased computing power and more effective algorithms. In particular quantum computing could have a tremendous impact in the field of quantum…

Different graphical calculi have been proposed to represent quantum computation. First the ZX- calculus [4], followed by the ZW-calculus [12] and then the ZH-calculus [1]. We can wonder if new Z*-calculi will continue to be proposed…

A noncommutative-geometric generalization of the theory of principal bundles is sketched. A differential calculus over corresponding quantum principal bundles is analysed. The formalism of connections is presented. In particular, operators…

We introduce the notion of quantum computational webs: These are quantum states universal for measurement-based computation which can be built up from a collection of simple primitives. The primitive elements - reminiscent of building…

We propose a quantum computer structure based on coupled asymmetric single-electron quantum dots. Adjacent dots are strongly coupled by means of electric dipole-dipole interactions enabling rapid computation rates. Further, the asymmetric…

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…

String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of…

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…

A geometric framework for describing quantum particles on a possibly curved background is proposed. Natural constructions on certain distributional bundles (`quantum bundles') over the spacetime manifold yield a quantum ``formalism'' along…

Measurement-based quantum computing is one of the most promising quantum computing models. Although various universal resource states have been proposed so far, it was open whether only two Pauli bases are enough for both of universal…