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

Teleportação de portas quânticas, entrelaçadores universais e conexões com a teoria dos números

F. V. Mendes

Published Feb 19, 2015• 0 citations
OpenAlex

Abstract

The present thesis can be divided in three parts: 1) Quantum gate teleportation; 2) Numerical search of universal entanglers; 3) Connections between quantum information and number theory. Regarding the quantum gate teleportation, a separability criterion of normal matrices is used to find the analytical conditions of the preservation of separability under conjugation. That analytical condition allowed to find the general formula of an element of $mathbb{C}^{4}$ Clifford group, as well to understand the\nrole of the basis of measurement in the quantum gate teleportation protocol. Considering the searching for universal entanglers, the same separability criterion of normal matrices was used as fitness function in a computational heuristics, in prder to find good candidates for universal entanglers in $mathbb{C}^{3} otimes mathbb{C}^{4}$ and $mathbb{C}^{4} otimes mathbb{C}^{4}$ Hilbert spaces. At last, in the connection of quantum information with the number theory, it is presented the study of the preparation and entanglement of several multi-qubit quantum states based in integer sequences, and the Riemannian quantum circuit, a quantum circuit whose eigenvalues are related to the zeros of the Riemann zeta function. The existence of such circuit proves that is always possible to construct a physical system related to a finite amount of zeros.

Related papers

Quantum gate teleportation, universal entanglers and connections with the number teory

F. V. Mendes

The present thesis can be divided in three parts: 1) Quantum gate teleportation; 2) Numerical search of universal entanglers; 3) Connections between quantum information and number theory. Regarding the quantum gate teleportation, a separability criterion of normal matrices is used to find the analytical conditions of the preservation of separability under conjugation. That analytical condition allowed to find the general formula of an element of $mathbb{C}^{4}$ Clifford group, as well to understand the role of the basis of measurement in the quantum gate teleportation protocol. Considering the searching for universal entanglers, the same separability criterion of normal matrices was used as fitness function in a computational heuristics, in prder to find good candidates for universal entanglers in $mathbb{C}^{3} otimes mathbb{C}^{4}$ and $mathbb{C}^{4} otimes mathbb{C}^{4}$ Hilbert spaces. At last, in the connection of quantum information with the number theory, it is presented the study of the preparation and entanglement of several multi-qubit quantum states based in integer sequences, and the Riemannian quantum circuit, a quantum circuit whose eigenvalues are related to the zeros of the Riemann zeta function. The existence of such circuit proves that is always possible to construct a physical system related to a finite amount of zeros.

•Jan 1, 2015•0 citations

Contribuições em teleportação de portas quânticas, algoritmos de busca quântica e processamento quântico de imagens

Paulo Sousa

This thesis presents, initially, an analysis of the teleportation protocol of two qubits quantum gates, which uses an four qubits entangled state as a resource. It will be shown that the set of four qubits pure states is divided into two classes: Class 1 and Class 2, which determine, respectively, the realization of a deterministic gate teleportation, or a probabilistic remote preparation. It is still shown that when there is additional information on search problems that are not applicable to a standard quantum search algorithm, it is possible to obtain better performance using a quantum algorithm in conjunction with a classical search algorithm. Finally, a new model of image representation in quantum states is proposed, the new model has a less complex preparation and recovery compared to the other models currently proposed and allows the processing of images in both gray and colored scales.

•Jun 29, 2018•0 citations

Estados parcialmente emaranhados em comunicação quântica

Raphael Fortes Infante Gomes

In this master s thesis we approach the entanglement between quantum states as a resource to be used in the transmission of quantum information, particularly in quantum teleportation. Our focus was directed toward the study of partially entangled quantum states, that is, states in which the entanglement degree is below the maximum value allowed by quantum mechanics, since they are more likely to be found in actual devices than maximally entangled states. We review the properties and concepts that characterize vectors and operators from the viewpoint of linear algebra to formally present the postulates of quantum mechanics. We introduced the notion of qubits and showed how these can be applied to computing tasks via quantum logic gates.We explained in details the main quantum teleportation protocols that originated the methods used in this work, highlighting the advantages and disadvantages of each one. We presented protocols with new arrangements and introduced techniques that have improved some of the known methods, providing for those alternatives relating to construction and architecture in the arrangement of the channels. We proved that the probability associated with a multiple teleportation of a single qubit through channels in series tends to the maximum limit for a special case. We showed that imperfect states can be corrected and that it is possible to transmit a single qubit or a pair of qubits using GHZ states and modification of Bell basis states. We discussed the relationship between the final success probability value and the bases and channels degree of entanglement for each method. We concluded the thesis with a general analysis of all protocols, highlighting the most efficient ones with arguments that include theoretical and practical viewpoints.

