Related papers: Quantum Simulation of Random Unitaries from Clebsc…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired…
We explore algorithmic aspects of a simply transitive commutative group action coming from the class field theory of imaginary hyperelliptic function fields. Namely, the Jacobian of an imaginary hyperelliptic curve defined over $\mathbb…
The quantum dynamics of a particle in the Modified P\"oschl-Teller potential is derived from the group $SL(2,R)$ by applying a Group Approach to Quantization (GAQ). The explicit form of the Hamiltonian as well as the ladder operators is…
Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases. Here we propose a simple and general framework for verifying unitary…
This paper proposes fast randomized algorithms for computing the Kronecker Tensor Decomposition (KTD). The proposed algorithms can decompose a given tensor into the KTD format much faster than the existing state-of-the-art algorithms. Our…
A key task in quantum computation is the application of a sequence of gates implementing a specific unitary operation. However, the decomposition of an arbitrary unitary operation into simpler quantum gates is a nontrivial problem. Here we…
We study the theory of projective representations for a compact quantum group $\mathbb{G}$, i.e. actions of $\mathbb{G}$ on $\mathcal{B}(H)$ for some Hilbert space $H$. We show that any such projective representation is inner, and is hence…
The notion of Fourier transform is among the more important tools in analysis, which has been generalized in abstract harmonic analysis to the level of abelian locally compact groups. The aim of this paper is to further generalize the…
We present a novel use case for quantum computation: the sensitivity analysis for a risk model used at Deutsche B\"orse Group. Such an analysis is computationally too expensive to perform on classical computers. We show in detail how the…
For each compact, simple, simply-connected Lie group and each integer level we construct a modular tensor category from a quotient of a certain subcategory of the category of representations of the corresponding quantum group. We determine…
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…
Simulating quantum many-body dynamics is important both for fundamental understanding of physics and practical applications for quantum information processing. Therefore, classical simulation methods have been developed so far.…
The construction of a class of unitary operators generating linear superpositions of generalized coherent states from the ground state of a quantum harmonic oscillator is reported. Such a construction, based on the properties of a new ad…
The aim of the paper is to create a link between the theory of reproducing kernel Hilbert spaces (RKHS) and the notion of a unitary representation of a group or of a groupoid. More specifically, it is demonstrated on one hand, how to…
Let $G$ be a second-countable, locally compact Hausdorff groupoid equipped with a Haar system. This paper investigates the weak containment of continuous unitary representations of groupoids. We show that both induction and inner tensor…
We consider topological groupoids in finite and also in a compact settings. In the initial sections, we introduce definitions of typical observables and we studied them in the context of statistical mechanics and quantum mechanics. We…
Let $\G$ be a locally compact group satisfying some technical requirements and $\wG$ its unitary dual. Using the theory of twisted crossed product $C^*$-algebras, we develop a twisted global quantization for symbols defined on $\G\times\wG$…
We present a hybrid quantum-classical algorithm to simulate thermal states of a classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one…
Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one can sometimes improve upon those results with optimized…
Many claims of computational advantages have been made for quantum computing over classical, but they have not been demonstrated for practical problems. Here, we present algorithms for solving time-dependent PDEs, with particular reference…