Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.27247

Designing tight frames for quantum computing

Luis Quezada

quant-phSubmitted Jul 28, 2026• Announced Jul 29, 2026• 0 citations
arXivHTMLPDF

Abstract

The aim of this thesis is to explore the implementation of a special kind of quantum measurements, so called harmonic tight frames. To achieve this goal, representation theory is addressed, emphasizing its construction from irreducible representations and the relations they satisfy. These tools simplify the study due to the existence of symmetries, leading to the concept of group frames, defined as orbits under the unitary action of a group and characterized by their symmetry groups. Among the various groups, the simplest are the abelian ones, giving rise to harmonic frames, which are analyzed through the classification theorem of abelian groups and the characters of their irreducible representations. In the quantum mechanics context, the frame elements can be interpreted as pure states of a system. Therefore, the necessary and sufficient conditions for separability are explored, as separable states are easier to implement due to their local nature. Alternatively, when viewing frames as measurements, the concept of POVMs and Naimark's theorem are studied as key tools for designing measurements in quantum computers. Using this knowledge, a characterization of the harmonic frames is given from the abelian group structure theorem, which allows obtaining a necessary and sufficient condition for their separability. The conditions of maximum entanglement of these states for bipartite systems are also studied, obtaining a necessary condition on the dimensions of the subsystems. Finally, a quantum circuit is obtained that allows implementing the harmonic frames associated to cyclic groups as POVMs using a Fourier matrix and a permutation matrix. We conclude by giving simple examples where the results are applied to quantum computers and proposing future avenues of research that could serve to improve the circuit design and extend it to the case of all harmonic frames.

Comments
Licenciatura thesis, Pontificia Universidad Católica de Chile, 2024. Advisor: Dardo Goyeneche. 65 pages

Related papers

Implementation of group-covariant positive operator valued measures by orthogonal measurements

Thomas Decker, Dominik Janzing, Martin Rötteler

We consider group-covariant positive operator valued measures (POVMs) on a finite dimensional quantum system. Following Neumark’s theorem a POVM can be implemented by an orthogonal measurement on a larger system. Accordingly, our goal is to find a quantum circuit implementation of a given group-covariant POVM which uses the symmetry of the POVM. Based on representation theory of the symmetry group we develop a general approach for the implementation of group-covariant POVMs which consist of rank-one operators. The construction relies on a method to decompose matrices that intertwine two representations of a finite group. We give several examples for which the resulting quantum circuits are efficient. In particular, we obtain efficient quantum circuits for a class of POVMs generated by Weyl–Heisenberg groups. These circuits allow to implement an approximative simultaneous measurement of the position and crystal momentum of a particle moving on a cyclic chain.

arXiv:quant-ph/0407054•Journal of Mathematical Physics•Dec 24, 2004•25 citations

Quantum Reference Frames and The Poincaré Symmetry

Oleg Kabernik

The concept of a reference frame has been a part of the physical formalism since the early days of physics. The reference frame was always understood as a physical system with respect to which states of other physical systems are described. With the adoption of quantum theory, our understanding of physical systems has fundamentally changed, yet we still rely on classical systems for the definition of reference frames. If we acknowledge the fact that all systems are quantum mechanical, including reference frames, then we have to be able to describe quantum systems relative to other quantum systems. \n \nIn this thesis we develop a framework for integrating quantum reference frames into the formalism of quantum mechanics. We show how the description of states and measurements has to be refined in order to account for the quantum nature of the reference frame. Initially, we study the implications of the new description with a quantum reference frame associated with a generic compact group. Then, we apply the same approach to the study of relativistic quantum reference frames associated with the Poincaré group, which is not compact. \n \nOur findings for the generic compact group include an analysis of how well a quantum system defines a frame of reference for other systems. Also in the generic case we analyze the effects of a measurement on a quantum reference frame. In the relativistic case we first find how the massive representations of the Poincaré group decompose into irreducible representations. This is a key problem in the analysis of quantum reference frames. Finally, we analyze a relativistic quantum reference frame that is used for measuring the total momentum. We will show how the relativistic measurements of total momentum should be described with respect to a quantum reference frame. We will also show how these measurements affect the quantum reference frame.

