Related papers: On the Pauli group on 2-qubits in dynamical system…
We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.
The realization of unitary designs is of fundamental interest in quantum science and typically requires the ability to implement structured quantum circuits. Recent developments have explored the possibility of generating unitary designs…
We discuss three applications of efficient quantum algorithms to determining properties of permutations and group automorphisms. The first uses the Bernstein-Vazirani algorithm to determine an unknown homomorphism from $Z_{p-1}^{m}$ to…
We introduce creation and annihilation operators of pseudo-Hermitian fermions for two-level systems described by pseudo-Hermitian Hamiltonian with real eigenvalues. This allows the generalization of the fermionic coherent states approach to…
Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work has constructed unitary designs and pseudorandom unitaries…
Discrete quantum groups were introduced as duals of compact quantum groups by Podle\'s and Woronowicz in 1990. They have been studied intrinsically by Effros and Ruan (1994) and by the author (1996). In a more recent note (2025), we have…
The Pauli exclusion principle in quantum mechanics has a profound influence on the structure of matter and on interactions between fermions. Almost 30 years ago it was predicted that the Pauli exclusion principle could lead to a suppression…
Learning about physical systems from quantum-enhanced experiments, relying on a quantum memory and quantum processing, can outperform learning from experiments in which only classical memory and processing are available. Whereas quantum…
Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of…
We employ quantum circuit learning to simulate quantum field theories (QFTs). Typically, when simulating QFTs with quantum computers, we encounter significant challenges due to the technical limitations of quantum devices when implementing…
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…
In classical and single-particle settings, non-trivial band topology always gives rise to robust boundary modes. For quantum many-body systems, however, multiple topological fermions are not always able to coexist, since Pauli exclusion…
A classical (or quantum) superintegrable system on an n-dimensional Riemannian manifold is an integrable Hamiltonian system with potential that admits 2n-1 functionally independent constants of the motion that are polynomial in the momenta,…
Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in…
Employing the quadratic fermionic Hamiltonians for the collective and internal subsystems with a linear coupling, we studied the role of fermionic statistics on the dynamics of the collective motion. The transport coefficients are discussed…
Motivated by thermodynamic considerations, we analyse the variation of the quantum mutual information on a unitary orbit of a bipartite system's state, with and without global constraints such as energy conservation. We solve the full…
We present the Quantum Paldus Transform: an efficient quantum algorithm for block-diagonalising fermionic, spin-free Hamiltonians in the second quantisation. Our algorithm implements an isometry between the occupation number basis of a…
Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms for studying the physical properties of such systems have been developed. While qubit-based quantum…
Let $\mathscr{O}_K$ be a 2-adic discrete valuation ring with perfect residue field $k$. We classify $p$-divisible groups and $p$-power order finite flat group schemes over $\mathscr{O}_K$ in terms of certain Frobenius module over…
Efficiently calculating the low-lying eigenvalues of Hamiltonians, written as sums of Pauli operators, is a fundamental challenge in quantum computing. While various methods have been proposed to reduce the complexity of quantum circuits…