Related papers: SU(d)-Symmetric Random Unitaries: Quantum Scrambli…
In recent years, the traditional notion of symmetry in quantum theory was expanded to so-called generalised or categorical symmetries, which, unlike ordinary group symmetries, may be non-invertible. This appears to be at odds with Wigner's…
We discuss here some aspects related to the symmetries of a quantum many-body problem when trying to treat it on a quantum computer. Several features related to symmetry conservation, symmetry breaking, and possible symmetry restoration are…
A novel algebraic topology approach to supersymmetry (SUSY) and symmetry breaking in quantum field and quantum gravity theories is presented with a view to developing a wide range of physical applications. These include: controlled nuclear…
According to a fundamental result in quantum computing, any unitary transformation on a composite system can be generated using so-called 2-local unitaries that act only on two subsystems. Beyond its importance in quantum computing, this…
Continuing the analysis in a unified scheme for treating generalized superselection sectors based upon the notion of selection criteria for states of relevance in quantum physics, we extend the Doplicher-Roberts superselection theory for…
QCD justification of SU(m/n) supergroups are shown to provide a basis for the existence of an approximate hadronic supersymmetry. Effective Hamiltonian of the relativistic quark model is derived, leading to hadronic mass formulae in…
This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…
SUSY partnership between singular potentials often breaks down. Via regularization it can be restored on certain ad hoc subspaces of Hilbert space [Das and Pernice, Nucl. Phys. B 561 (1999) 357]. Within the naturally complexified (so called…
Hybrid quantum-classical algorithms have begun to leverage quantum devices to efficiently represent many-electron wavefunctions, enabling early demonstrations of molecular simulations on real hardware. A key prerequisite for scalable…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
Symmetry adaptation, universality, and gate efficiency are central but often competing requirements in quantum algorithms for electronic structure and many-body physics. For example, fully symmetry-adapted universal operator pools typically…
The notion of a $U$-statistic for an $n$-tuple of identical quantum systems is introduced in analogy to the classical (commutative) case: given a selfadjoint `kernel' $K$ acting on $(\mathbb{C}^{d})^{\otimes r}$ with $r<n$, we define the…
Supersymmetric gauge models with local horizontal symmetries are known to generate large flavor changing neutral current effects induced by supersymmetry breaking D-terms. We show how the presence of a U(1) gauge symmetry solves this…
The role of quantum groups and braid groups in the description of Standard Model particles is discussed. Some recent results on the use of the quantum group $SU_q(3)$ as a flavour symmetry are reviewed and a connection between two…
The purpose of this paper is to introduce techniques of obtaining optimal ways to determine a d-level quantum state or distinguish such states. It entails designing constrained elementary measurements extracted from maximal abelian subsets…
Characterization of quantum processes is a preliminary step necessary in the development of quantum technology. The conventional method uses standard quantum process tomography, which requires $d^2$ input states and $d^4$ quantum…
Quantum algebras are a mathematical tool which provides us with a class of symmetries wider than that of Lie algebras, which are contained in the former as a special case. After a self-contained introduction to the necessary mathematical…
Pseudorandom unitaries (PRUs) are ensembles of efficiently implementable unitary operators that cannot be distinguished from Haar random unitaries by any quantum polynomial-time algorithm with query access to the unitary. We present a…
Quantum-inspired tensor networks algorithms have shown to be effective and efficient models for machine learning tasks, including anomaly detection. Here, we propose a highly parallelizable quantum-inspired approach which we call SMT-AD…
The properties of SU(1,1) SU(2),SU(2,1) and SU(3) have often been used in quantum optics. In this paper we demonstrate the use of these symmetries. The group properties of SU(1,1) SU(2), and SU(2,1) are used to find the transition…