•Sep 19, 2014•2 citations

A Menagerie of Symmetry Testing Quantum Algorithms

Margarite L. LaBorde

In Chapter 1, we establish the mathematical background used throughout this thesis. We review concepts from group and representation theory. We further establish fundamental concepts from quantum information. This will allow us to then define the different notions of symmetry necessary in the following chapters. In Chapter 2, we investigate Hamiltonian symmetries. We propose quantum algorithms capable of testing whether a Hamiltonian exhibits symmetry with respect to a group. Furthermore, we show that this algorithm is that this algorithm is DQC1-Complete. Finally, we execute one of our symmetry-testing algorithms on existing quantum computers for simple examples. In Chapter 3, we discuss tests of symmetry for quantum states. For the case of testing Bose symmetry of a state, there is a simple and efficient quantum algorithm, while the tests for other kinds of symmetry rely on the aid of a quantum prover. We prove that the acceptance probability of each algorithm is equal to the maximum symmetric fidelity of the state being tested Finally, we establish various generalizations of the resource theory of asymmetry, with the upshot being that the acceptance probabilities of the algorithms are resource monotones. In Chapter 4, we begin by showing that the analytical form of the acceptance probability of such a test is given by the cycle index polynomial of the symmetric group ���� . We derive a family of quantum separability tests, each of which is generated by a finite group; for all such algorithms, we show that the acceptance probability is determined by the cycle index polynomial of the group. Finally, we produce and analyze explicit circuit constructions for these tests, showing that the tests corresponding to the symmetric and cyclic groups can be executed with ��(��2) and ��(�� log(��)) controlled-SWAP gates, respectively, where �� is the number of copies of the state In Chapter 5, we include additional results not previously published; in particular, we give a test for symmetry of a quantum state using density matrix exponentiation, a further result of Hamiltonian symmetry measurements when using Abelian groups, and an alternate Hamiltonian symmetry test construction for a block-encoded Hamiltonian.

arXiv:2305.14560•Civil War Book Review•Mar 7, 2023•1 citation

Frame-dependent coherence of a quantum state

Nicolae Cotfas

The tight frames can be regarded as a particular case of POVMs (positive operator-valued measures describing generalized measurements), namely the case when all the operators are rank-one. Each orthonormal basis is a tight frame, and every tight frame, after the embedding into a higher-dimensional space, is the orthogonal projection of an orthonormal basis. There exist several POVM-based definitions of coherence, and they are well-investigated. Our aim is to identify properties specific to the particular case of tight frames, and to look for some applications. All the POVM-based definitions use a Naimark extension. The frame-dependent coherence can be regarded as a particular case of POVM-based coherence, but it can be defined directly, without to use a Naimark extension. Its definition is a direct generalization of the basis-dependent ℓ 1 -norm of coherence, and it offers a more accurate description because we can use a frame containing several orthogonal bases. A quasi frame-independent definition of coherence for qubit systems is presented.

arXiv:2502.04178•Physics Letters A•Jun 26, 2025•0 citations

Quantum algorithms and the fourier transform

Lawrence Ip, Umesh V. Vazirani

