Related papers: The Computational Complexity of Quantum Determinan…
The ``local'' structure of a quantum group G_q is currently considered to be an infinite-dimensional object: the corresponding quantum universal enveloping algebra U_q(g), which is a Hopf algebra deformation of the universal enveloping…
It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably…
The Quantum Fourier Transform (QFT) is a key component of many important quantum algorithms, most famously as being the essential ingredient in Shor's algorithm for factoring products of primes. Given its remarkable capability, one would…
Variational Quantum Algorithms (VQAs), such as the Variational Quantum Eigensolver (VQE) and the Quantum Approximate Optimization Algorithm (QAOA), are widely studied as candidates for near-term quantum advantage. Recent work has shown that…
We define a generalized $(q;\alpha,\beta,\gamma;\nu)$-deformed oscillator algebra and study the number of its characteristics. We describe the structure function of deformation, analyze the classification of irreducible representations and…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…
We investigate non-commutative differential calculus on the supersymmetric version of quantum space where the non-commuting super-coordinates consist of bosonic as well as fermionic (Grassmann) coordinates. Multi-parametric quantum…
The implementation of physical symmetries into problem descriptions allows for the reduction of parameters and computational complexity. We show the integration of the permutation symmetry as the most restrictive discrete symmetry into…
The dynamics of the nuclear-spin quantum computer with large number (L=1000) of qubits is considered using a perturbation approach, based on approximate diagonalization of exponentially large sparse matrices. Small parameters are introduced…
Important quantum algorithm routines allow the implementation of specific quantum operations (a.k.a. gates) by combining basic quantum circuits with an iterative structure. In this structure, the number of repetitions of the basic circuit…
Many quantum algorithms can be represented in a form of a classical circuit positioned between quantum Fourier transformations. Motivated by the search for new quantum algorithms, we turn to circuits where the latter transformation is…
Let us denote ${\cal V}$, the finite dimensional vector spaces of functions of the form $\psi(x) = p_n(x) + f(x) p_m(x)$ where $p_n(x)$ and $p_m(x)$ are arbitrary polynomials of degree at most $n$ and $m$ in the variable $x$ while $f(x)$…
The presence of symmetries, be they discrete or continuous, in a physical system typically leads to a reduction in the problem to be solved. Here we report that neither translational invariance nor rotational invariance reduce the…
Quantum computing provides a new way for approaching problem solving, enabling efficient solutions for problems that are hard on classical computers. It is based on leveraging how quantum particles behave. With researchers around the world…
The fractional q-calculus is the q-extension of the ordinary fractional calculus and dates back to early 20-th century. The theory of q-calculus operators are used in various areas of science such as ordinary fractional calculus, optimal…
We study the query complexity of quantum learning problems in which the oracles form a group $G$ of unitary matrices. In the simplest case, one wishes to identify the oracle, and we find a description of the optimal success probability of a…
A central result in the study of Quantum Hamiltonian Complexity is that the k-Local hamiltonian problem is QMA-complete. In that problem, we must decide if the lowest eigenvalue of a Hamiltonian is bounded below some value, or above…
A *-algebraic indefinite structure of quantum stochastic (QS) calculus is introduced and a continuity property of generalized nonadapted QS integrals is proved under the natural integrability conditions in an infinitely dimensional nuclear…
Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of computation. The quantum switch -- the simplest such example --…
We investigate a one-parameter family of quantum Harish-Chandra modules of U_q sl(2n). This family is an analog of the holomorphic discrete series of representations of the group SU(n,n) for the quantum group U_q su(n, n). We introduce a…