Related papers: Quantum Gates from Wolfram Model Multiway Rewritin…
A corollary to the Reeh-Schlieder theorem is proved: that the time-ordered Vacuum Expectation Values and the S-matrix of a regularized Lagrangian quantum theory can be approximated by a local operator that uses nonlinear functionals of a…
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…
We generalize quantum circuits for the Toffoli gate presented by Selinger and Jones for functionally controlled NOT gates, i.e., $X$ gates controlled by arbitrary $n$-variable Boolean functions. Our constructions target the gate set…
Simulating a fermionic system on a quantum computer requires encoding the anti-commuting fermionic variables into the operators acting on the qubit Hilbert space. The most familiar of which, the Jordan-Wigner transformation, encodes…
Quantum gates are the fundamental instructions of digital quantum computers. Current programming languages, systems, and software development toolkits identify these operational gates by their titles, which requires a shared understanding…
In the holonomic approach to quantum computation information is encoded in a degenerate eigenspace of a parametric family of Hamiltonians and manipulated by the associated holonomic gates. These are realized in terms of the non-abelian…
The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. Here we study the structural properties of this group. We show that any Clifford operator can be uniquely…
We consider a spin-s Heisenberg model coupled to two-dimensional quantum gravity. We quantize the model using the Feynman path integral, summing over all possible two-dimensional geometries and spin configurations. We regularize this path…
Quantum compiling aims to construct a quantum circuit V by quantum gates drawn from a native gate alphabet, which is functionally equivalent to the target unitary U. It is a crucial stage for the running of quantum algorithms on noisy…
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact,…
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…
We obtained the Feynman propagators for a noncommutative (NC) quantum mechanics defined in the recently developed Doplicher-Fredenhagen-Roberts-Amorim (DFRA) NC background that can be considered as an alternative framework for the NC…
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations…
In the present paper, the first in a series of two, we propose a model of universal quantum computation using a fermionic/bosonic multi-particle continuous-time quantum walk with two internal states (e.g., the spin-up and down states of an…
Starting with the first-order singular Lagrangian describing the dynamical system with 2nd-class constraints, the noncommutative quantum mechanics on a curved space is investigated by the constraint star-product quantization formalism of…
This work proposes numerical tests which determine whether a two-qubit operator has an atypically simple quantum circuit. Specifically, we describe formulae, written in terms of matrix coefficients, characterizing operators implementable…
We propose a new formalism for quantum field theory which is neither based on functional integrals, nor on Feynman graphs, but on marked trees. This formalism is constructive, i.e. it computes correlation functions through convergent rather…
We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a…
We propose a theory of characterizing quantum circuits with qubit functional configurations. Any quantum circuit can be decomposed into alternating sequences of 1-qubit unitary gates and CNOT gates. Each CNOT sequence prepares the current…
We propose a scheme for data-driven parameterization of unresolved dimensions of dynamical systems based on the mathematical framework of quantum mechanics and Koopman operator theory. Given a system in which some components of the state…