Related papers: From reversible computation to quantum computation…
While quantum computing holds immense potential for tackling previously intractable problems, its current practicality remains limited. A critical aspect of realizing quantum utility is the ability to efficiently interface with data from…
We study the matrix models $\pi:C(S_N^+)\to M_N(C(X))$ which are flat, in the sense that the standard generators of $C(S_N^+)$ are mapped to rank 1 projections. Our first result is a generalization of the Pauli matrix construction at $N=4$,…
We introduce the novel class $(E_\alpha)_{\alpha \in [-\infty,1)}$ of reverse map projection embeddings, each one defining a unique new method of encoding classical data into quantum states. Inspired by well-known map projections from the…
Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…
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].
Leading logarithms (LLs) in massless non-renormalizable effective field theories (EFTs) can be computed with the help of non-linear recurrence relations. These recurrence relations follow from the fundamental requirements of unitarity,…
Infinite dimensional representations of the real form U_q(u_{n,1}) of the Drinfeld--Jimbo algebra U_q(gl_{n+1}) are defined. The principal series of representations of U_q(u_{n,1}) is studied. Intertwining operators for pairs of the…
We extend the classical Landau theory for rotating nuclei and show that the backbending in 162Yb, that comes about as a result of the two-quasiparticle alignment, is identified with the second order phase transition. We found that the…
The RSK correspondence is a bijection between permutations and pairs of standard Young tableaux with identical shape, where the tableaux are commonly denoted $P$ (insertion) and $Q$ (recording). It has been an open problem to demonstrate $$…
Machine learning tasks are an exciting application for quantum computers, as it has been proven that they can learn certain problems more efficiently than classical ones. Applying quantum machine learning algorithms to classical data can…
We review the geometrical formulation of Quantum Mechanics to identify, according to Klein's programme, the corresponding group of transformations. For closed systems, it is the unitary group. For open quantum systems, the semigroup of…
Reconfigurable quantum circuits are fundamental building blocks for the implementation of scalable quantum technologies. Their implementation has been pursued in linear optics through the engineering of sophisticated interferometers. While…
Hybrid systems where a quantum material strongly couples to a nonlocal cavity photon mode have emerged as a new frontier for controlling and probing quantum correlations, yet the structure and scaling of light-matter entanglement produced…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
A scheme of universal quantum computation on a chain of qubits is described that does not require local control. All the required operations, an Ising-type interaction and spatially uniform simultaneous one-qubit gates, are…
Linus Pauling contributions span structural biology, chemistry in its broadest definition, quantum mechanical theory, valence bond theory, and even nuclear physics. A principal tool developed and used by Pauling is Xray, and electron,…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
We study a class of representations of the Cuntz algebras O_N, N=2,3,..., acting on L^2(T) where T=R/2\pi Z. The representations arise in wavelet theory, but are of independent interest. We find and describe the decomposition into…
Let $S_n$ be the symmetric group of all permutations of $\{1, \cdots, n\}$ with two generators: the transposition switching $1$ with $2$ and the cyclic permutation sending $k$ to $k+1$ for $1\leq k\leq n-1$ and $n$ to $1$ (denoted by…