相关论文: Characterization of randomness in quantum circuits…
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group $S_\infty$ of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with…
We introduce and analyze a task that we call symmetrization, in which a state of a quantum system, associated with a symmetry group, is transformed by a random unitary operation to a symmetric state. Each element of the unitary ensemble is…
As a motivation, we first recall the possible connection of electric-magnetic duality to finiteness in N=1 super-Yang-Mills theories (SYM). Then, we present the criterion for all-order finiteness (i.e., vanishing of the beta-functions at…
We identify a \emph{universal functional form} that governs anticoncentration in random quantum circuits-one that holds across diverse circuit architectures and depths, and crucially remains valid even at finite system sizes and shallow…
Symmetry is a powerful tool for studying dynamics in QFT: it provides selection rules, constrains RG flows, and often simplifies analysis. Currently, our understanding is that the most general form of symmetry is described by categorical…
Symmetry is a cornerstone of much of mathematics, and many probability distributions possess symmetries characterized by their invariance to a collection of group actions. Thus, many mathematical and statistical methods rely on such…
The quantum mechanics of one degree of freedom exhibiting the exact conformal SL(2,R) symmetry is presented. The starting point is the classification of the unitary irreducible representations of the SL(2,R) group (or, to some extent, its…
Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later…
From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either…
We study the amount of interference in random quantum algorithms using a recently derived quantitative measure of interference. To this end we introduce two random circuit ensembles composed of random sequences of quantum gates from a…
We characterize the quantum gate fidelity in a state-independent manner by giving an explicit expression for its variance. The method we provide can be extended to calculate all higher order moments of the gate fidelity. Using these results…
It is pointed out that quantum states, in general, contain a new kind of orders that cannot be characterized by symmetry. A concept of quantum order is introduced to describe such orders. As two concrete examples, we discussed quantum…
(i) We point out that every local unitary circuit of depth smaller than the linear system size is easily distinguished from a global Haar random unitary if there is a conserved quantity that is a sum of local operators. This is always the…
We consider asymptotics of ratios of random characteristic polynomials associated with orthogonal polynomial ensembles. Under some natural conditions on the measure in the definition of the orthogonal polynomial ensemble we establish a…
We study a sequence of quantum gates in finite-dimensional Hilbert spaces given by the normalized eigenvectors of the unitary operators. The corresponding sequence of the Hamilton operators is also given. From the Hamilton operators we…
In this paper we study the asymptotic behavior of the maximum magnitude of a complex random polynomial with i.i.d. uniformly distributed random roots on the unit circle. More specifically, let $\{n_k\}_{k=1}^{\infty}$ be an infinite…
Variational algorithms require architectures that naturally constrain the optimization space to run efficiently. Geometric quantum machine learning achieves this goal by encoding group structure into parameterized quantum circuits to…
We analyze patterns of remnant discrete symmetries that arise from U(1)^N theories by spontaneous breaking. We describe a simple, geometrical way to understand these patterns and provide methods for identifying the discrete symmetries and…
In conventional circuit-based quantum computing architectures, the standard gate set includes arbitrary single-qubit rotations and two-qubit entangling gates. This choice is not always aligned with the native operations available in certain…
We study the formation of short-depth designs beyond the unitary group. We provide a range of results on several groups of broad interest in quantum information science: the Clifford group, the orthogonal group, the unitary symplectic…