Related papers: TQFTs and quantum computing
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
We define Homotopy quantum field theories (HQFT) as Topological quantum field theories (TQFT) for manifolds endowed with extra structure in the form of a map into some background space X. We also build the category of homotopy cobordisms…
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 the context of Covariant Quantum Mechanics for a spin particle, we classify the ``quantum vector fields'', i.e. the projectable Hermitian vector fields of a complex bundle of complex dimension 2 over spacetime. Indeed, we prove that the…
Two of the major obstacles to achieve quantum computing (QC) are (i) scalability to many qubits and (ii) controlled connectivity between any selected qubits. Using Josephson charge qubits, here we propose an experimentally realizable method…
We show that a vector space valued TQFT constructed in work of De Renzi et al. [DGGPR23] extends naturally to a topological field theory which takes values in the symmetric monoidal category of linear cochains. Specifically, we consider a…
In the tradition of toy models of quantum mechanics in vector spaces over finite fields (e.g., Schumacher and Westmoreland's "modal quantum theory"), one finite field stands out, 2, since vectors over 2 have an interpretation as natural…
In the framework of Category Theory, we study the association between finite--dimensional representations of a compact quantum group and quantum vector bundles with linear connections for a given quantum principal bundle with a principal…
Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit…
We introduce a general method for building neural networks on quantum computers. The quantum neural network is a variational quantum circuit built in the continuous-variable (CV) architecture, which encodes quantum information in continuous…
Webs are combinatorial diagrams used to encode homomorphisms between representations of Lie (super)algebras and related objects. This paper extends the theory of webs to the quantum group of type Q. We define a monoidal supercategory of…
Quantum circuit complexity has played a central role in recent advances in holography and many-body physics. Within quantum field theory, it has typically been studied in a Lorentzian (real-time) framework. In a departure from standard…
There is a long history of representing a quantum state using a quasi-probability distribution: a distribution allowing negative values. In this paper we extend such representations to deal with quantum channels. The result is a convex,…
The first prototypes of quantum computers sparked interest in quantum computing and the basic principles of quantum mechanics. The education project on the physical bases of quantum computing is part of this context, based on the…
The one-way quantum computer (QCc) is a universal scheme of quantum computation consisting only of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. The computational model underlying the QCc is…
As shown by Abramsky and Coecke, quantum mechanics can be studied in terms of dagger compact closed categories with biproducts. Within this structure, many well-known quantum protocols can be described and their validity can be shown by…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
We derive the category-theoretic backbone of quantum theory from a process ontology. More specifically, we treat quantum theory as a theory of systems, processes and their interactions. In this first part of a three-part overview, we first…
We present some basic integer arithmetic quantum circuits, such as adders and multipliers-accumulators of various forms, as well as diagonal operators, which operate on multilevel qudits. The integers to be processed are represented in an…