Related papers: Unified Framework for Matchgate Classical Shadows
We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different…
Interfacing quantum and classical processors is an important subroutine in full-stack quantum algorithms. The so-called "classical shadow" method efficiently extracts essential classical information from quantum states, enabling the…
Embedded random matrix ensembles are generic models for describing statistical properties of finite isolated quantum many-particle systems. For the simplest spinless fermion (or boson) systems with say $m$ fermions (or bosons) in $N$ single…
It is shown that there exists a mapping between the fermions of the Standard Model (SM) represented as braids in the Bilson-Thompson model, and a set of gates which can perform Universal Quantum Computation (UQC). This leads us to…
The observed replication of fermions in three families is undoubtedly a reflection of a deeper symmetry underlying the standard model. In this paper we investigate one very elementary possibility, that physics above the grand unification…
Classical shadow tomography has become a powerful tool in learning about quantum states prepared on a quantum computer. Recent works have used classical shadows to variationally enforce N-representability conditions on the 2-particle…
The little hierarchy between the GUT scale and the string scale may give us some hints that can be tested at the LHC. To achieve string-scale gauge coupling unification, we introduce additional vector-like particles. We require that these…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…
We consider a minimal non-supersymmetric $SO(10)$ Grand Unified Theory (GUT) model that can reproduce the observed fermionic masses and mixing parameters of the Standard Model. We calculate the scales of spontaneous symmetry breaking from…
We present elementary mappings between classical lattice models and quantum circuits. These mappings provide a general framework to obtain efficiently simulable quantum gate sets from exactly solvable classical models. For example, we…
Embedded random matrix ensembles are generic models for describing statistical properties of finite isolated interacting quantum many-particle systems. For the simplest spinless systems, with say $m$ particles in $N$ single particle states…
As quantum computing advances toward the late-NISQ and early fault-tolerant eras, scalable and platform-independent benchmarks are essential for quantifying computational capacity in a classically verifiable manner. We introduce two…
We present a finite-temperature canonical-ensemble determinant quantum Monte Carlo algorithm that enforces an exact fermion number and enables stable simulations of correlated lattice fermions. We propose a stabilized QR update that reduces…
We use our Clifford algebra technique, that is nilpotents and projectors which are binomials of the Clifford algebra objects $\gamma^a$ with the property $\{\gamma^a,\gamma^b\}_+ = 2 \eta^{ab}$, for representing quantum gates and quantum…
Finite Unified Theories (FUTs) are N=1 supersymmetric Grand Unified Theories that can be made all-loop finite, leading to a severe reduction of the free parameters. We review the investigation of FUTs based on SU(5) in the context of…
The stabiliser formalism plays a central role in quantum computing, error correction, and fault tolerance. Conversions between and verifications of different specifications of stabiliser states and Clifford gates are important components of…
Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classical methods are often inaccurate -- are critical to advancing…
Typical fermion algorithms require the computation (or sampling) of the fermion determinant. We focus instead on cluster algorithms which do not involve the determinant and involve a more physically relevant sampling of the configuration…
We study supersymmetric unified models with three fermion generations based on the gauge group $SO(10)$ and require Gauge-Yukawa Unification, i.e., a renormalization group invariant functional relationship among the gauge and Yukawa…
Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native…