Related papers: Extended quantum circuit diagrams
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
Expander graphs are fundamental in both computer science and mathematics, with a wide array of applications. With quantum technology reshaping our world, quantum expanders have emerged, finding numerous uses in quantum information theory,…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
In this report we present a general approach for estimating quantum circuits by means of measurements. We apply the developed general approach for estimating the quality of superconducting and optical quantum chips. Using the methods of…
Quantum computing has shown tremendous promise in addressing complex computational problems, yet its practical realization is hindered by the limited availability of qubits for computation. Recent advancements in quantum hardware have…
We introduce a graphical calculus for the representation theory of the quantized enveloping algebra of type $F_4$. We do this by giving a diagrammatic description of the category of invariant tensors on the 26-dimensional fundamental…
Reversible circuits for modular multiplication $Cx$%$M$ with $x<M$ arise as components of modular exponentiation in Shor's quantum number-factoring algorithm. However, existing generic constructions focus on asymptotic gate count and…
We derive the general circuit equations and system models directly from four Maxwell's equations and develop the electric-charge-based and magnetic-flux-based analysis methodologies to unify the analyses for both phase-independent circuits…
Quantum branching programs (quantum binary decision diagrams, respectively) are a convenient tool for examining quantum computations using only a logarithmic amount of space. Recently several types of restricted quantum branching programs…
In this paper an exponential multiplicative formula for the R-matrix is provided for the twisted affine quantum algebras.
Parameterized quantum circuits play a key role in quantum computing. Measuring the suitability of such a circuit for solving a class of problems is needed. One such promising measure is the expressivity of a circuit, which is defined in two…
We present a new model of quantum computation rooted in the representation theory of the mass less sector of unitary irreducible representations of the extended Poincare group developed in [1].
Circuit design for quantum machine learning remains a formidable challenge. Inspired by the applications of tensor networks across different fields and their novel presence in the classical machine learning context, one proposed method to…
This work presents an algorithm to generate depth, quantum gate and qubit optimized circuits for $GF(2^m)$ squaring in the polynomial basis. Further, to the best of our knowledge the proposed quantum squaring circuit algorithm is the only…
We discuss new ideas for consideration of loop diagrams and angular integrals in $D$-dimensions in QCD. In case of loop diagrams, we propose the covariant formalism of expansion of tensorial loop integrals into the orthogonal basis of…
This work provides a quantum-computing-first derivation of the Unitary Coupled Cluster ansatz, showing that its structure emerges naturally from fermionic algebra under unitary constraints. By explicitly connecting second quantization,…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
This work presents an optimization-based scalable quantum neural network framework for approximating $n$-qubit unitaries through generic parametric representation of unitaries, which are obtained as product of exponential of basis elements…
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…
How to calculate the exponential of matrices in an explicit manner is one of fundamental problems in almost all subjects in Science. Especially in Mathematical Physics or Quantum Optics many problems are reduced to this calculation by…