Related papers: Abelian Hypergroups and Quantum Computation
We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a…
The local Hamiltonian (LH) problem, the quantum analog of the classical constraint satisfaction problem, is a cornerstone of quantum computation and complexity theory. It is known to be QMA-complete, indicating that it is challenging even…
A class of pseudo-hermitian quantum system with an explicit form of the positive-definite metric in the Hilbert space is presented. The general method involves a realization of the basic canonical commutation relations defining the quantum…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
The Heisenberg representation of quantum operators provides a powerful technique for reasoning about quantum circuits, albeit those restricted to the common (non-universal) Clifford set H, S and CNOT. The Gottesman-Knill theorem showed that…
We propose a mathematically rigorous unified framework for hybrid quantum mechanics that systematically combines algebraic deformation and spatial non-locality within a single operator formalism. By constructing a self-adjoint hybrid…
We survey some of the main conceptual developments in the study of PT-symmetric and pseudo-Hermitian Hamiltonian operators that have taken place during the past ten years or so. We offer a precise mathematical description of a quantum…
Classifying symmetry groups which can be implemented in the scalar sector of a model with $N$ Higgs doublets is a difficult and an unsolved task for $N>2$. Here, we make the first step towards this goal by classifying the Abelian symmetry…
The formalism for non-Hermitian quantum systems sometimes blurs the underlying physics. We present a systematic study of the vielbein-like formalism which transforms the Hilbert space bundles of non-Hermitian systems into the conventional…
We achieve query-optimal quantum simulations of non-Hermitian Hamiltonians $H_{\mathrm{eff}} = H_R + iH_I$, where $H_R$ is Hermitian and $H_I \succeq 0$, using a bivariate extension of quantum signal processing (QSP) with non-commuting…
Important nonlinear dynamics, such as those found in plasma and fluid systems, are typically hard to simulate on classical computers. Thus, if fault-tolerant quantum computers could efficiently solve such nonlinear problems, it would be a…
We study the problem of transmission of information over classical and classical-quantum channels in the one-shot regime where the underlying codes are constrained to be group codes. In the achievability part, we introduce a new input…
Quantum computers promise to revolutionize our ability to simulate molecules, and cloud-based hardware is becoming increasingly accessible to a wide body of researchers. Algorithms such as Quantum Phase Estimation and the Variational…
An algebraic quantum group is a multiplier Hopf algebra with integrals. In this paper we will develop a theory of algebraic quantum hypergroups. It is very similar to the theory of algebraic quantum groups, except that the comultiplication…
These notes describe some links between the group $\mathrm{SL}_2(\mathbb{R})$, the Heisenberg group and hypercomplex numbers---complex, dual and double numbers. Relations between quantum and classical mechanics are clarified in this…
We design a quantum method for classical information compression that exploits the hidden subgroup quantum algorithm. We consider sequence data in a database with a priori unknown symmetries of the hidden subgroup type. We prove that data…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
How can we take inspiration from a typical quantum algorithm to design heuristics for machine learning? A common blueprint, used from Deutsch-Josza to Shor's algorithm, is to place labeled information in superposition via an oracle,…
This text is addressed to mathematicians who are interested in generalized functions and unbounded operators on a Hilbert space. We expose in detail (in a "formal way" - as done by Heisenberg and Pauli - i.e. without mathematical…
In this paper, a quantum computational framework for algebraic topology based on simplicial set theory is presented. This extends previous work, which was limited to simplicial complexes and aimed mostly to topological data analysis. The…