The search for practical problems that can be solved exponentially faster on a quantum computer is one of the primary goals in research into algorithms for quantum computers. It has long been known that such speedups are only possible for highly structured problems. We consider two problems with algebraic structure: (1) the hidden subgroup problem, where we have an unknown subgroup, a function that is constant on cosets of the subgroup, and the task is to find the unknown subgroup; (2) the hidden shift problem, where we have an unknown element of a group, a function that has been shifted by that group element, and the task is to find the unknown group element. We show that the Fourier transform is intimately connected to both these problems. This is because the Fourier transform respects group symmetries. For the hidden subgroup problem, we introduce the idea of using information theoretic techniques to design quantum algorithms. This consists of first finding an optimal set of measurements for distinguishing between different subgroups, followed by attempts to implement this set of measurements. We show that the standard algorithm for the abelian hidden subgroup problem is optimal. For the nonabelian hidden subgroup problem, the optimal measurements respect the Fourier transform in that they can be implemented by first performing a Fourier transform on each coset state, measuring the name of the irreducible representation for each state, followed by a joint measurement over the resulting lower dimensional space. This shows that the “strong standard method” cannot be used to implement the optimal set of measurements. For some instances of the hidden shift problem, we give a quantum algorithms that are exponentially faster than the best known classical algorithm. The algorithms make use of the Fourier transform in a way that may be interpreted as solving a deconvolution problem. As evidence of hardness, we give a reduction from algebraically homomorphic cryptosystems to the shifted Legendre symbol problem. This is an example of a problem which admits an exponential quantum speedup yet is not an instance of the abelian hidden subgroup problem.

•Jan 1, 2004•0 citations

Algebraic and Mathematical Foundations of Quantum Computation: Hilbert Spaces, Group Structures, and Quantum Algorithms

Bhavesh B. Prajapati

Quantum computation is, at bottom, a branch of applied algebra and functional analysis: the state of a quantum register is a unit vector in a finite-dimensional complex Hilbert space, computation is the action of the unitary group on that space, and the structure of the most important quantum algorithms is dictated by the representation theory of finite and continuous groups. This paper develops the mathematical scaffolding of the field from first principles and uses it to explain why quantum computers can outperform classical ones. We review complex inner-product spaces, self-adjoint and unitary operators, the spectral theorem, and the tensor-product construction that gives rise to entanglement and the exponential dimension of the state space. We then describe the qubit and its geometry, the group-theoretic classification of quantum gates (the special unitary groups, the Pauli and Clifford groups, and their Lie-algebraic generators), and the universality results that justify finite gate sets together with the Solovay–Kitaev theorem. With this apparatus we analyse the quantum Fourier transform, phase estimation, and the hidden subgroup problem, showing how Shor’s factoring algorithm, Grover’s search, and the quantum linear-systems algorithm arise as instances of a small number of algebraic templates. Finally we treat the stabilizer formalism of quantum error correction—where finite abelian groups over GF(2) play the central role—and the variational, near-term (NISQ) algorithms that dominate current practice. Throughout, the emphasis is on the algebraic invariants that make quantum speed-ups possible.

