Related papers: The mixed Schur transform: efficient quantum circu…
Using Penrose binor calculus for $SU(2)$ ($SL(2,C)$) tensor expressions, a graphical method for the connection representation of Euclidean Quantum Gravity (real connection) is constructed. It is explicitly shown that: {\it (i)} the recently…
Superconducting qubits have emerged as a leading platform for realizing quantum computers. Accurate modeling of these devices is essential for predicting performance, improving design, and optimizing control. Many modeling approaches…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
The scalar product of two vectors with $K$ real components can be computed using two quantum channels, that is, information transmission lines in the form of spin-1/2 XX chains. Each channel has its own $K$-qubit sender and both channels…
Continuous-variable (CV) quantum computing is a promising candidate for quantum computation because it can, even with one mode, utilize infinite-dimensional Hilbert spaces and can efficiently handle continuous values. Although photonic…
We present an approach to simulating quantum computation based on a classical model that directly imitates discrete quantum systems. Qubits are represented as harmonic functions in a 2D vector space. Multiplication of qubit representations…
This paper elucidates the dual structure of the Schr\"{o}dinger dynamics in two correlated stages: (1) We first derive the real-valued Schr\"{o}dinger equation from scratch without referring to classical mechanics, wave mechanics, nor…
The quantum Fourier transform and quantum wavelet transform have been cornerstones of quantum information processing. However, for non-stationary signals and anomaly detection, the Hilbert transform can be a more powerful tool, yet no prior…
The Schur-Weyl states belong to a special class of states with a symmetry described by two Young and Weyl tableaux. Representation of physical systems in Hilbert space spanned on these states enables to extract quantum information hidden in…
We adapt a recent advance in resource-frugal quantum signal processing - the Quantum Eigenvalue Transform with Unitary matrices (QET-U) - to explore non-unitary imaginary time evolution on early fault-tolerant quantum computers using…
Variational quantum algorithms dominate contemporary gate-based quantum enhanced optimisation, eigenvalue estimation and machine learning. Here we establish the quantum computational universality of variational quantum computation by…
Unitary Coined Discrete-Time Quantum Walks (UC-DTQW) constitute a universal model of quantum computation, meaning that any computation done by a general purpose quantum computer can either be done using the UC-DTQW framework. In the last…
Near-term quantum devices require wavefunction ans\"atze that are expressive while also of shallow circuit depth in order to both accurately and efficiently simulate molecular electronic structure. While unitary coupled cluster (e.g.,…
The spinor representation of spin-1/2 states can equally well be mapped to a single unit quaternion, yielding a new perspective despite the equivalent mathematics. This paper first demonstrates a useable map that allows Bloch-sphere…
We consider the Schroedinger operator on graphs and study the spectral statistics of a unitary operator which represents the quantum evolution, or a quantum map on the graph. This operator is the quantum analogue of the classical evolution…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
Variational algorithms require architectures that naturally constrain the optimization space to run efficiently. Geometric quantum machine learning achieves this goal by encoding group structure into parameterized quantum circuits to…
A generalized Hubbard-Stratonovitch transformation relating an integral over random unitary N times N matrices to an integral over Efetov's unitary sigma model manifold, is introduced. This transformation adapts the supersymmetry method to…
The whole Hilbert state space of an n-qubit spin system can be divided into (n+1) state subspaces according to the angular momentum theory of quantum mechanics. Here it is shown that any unknown state in such a state subspace, whose…
In quantum circuits, qubits and the quantum gates acting on them have traditionally been analysed using matrix algebra and Dirac notation. While powerful, these can be unintuitive for conceptual understanding and rapid problem solving. In…