•Mar 16, 2012•0 citations

Entanglement, geometry and quantum computation

Mark R. Dowling

This thesis addresses a number of problems within the emerging field of quantum information science. Quantum information science can be said to encompass the more-established disciplines of quantum computation and quantum information, as well as rather more recent attempts to apply concepts, tools and techniques from these disciplines to gain greater understanding of quantum systems in general. The role of entanglement — non-classical correlation — has been of particular interest to date. Part I contributes to this later goal. In particular, we establish a connection between the energy of a many-body quantum system and the idea of an entanglement witness from the theory of mixed-state entanglement. This connection allows mathematical results about entanglement witnesses to be translated into physical results about many-body quantum systems, specifically energy and temperature thresholds for entanglement. For the case of two qubits we are able to establish fairly detailed results about the behaviour of entanglement with temperature. We also study entanglement in systems of indistinguishable particles, where even the question of which quantum states should be regarded as entangled has been the subject of much controversy. We aim to clarify this issue by applying Wiseman and Vaccaro’s notion of entanglement of particles to a number of wellunderstood model systems. We discuss the advantages of the entanglement of particles approach compared with other methods in common use. Finally, we study the operational meaning of superselection rules in quantum physics, in particular the connection to the existence or not of an appropriate reference frame. We propose an experiment that aims to exhibit a coherent superposition of an atom and a molecule, apparently in violation of the commonly-accepted particle-number superselection rule. This result sheds light on the entanglement of particles approach to entanglement of indistinguishable particles. Part II returns to a fundamental question at the heart of quantum computation and quantum information, namely: how many quantum gates are required to perform a particular quantum computation? In other words, how efficiently can a quantum computer solve a particular computational problem? We establish a connection between this question and the field of Riemannian geometry. Intuitively, optimal quantum circuits correspond to “free-falling” along the shortest path between two points in a curved space. This opens up the possibility of using Riemannian geometry to study quantum computation, a possibility that was previously unknown. We provide explicit calculations of all the basic geometric quantities associated with the space, and give some preliminary results of applying geometric ideas to quantum computing. Finally, we explore more generally the connection between optimal control and quantum circuit complexity, of which the Riemannian metric described above can be viewed as a special case.

•Jan 1, 2007•0 citations

Quantum simulation and a study of entanglement and its application in quantum teleportation

Hefeng Wang

This thesis contains four projects: entanglement and quantum phase transition in one-dimensional quantum dots system; entanglement and electron correlation in molecular systems; quantum teleportation in one-dimensional quantum dots system and simulation of molecular systems on a quantum computer. Chapter 1 presents a general introduction to quantum computing. A brief history and motivation for quantum computing is introduced. In Chapter 2, we studied the entanglement of an array of quantum dots system modeled by one-dimensional Hubbard Hamiltonian and the relation between quantum entanglement and quantum phase transition. In Chapter 3, entanglement in molecular systems is studied. It is proved that the full configuration interaction (FCI) wave function violates Bell’s inequality, thus it is entangled; while the Hartree-Fock (HF) wave function does not violate Bell’s inequality, so it is unentangled. Based on this, we studied the relation between quantum entanglement and electron correlation in molecular systems. We suggested that quantum entanglement might be used as an alternative way to measure electron correlation in molecular systems. The application of entanglement in an array of quantum dots system in quantum teleportation is studied in Chapter 4. We showed that the space-spin entanglement in the quantum dots system can be filtered to obtain pure spin (space) entanglement, and it can be used in quantum teleportation. We also showed that by selecting appropriate Hamiltonian for the C-NOT gate, the spin-based information can be transformed into charge-based information. The pulse sequence for realizing the C-NOT operation is given. In Chapter 5, we studied the simulation of molecular systems on a quantum computer. We proposed a quantum algorithm to solve the Schrödinger equation using the basis set method based on the multi-configuration self-consistent (MCSCF) wave function. By using this algorithm, the potential energy surfaces of molecules, even some complicated regions, can be studied more efficiently than if the simpler HF wave function was employed. This algorithm can give high success probability, almost deterministic results for ground state and excited states. A small increase in the number of configuration state functions in the MCSCF wave function can dramatically increase the success probability of the quantum algorithm. A multi-reference configuration interaction approach is suggested for the treatment of larger systems. We generalized this method to the finite element method and simulated a quantum system of one particle in Yukawa potential. We showed that numerical methods for solving differential equations can be implemented efficiently on a quantum computer.

