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
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.
The goal of this thesis is to examine some of the ways in which we might optimise the design of topological qubits. The topological operations which are imposed on qubits, in order to perform logic gates for topological quantum computations, are governed by the exchange group of the constituent particles. We examine representations of these exchange groups and investigate what restrictions their structure places on the effciency, reliability and universality of qubits (and multi-qubit systems) as a function of the number of particles composing them. Specific results are given for the limits placed on d-dimensional qudits where logic gates are imposed by braiding anyons in 2+1 dimensions. We also study qudits designed from ring-shaped, anyon-like excitations in 3+1 dimensions, where logic gates are implemented by elements of the loop braid group. We introduce the concept of local representations, where the generators of the loop braid group are defined to act non-trivially only on the local vector spaces associated with the rings which undergo the motion. We present a method for obtaining local representations of qudits and show how any such representation can be decomposed into representations which come from the quantum doubles of groups. Due to the dimension of the local representation being related to the number of generators, any non-Abelian properties of the representation are not compromised with an addition of extra operations, we conclude that universal representations may be easier to find than in previously discussed cases (though not for topological operations alone). We model a ring of Ising anyons in a fractional quantum Hall uid to study how interactions in a real environment may impact any qubits we have created. Fractional quantum Hall liquids are currently one of the most promising possibilities for the physical realisation of TQC and so present a natural choice of system in which to study these effects. We show how interactions between the anyons compromise the practicality of qubits defined by the fusion channels of anyon pairs and explore the use of the fermion number parity sectors as qubit states. Interactions between the anyon ring and the edge of the liquid are modelled to study the effect they will have on the state of the qubit. We perform numerical simulations, for a small system, to give some indication of how the edge interaction will in uence the reliability of the qubit.
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.
Employing internal quantum systems as reference frames is a crucial concept in quantum gravity, gauge theories, and quantum foundations whenever external relata are unavailable. In this work, we give a comprehensive and self-contained treatment of such quantum reference frames (QRFs) for the case when the underlying configuration space is a finite Abelian group, significantly extending our previous work [M. Krumm, P. A. Höhn, and M. P. Müller, Quantum 5, 530 (2021)]. The simplicity of this setup admits a fully rigorous quantum information–theoretic analysis, while maintaining sufficient structure for exploring many of the conceptual and structural questions also pertinent to more complicated setups. We exploit this to derive several important structures of constraint quantization with quantum information–theoretic methods and to reveal the relation between different approaches to QRF covariance. In particular, we characterize the “physical Hilbert space”—the arena of the “perspective-neutral” approach—as the maximal subspace that admits frame-independent descriptions of purifications of states. We then demonstrate the kinematical equivalence and, surprising, dynamical inequivalence of the “perspective-neutral” and the “alignability” approach to QRFs. While the former admits unitaries generating transitions between arbitrary subsystem relations, the latter, remarkably, admits no such dynamics when requiring symmetry-preservation. We illustrate these findings by example of interacting discrete particles, including how dynamics can be described “relative to one of the subystems.”
One of the most important questions in quantum information theory is the so-called separability problem. It involves characterizing the set of separable (or, equivalently entangled) states among mixed states of a multipartite quantum system. In this thesis we study the generalization of this problem to types of quantum correlations that are defined in a manner analogous to entanglement. We start with the subset of set of pure states of a given quantum system and call states belonging to the convex hull of this subset "non-correlated" states. Consequently, the states laying outside the convex hull are referred to as "correlated". In this work we focus on cases when there exist a symmetry group that preserves the class of "non-correlated" pure states. The presence of symmetries allows to obtain a unified treatment of many types of seemingly unrelated types of correlations. We apply our general results to particular types of correlations: (i) entanglement of distinguishable particles, (ii) particle entanglement of bosons, (iii) "entanglement" of fermions, (iv) non-convex-Gaussian correlations in fermionic systems, (v) genuine multiparty entanglement, and finally (vi) refined notions of bipartite entanglement based on the concept of the Schmidt number. We investigate the natural problems and questions concerning the correlations defined above: (I) We provide explicit polynomial characterization of various types of correlations for pure states. (II) We examine cases in which it is possible to give a complete analytical characterization of correlated mixed states. (III) We derive a variety of polynomial criteria for detection of correlations in mixed states.(IV) We use the above criteria and the technique of measure concentration to study typical properties of correlations on sets of isospectral density matrices.
Abstract Protocols for quantum measurement are an essential part of quantum computing. Measurements are no longer confined to the final step of computation but are increasingly embedded within quantum circuits as integral components of noise-resilient algorithms. However, each observable typically requires a distinct measurement basis, often demanding a different circuit configuration. As the number of such configurations typically grows with the number of qubits, measurements constitute a major bottleneck. Focusing on electronic structure calculations in crystalline systems, we propose a measurement protocol that restricts the required measurement configurations to an absolute minimum of just three, independent of the number of qubits. This makes it one of the few known protocols that do not scale with qubit number. In particular, we derive the measurement protocol from the symmetries of tight-binding (TB) Hamiltonians and implement it within the Orthogonal-Ansatz variational quantum eigensolver algorithm. We demonstrate its performance on three systems, namely a two-dimensional CuO 2 square lattice (3 qubits), bilayer graphene with hexagonal (Honeycomb) lattice (4 qubits) and three-dimensional diamond lattice (10 qubits). Beyond TB systems, the protocol can be extended to enable efficient initial state preparation for many-body Hamiltonians, such as multi-orbital Hubbard models in a momentum space.
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.