Related papers: Designs from Local Random Quantum Circuits with SU…
We have generalized the well-known statement that the Clifford group is a unitary 3-design into symmetric cases by extending the notion of unitary design. Concretely, we have proven that a symmetric Clifford group is a symmetric unitary…
We summarize recent progress on the symmetric subtraction of the Non-Linear Sigma Model in $D$ dimensions, based on the validity of a certain Local Functional Equation (LFE) encoding the invariance of the SU(2) Haar measure under local left…
Variational Quantum Algorithms (VQAs) are a class of hybrid quantum-classical algorithms that leverage on classical optimization tools to find the optimal parameters for a parameterized quantum circuit. One relevant application of VQAs is…
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…
We establish connections between state tomography, pseudorandomness, quantum state synthesis, and circuit lower bounds. In particular, let $\mathfrak{C}$ be a family of non-uniform quantum circuits of polynomial size and suppose that there…
We develop a general perturbation theory for the local quantum uncertainty (LQU), a discord-type quantifier of nonclassicality based on the Wigner-Yanase skew information. Starting from a perturbed density matrix $\rho = \rho_0 +…
A novel family of exactly solvable quantum systems on curved space is presented. The family is the quantum version of the classical Perlick family, which comprises all maximally superintegrable 3-dimensional Hamiltonian systems with…
We propose a quantum algorithm for sampling from a solution of stochastic differential equations (SDEs). Using differentiable quantum circuits (DQCs) with a feature map encoding of latent variables, we represent the quantile function for an…
We show that a subset of the basis for the irreducible representations of a tensor-product SU(2) rotation forms a covariant approximate quantum error-correcting code with transversal U(1) logical gates. Generalizing previous work on…
Random quantum circuits continue to inspire a wide range of applications in quantum information science and many-body quantum physics, while remaining analytically tractable through probabilistic methods. Motivated by an interest in…
A typical quantum state with no symmetry can be realized by letting a random unitary act on a fixed state, and the subsystem entanglement spectrum follows the Laguerre unitary ensemble (LUE). For integer-spin time reversal symmetry, we have…
Unitary $k$-designs are probabilistic ensembles of unitary matrices whose first $k$ statistical moments match that of the full unitary group endowed with the Haar measure. In prior work, we showed that the automorphism group of classical…
The local number variance associated with a spherical sampling window of radius $R$ enables a classification of many-particle systems in $d$-dimensional Euclidean space according to the degree to which large-scale density fluctuations are…
Variational quantum algorithms hold great promise for unlocking the power of near-term quantum processors, yet high measurement costs, barren plateaus, and challenging optimization landscapes frequently hinder them. Here, we introduce…
Understanding how fast physical systems can resemble Haar-random unitaries is a fundamental question in physics. Many experiments of interest in quantum gravity and many-body physics, including the butterfly effect in quantum information…
While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…
According to Dyson's three fold way, from the viewpoint of global time reversal symmetry there are three circular ensembles of unitary random matrices relevant to the study of chaotic spectra in quantum mechanics. These are the circular…
In the current framework of Geometric Quantum Machine Learning, the canonical method for constructing a variational ansatz that respects the symmetry of some group action is by forcing the circuit to be equivariant, i.e., to commute with…
Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach…
We construct a quantum system of spherical spins with a continuous local symmetry. The model is exactly soluble in the thermodynamic limit and exhibits a number of interesting properties. We show that the local symmetry is spontaneously…