•Jan 1, 2008•0 citations

Entanglement and Quantumness - New Numerical Approaches -

Fabian Bohnet-Waldraff

The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.

•Sep 29, 2017•0 citations
The present thesis can be divided in three parts: 1) Quantum gate teleportation; 2) Numerical search of universal entanglers; 3) Connections between quantum information and number theory. Regarding the quantum gate teleportation, a separability criterion of normal matrices is used to find the analytical conditions of the preservation of separability under conjugation. That analytical condition allowed to find the general formula of an element of mathbbC4mathbb{C}^{4}mathbbC4 Clifford group, as well to understand the\nrole of the basis of measurement in the quantum gate teleportation protocol. Considering the searching for universal entanglers, the same separability criterion of normal matrices was used as fitness function in a computational heuristics, in prder to find good candidates for universal entanglers in mathbbC3otimesmathbbC4mathbb{C}^{3} otimes mathbb{C}^{4}mathbbC3otimesmathbbC4 and mathbbC4otimesmathbbC4mathbb{C}^{4} otimes mathbb{C}^{4}mathbbC4otimesmathbbC4 Hilbert spaces. At last, in the connection of quantum information with the number theory, it is presented the study of the preparation and entanglement of several multi-qubit quantum states based in integer sequences, and the Riemannian quantum circuit, a quantum circuit whose eigenvalues are related to the zeros of the Riemann zeta function. The existence of such circuit proves that is always possible to construct a physical system related to a finite amount of zeros.
The present thesis can be divided in three parts: 1) Quantum gate teleportation; 2) Numerical search of universal entanglers; 3) Connections between quantum information and number theory. Regarding the quantum gate teleportation, a separability criterion of normal matrices is used to find the analytical conditions of the preservation of separability under conjugation. That analytical condition allowed to find the general formula of an element of mathbbC4mathbb{C}^{4}mathbbC4 Clifford group, as well to understand the role of the basis of measurement in the quantum gate teleportation protocol. Considering the searching for universal entanglers, the same separability criterion of normal matrices was used as fitness function in a computational heuristics, in prder to find good candidates for universal entanglers in mathbbC3otimesmathbbC4mathbb{C}^{3} otimes mathbb{C}^{4}mathbbC3otimesmathbbC4 and mathbbC4otimesmathbbC4mathbb{C}^{4} otimes mathbb{C}^{4}mathbbC4otimesmathbbC4 Hilbert spaces. At last, in the connection of quantum information with the number theory, it is presented the study of the preparation and entanglement of several multi-qubit quantum states based in integer sequences, and the Riemannian quantum circuit, a quantum circuit whose eigenvalues are related to the zeros of the Riemann zeta function. The existence of such circuit proves that is always possible to construct a physical system related to a finite amount of zeros.
This thesis presents, initially, an analysis of the teleportation protocol of two qubits quantum gates, which uses an four qubits entangled state as a resource. It will be shown that the set of four qubits pure states is divided into two classes: Class 1 and Class 2, which determine, respectively, the realization of a deterministic gate teleportation, or a probabilistic remote preparation. It is still shown that when there is additional information on search problems that are not applicable to a standard quantum search algorithm, it is possible to obtain better performance using a quantum algorithm in conjunction with a classical search algorithm. Finally, a new model of image representation in quantum states is proposed, the new model has a less complex preparation and recovery compared to the other models currently proposed and allows the processing of images in both gray and colored scales.
In this master s thesis we approach the entanglement between quantum states as a resource to be used in the transmission of quantum information, particularly in quantum teleportation. Our focus was directed toward the study of partially entangled quantum states, that is, states in which the entanglement degree is below the maximum value allowed by quantum mechanics, since they are more likely to be found in actual devices than maximally entangled states. We review the properties and concepts that characterize vectors and operators from the viewpoint of linear algebra to formally present the postulates of quantum mechanics. We introduced the notion of qubits and showed how these can be applied to computing tasks via quantum logic gates.We explained in details the main quantum teleportation protocols that originated the methods used in this work, highlighting the advantages and disadvantages of each one. We presented protocols with new arrangements and introduced techniques that have improved some of the known methods, providing for those alternatives relating to construction and architecture in the arrangement of the channels. We proved that the probability associated with a multiple teleportation of a single qubit through channels in series tends to the maximum limit for a special case. We showed that imperfect states can be corrected and that it is possible to transmit a single qubit or a pair of qubits using GHZ states and modification of Bell basis states. We discussed the relationship between the final success probability value and the bases and channels degree of entanglement for each method. We concluded the thesis with a general analysis of all protocols, highlighting the most efficient ones with arguments that include theoretical and practical viewpoints.
This thesis addresses a number of problems within the emerging field of quantum information science. Quantum information science can be said to encompass the more-established disciplines of quantum computation and quantum information, as well as rather more recent attempts to apply concepts, tools and techniques from these disciplines to gain greater understanding of quantum systems in general. The role of entanglement — non-classical correlation — has been of particular interest to date. Part I contributes to this later goal. In particular, we establish a connection between the energy of a many-body quantum system and the idea of an entanglement witness from the theory of mixed-state entanglement. This connection allows mathematical results about entanglement witnesses to be translated into physical results about many-body quantum systems, specifically energy and temperature thresholds for entanglement. For the case of two qubits we are able to establish fairly detailed results about the behaviour of entanglement with temperature. We also study entanglement in systems of indistinguishable particles, where even the question of which quantum states should be regarded as entangled has been the subject of much controversy. We aim to clarify this issue by applying Wiseman and Vaccaro’s notion of entanglement of particles to a number of wellunderstood model systems. We discuss the advantages of the entanglement of particles approach compared with other methods in common use. Finally, we study the operational meaning of superselection rules in quantum physics, in particular the connection to the existence or not of an appropriate reference frame. We propose an experiment that aims to exhibit a coherent superposition of an atom and a molecule, apparently in violation of the commonly-accepted particle-number superselection rule. This result sheds light on the entanglement of particles approach to entanglement of indistinguishable particles. Part II returns to a fundamental question at the heart of quantum computation and quantum information, namely: how many quantum gates are required to perform a particular quantum computation? In other words, how efficiently can a quantum computer solve a particular computational problem? We establish a connection between this question and the field of Riemannian geometry. Intuitively, optimal quantum circuits correspond to “free-falling” along the shortest path between two points in a curved space. This opens up the possibility of using Riemannian geometry to study quantum computation, a possibility that was previously unknown. We provide explicit calculations of all the basic geometric quantities associated with the space, and give some preliminary results of applying geometric ideas to quantum computing. Finally, we explore more generally the connection between optimal control and quantum circuit complexity, of which the Riemannian metric described above can be viewed as a special case.
This thesis contains four projects: entanglement and quantum phase transition in one-dimensional quantum dots system; entanglement and electron correlation in molecular systems; quantum teleportation in one-dimensional quantum dots system and simulation of molecular systems on a quantum computer. Chapter 1 presents a general introduction to quantum computing. A brief history and motivation for quantum computing is introduced. In Chapter 2, we studied the entanglement of an array of quantum dots system modeled by one-dimensional Hubbard Hamiltonian and the relation between quantum entanglement and quantum phase transition. In Chapter 3, entanglement in molecular systems is studied. It is proved that the full configuration interaction (FCI) wave function violates Bell’s inequality, thus it is entangled; while the Hartree-Fock (HF) wave function does not violate Bell’s inequality, so it is unentangled. Based on this, we studied the relation between quantum entanglement and electron correlation in molecular systems. We suggested that quantum entanglement might be used as an alternative way to measure electron correlation in molecular systems. The application of entanglement in an array of quantum dots system in quantum teleportation is studied in Chapter 4. We showed that the space-spin entanglement in the quantum dots system can be filtered to obtain pure spin (space) entanglement, and it can be used in quantum teleportation. We also showed that by selecting appropriate Hamiltonian for the C-NOT gate, the spin-based information can be transformed into charge-based information. The pulse sequence for realizing the C-NOT operation is given. In Chapter 5, we studied the simulation of molecular systems on a quantum computer. We proposed a quantum algorithm to solve the Schrödinger equation using the basis set method based on the multi-configuration self-consistent (MCSCF) wave function. By using this algorithm, the potential energy surfaces of molecules, even some complicated regions, can be studied more efficiently than if the simpler HF wave function was employed. This algorithm can give high success probability, almost deterministic results for ground state and excited states. A small increase in the number of configuration state functions in the MCSCF wave function can dramatically increase the success probability of the quantum algorithm. A multi-reference configuration interaction approach is suggested for the treatment of larger systems. We generalized this method to the finite element method and simulated a quantum system of one particle in Yukawa potential. We showed that numerical methods for solving differential equations can be implemented efficiently on a quantum computer.
The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.