Communications on Applied Nonlinear Analysis•Jan 24, 2025•0 citations
The aim of this thesis is to explore the implementation of a special kind of quantum measurements, so called harmonic tight frames. To achieve this goal, representation theory is addressed, emphasizing its construction from irreducible representations and the relations they satisfy. These tools simplify the study due to the existence of symmetries, leading to the concept of group frames, defined as orbits under the unitary action of a group and characterized by their symmetry groups. Among the various groups, the simplest are the abelian ones, giving rise to harmonic frames, which are analyzed through the classification theorem of abelian groups and the characters of their irreducible representations. In the quantum mechanics context, the frame elements can be interpreted as pure states of a system. Therefore, the necessary and sufficient conditions for separability are explored, as separable states are easier to implement due to their local nature. Alternatively, when viewing frames as measurements, the concept of POVMs and Naimark's theorem are studied as key tools for designing measurements in quantum computers. Using this knowledge, a characterization of the harmonic frames is given from the abelian group structure theorem, which allows obtaining a necessary and sufficient condition for their separability. The conditions of maximum entanglement of these states for bipartite systems are also studied, obtaining a necessary condition on the dimensions of the subsystems. Finally, a quantum circuit is obtained that allows implementing the harmonic frames associated to cyclic groups as POVMs using a Fourier matrix and a permutation matrix. We conclude by giving simple examples where the results are applied to quantum computers and proposing future avenues of research that could serve to improve the circuit design and extend it to the case of all harmonic frames.
We consider group-covariant positive operator valued measures (POVMs) on a finite dimensional quantum system. Following Neumark’s theorem a POVM can be implemented by an orthogonal measurement on a larger system. Accordingly, our goal is to find a quantum circuit implementation of a given group-covariant POVM which uses the symmetry of the POVM. Based on representation theory of the symmetry group we develop a general approach for the implementation of group-covariant POVMs which consist of rank-one operators. The construction relies on a method to decompose matrices that intertwine two representations of a finite group. We give several examples for which the resulting quantum circuits are efficient. In particular, we obtain efficient quantum circuits for a class of POVMs generated by Weyl–Heisenberg groups. These circuits allow to implement an approximative simultaneous measurement of the position and crystal momentum of a particle moving on a cyclic chain.
The concept of a reference frame has been a part of the physical formalism since the early days of physics. The reference frame was always understood as a physical system with respect to which states of other physical systems are described. With the adoption of quantum theory, our understanding of physical systems has fundamentally changed, yet we still rely on classical systems for the definition of reference frames. If we acknowledge the fact that all systems are quantum mechanical, including reference frames, then we have to be able to describe quantum systems relative to other quantum systems. \n \nIn this thesis we develop a framework for integrating quantum reference frames into the formalism of quantum mechanics. We show how the description of states and measurements has to be refined in order to account for the quantum nature of the reference frame. Initially, we study the implications of the new description with a quantum reference frame associated with a generic compact group. Then, we apply the same approach to the study of relativistic quantum reference frames associated with the Poincaré group, which is not compact. \n \nOur findings for the generic compact group include an analysis of how well a quantum system defines a frame of reference for other systems. Also in the generic case we analyze the effects of a measurement on a quantum reference frame. In the relativistic case we first find how the massive representations of the Poincaré group decompose into irreducible representations. This is a key problem in the analysis of quantum reference frames. Finally, we analyze a relativistic quantum reference frame that is used for measuring the total momentum. We will show how the relativistic measurements of total momentum should be described with respect to a quantum reference frame. We will also show how these measurements affect the quantum reference frame.
In Chapter 1, we establish the mathematical background used throughout this thesis. We review concepts from group and representation theory. We further establish fundamental concepts from quantum information. This will allow us to then define the different notions of symmetry necessary in the following chapters. In Chapter 2, we investigate Hamiltonian symmetries. We propose quantum algorithms capable of testing whether a Hamiltonian exhibits symmetry with respect to a group. Furthermore, we show that this algorithm is that this algorithm is DQC1-Complete. Finally, we execute one of our symmetry-testing algorithms on existing quantum computers for simple examples. In Chapter 3, we discuss tests of symmetry for quantum states. For the case of testing Bose symmetry of a state, there is a simple and efficient quantum algorithm, while the tests for other kinds of symmetry rely on the aid of a quantum prover. We prove that the acceptance probability of each algorithm is equal to the maximum symmetric fidelity of the state being tested Finally, we establish various generalizations of the resource theory of asymmetry, with the upshot being that the acceptance probabilities of the algorithms are resource monotones. In Chapter 4, we begin by showing that the analytical form of the acceptance probability of such a test is given by the cycle index polynomial of the symmetric group ���� . We derive a family of quantum separability tests, each of which is generated by a finite group; for all such algorithms, we show that the acceptance probability is determined by the cycle index polynomial of the group. Finally, we produce and analyze explicit circuit constructions for these tests, showing that the tests corresponding to the symmetric and cyclic groups can be executed with ��(��2) and ��(�� log(��)) controlled-SWAP gates, respectively, where �� is the number of copies of the state In Chapter 5, we include additional results not previously published; in particular, we give a test for symmetry of a quantum state using density matrix exponentiation, a further result of Hamiltonian symmetry measurements when using Abelian groups, and an alternate Hamiltonian symmetry test construction for a block-encoded Hamiltonian.
The tight frames can be regarded as a particular case of POVMs (positive operator-valued measures describing generalized measurements), namely the case when all the operators are rank-one. Each orthonormal basis is a tight frame, and every tight frame, after the embedding into a higher-dimensional space, is the orthogonal projection of an orthonormal basis. There exist several POVM-based definitions of coherence, and they are well-investigated. Our aim is to identify properties specific to the particular case of tight frames, and to look for some applications. All the POVM-based definitions use a Naimark extension. The frame-dependent coherence can be regarded as a particular case of POVM-based coherence, but it can be defined directly, without to use a Naimark extension. Its definition is a direct generalization of the basis-dependent ℓ 1 -norm of coherence, and it offers a more accurate description because we can use a frame containing several orthogonal bases. A quasi frame-independent definition of coherence for qubit systems is presented.
The search for practical problems that can be solved exponentially faster on a quantum computer is one of the primary goals in research into algorithms for quantum computers. It has long been known that such speedups are only possible for highly structured problems. We consider two problems with algebraic structure: (1) the hidden subgroup problem, where we have an unknown subgroup, a function that is constant on cosets of the subgroup, and the task is to find the unknown subgroup; (2) the hidden shift problem, where we have an unknown element of a group, a function that has been shifted by that group element, and the task is to find the unknown group element. We show that the Fourier transform is intimately connected to both these problems. This is because the Fourier transform respects group symmetries. For the hidden subgroup problem, we introduce the idea of using information theoretic techniques to design quantum algorithms. This consists of first finding an optimal set of measurements for distinguishing between different subgroups, followed by attempts to implement this set of measurements. We show that the standard algorithm for the abelian hidden subgroup problem is optimal. For the nonabelian hidden subgroup problem, the optimal measurements respect the Fourier transform in that they can be implemented by first performing a Fourier transform on each coset state, measuring the name of the irreducible representation for each state, followed by a joint measurement over the resulting lower dimensional space. This shows that the “strong standard method” cannot be used to implement the optimal set of measurements. For some instances of the hidden shift problem, we give a quantum algorithms that are exponentially faster than the best known classical algorithm. The algorithms make use of the Fourier transform in a way that may be interpreted as solving a deconvolution problem. As evidence of hardness, we give a reduction from algebraically homomorphic cryptosystems to the shifted Legendre symbol problem. This is an example of a problem which admits an exponential quantum speedup yet is not an instance of the abelian hidden subgroup problem.
Quantum computation is, at bottom, a branch of applied algebra and functional analysis: the state of a quantum register is a unit vector in a finite-dimensional complex Hilbert space, computation is the action of the unitary group on that space, and the structure of the most important quantum algorithms is dictated by the representation theory of finite and continuous groups. This paper develops the mathematical scaffolding of the field from first principles and uses it to explain why quantum computers can outperform classical ones. We review complex inner-product spaces, self-adjoint and unitary operators, the spectral theorem, and the tensor-product construction that gives rise to entanglement and the exponential dimension of the state space. We then describe the qubit and its geometry, the group-theoretic classification of quantum gates (the special unitary groups, the Pauli and Clifford groups, and their Lie-algebraic generators), and the universality results that justify finite gate sets together with the Solovay–Kitaev theorem. With this apparatus we analyse the quantum Fourier transform, phase estimation, and the hidden subgroup problem, showing how Shor’s factoring algorithm, Grover’s search, and the quantum linear-systems algorithm arise as instances of a small number of algebraic templates. Finally we treat the stabilizer formalism of quantum error correction—where finite abelian groups over GF(2) play the central role—and the variational, near-term (NISQ) algorithms that dominate current practice. Throughout, the emphasis is on the algebraic invariants that make quantum speed-ups possible.