Related papers: Quantum Simulation of Random Unitaries from Clebsc…
We demonstrate that a tensor product structure and optical analogy of quantum entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical analogy, we discuss…
Gaussian unitaries, generated by quadratic Hamiltonians, are fundamental in quantum optics and continuous-variable computing. Their structures correspond to symplectic (bosons) and orthogonal (fermions) groups, but physical realizations…
Grover's algorithm relies on the superposition and interference of quantum mechanics, which is more efficient than classical computing in specific tasks such as searching an unsorted database. Due to the high complexity of quantum…
Let $\mathcal{G}$ be a countably infinite group of unitary operators on a complex separable Hilbert space $H$. Let $X = \{x_{1},...,x_{r}\}$ and $Y = \{y_{1},...,y_{s}\}$ be finite subsets of $H$, $r < s$, $V_{0} = \bar{span}…
We introduce a method to perform imaginary time evolution in a controllable quantum system using measurements and conditional unitary operations. By performing a sequence of weak measurements based on the desired Hamiltonian constructed by…
Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group, one often resorts to $t$-designs. Unitary…
We explore a very simple distribution of unitaries: random (binary) phase -- Hadamard -- random (binary) phase -- random computational-basis permutation. We show that this distribution is statistically indistinguishable from random Haar…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
We show that the deformation theory of Fr\'echet algebras for actions of K\"ahlerian Lie groups developed by two of us, leads in a natural way to examples of non-compact locally compact quantum groups. This is achieved by constructing a…
We describe an efficient quantum algorithm for the quantum Schur transform. The Schur transform is an operation on a quantum computer that maps the standard computational basis to a basis composed of irreducible representations of the…
This work introduces a relative diffusion transformation (RDT) - a simple unitary transformation which acts in a subspace, localized by an oracle. Such a transformation can not be fulfilled on quantum Turing machines with this oracle in…
This paper serves as a source of examples of Rokhlin actions or locally representable actions of finite groups on C*-algebras satisfying a certain UHF-absorption condition. We show that given any finite group $G$ and a separable, unital…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…
The construction of unitary operator bases in a finite-dimensional Hilbert space is reviewed through a nonstandard approach combinining angular momentum theory and representation theory of SU(2). A single formula for the bases is obtained…
We attempt to reconstruct the irreducible unitary representations of the Banach Lie group $U_0(\H)$ of all unitary operators $U$ on a separable Hilbert space $\H$ for which $U-{\mathbb I}$ is compact, originally found by Kirillov and…
We present a quantum algorithm for European option pricing in finance, where the key idea is to work in the unary representation of the asset value. The algorithm needs novel circuitry and is divided in three parts: first, the amplitude…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
We discuss a generalization of Clifford algebras known as generalized Clifford algebras (in particular, ternary Clifford algebras). In these objects, we have a fixed higher-degree form (in particular, a ternary form) instead of a quadratic…
This paper gives new, efficient algorithms for approximate uniform sampling of contingency tables and integer partitions. The algorithms use the Burnside process, a general algorithm for sampling a uniform orbit of a finite group acting on…
We propose a method to solve the electronic Schr\"odinger equation for strongly correlated systems by applying a unitary transformation to reduce the complexity of the physical Hamiltonian. In particular, we seek a transformation that maps…