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

Multipartite entanglement and quantum algorithms

Daniel Alsina Leal

Published Sep 18, 2017• 3 citations
OpenAlex

Abstract

Quantum information science has grown from being a very small subfield in the 70s until being one of the most dynamic fields in physics, both in fundamentals and applications. In the theoretical section, perhaps the feature that has attracted most interest is the notion of entanglement, the ghostly relation between particles that dazzled Einstein and has provided fabulous challenges to build a coherent interpretation of quantum mechanics. While not completely solved, we have today learned enough to feel less uneasy with this fundamental problem, and the focus has shifted towards its potential powerful applications. Entanglement is now being studied from different perspectives as a resource for performing information processing tasks.\n\n\t\t\t\t With bipartite entanglement being largely understood nowadays, many questions remain unanswered in the multipartite case. The first part of this thesis deals with multipartite entanglement in different contexts. In the first chapters it is studied within the whole corresponding Hilbert space, and we investigate several entanglement measures searching for states that maximize them, including violations of Bell inequalities. Later, focus is shifted towards hamiltonians that have entangled ground states, and we investigate entanglement as a way to establish a distance between theories and we study frustration and methods to efficiently solve hamiltonians that exhibit it.\n\n\t\t\t\t In the practical section, the most promised upcoming technological advance is the advent of quantum computers. In the 90s some quantum algorithms improving the performance of all known classical algorithms for certain problems started to appear, while in the 2000s the first universal computers of few atoms began to be built, allowing implementation of those algorithms in small scales. The D-Wave machine already performs quantum annealing in thousands of qubits, although some controversy over the true quantumness of its internal workings surrounds it. Many countries in the planet are devoting large amounts of money to this field, with the recent European flagship and the involvement of the largest US technological companies giving reasons for optimism.\n\n\t\t\t\t The second part of this thesis deals with some aspects of quantum computation, starting with the creation of the field of cloud quantum computation with the appearance of the first computer available to the general public through internet, which we have used and analysed extensively. Also small incursions in quantum adiabatic computation and quantum thermodynamics are present in this second part.

Related papers

Aspects of entanglement in multipartite and decaying systems

Marius Paraschiv

The study and characterisation of quantum entanglement represents an extended effort within the field of quantum information. This thesis addresses two problems. The first regards entanglement in open systems, where it’s more difficult to define a dichotomic (two outcome) observable due to population loss. The second problem concerns genuine multipartite entanglement, that is entanglement between many particles in states that cannot be separable with respect to any possible bipartition of a system.\nThe first chapter consists of an introduction to the basic elements of quantum mechanics and quantum information theory. We briefly describe a few historical facts about quantum mechanics and the study of entanglement, to help put things into perspective.\nThe second chapter is a detailed discussion of the neutral kaon system. These particles are produced in pairs and are described as a particle-antiparticle system. This system displays some unique properties like the violation of CP-symmetry, and shares some characteristics with other mesons, such as neutral particle oscillation and decay. This makes formulating Bell-type inequalities for them more difficult, but also provides the opportunity for new tests.\nThe third chapter continues with the presentation of an already existent effective formalism for performing Bell tests on neutral kaons. The essence of the formalism is a switch to the Heisenberg picture, transferring the time evolution and dependence on measurement directions to a so-called effective operator. This has many advantages, some of the most important being a proper normalization during population loss (due to decay), an easy application to\nthe case of multiple particles and the fact that it allows one to observe entanglement within the system for a relatively long amount of time. The final part presents a way to simulate neutral kaons with atomic systems, namely with Ytterbium isotopes and discuss what are the differences between these atomic systems and neutral kaons.\nThe second part of the thesis treats the problem of proving genuine multipartite entanglement from separable two-body marginals. For this, an introduction to semidefinite programming is necessary due to the fact that the problem under study can be formulated in terms of this method. We will briefly discuss linear and semidefinite programming as well as the concept of duality and provide some basic examples.\nThe formal description of this problem and previous results are provided in the fifth chapter. Our result shows that, through a cyclic iteration between two SDPs, one obtains states with the desired properties. Using this method we managed to go up to six qubit states for various configurations. From this we can construct higher-dimensional states having the same properties.

•Dec 6, 2016•0 citations

PhD thesis: Multipartite entanglement and quantum algorithms

Alsina, Daniel

PhD thesis dealing with various aspects of multipartite entanglement, such as entanglement measures, absolutely maximally entangled states, bell inequalities, entanglement spectrum and quantum frustration. Also some quantum algorithms run with the IBM quantum computer are covered, together with others applied to adiabatic quantum computation and quantum thermodynamics.

arXiv:1706.08318•Jun 26, 2017•1 citation

PhD thesis: Multipartite entanglement and quantum algorithms

Daniel Alsina Leal

PhD thesis dealing with various aspects of multipartite entanglement, such as entanglement measures, absolutely maximally entangled states, bell inequalities, entanglement spectrum and quantum frustration. Also some quantum algorithms run with the IBM quantum computer are covered, together with others applied to adiabatic quantum computation and quantum thermodynamics.

•Jun 26, 2017•3 citations

UNDAMENTALS OF INFORMATION AND COMPUTATION IN THE REALM OF THE QUANTA

John Henry Reina

Information is a physical. Physical systems register and process information. These facts generated enormus interest in the development of novel quantum tecnologies, especially because the construction of smaller electronic devices ultimately leads to a consideration of quantum mechanical effects in electronic and computer desingns. The notion of the classical bit of information theory was formally pushed into the realm of the quanta with the introduction of the quantum bit or qubit, in the seminal works of Deutsch (Deutsch, 1985) and Shor (Shor, 1994). They demostrated that, indeed, controlled multipartite qubit interference effects could provide the means for a radical new way of computing, allowing the computation of many intractable computational problems, such as the factoring of large number or exact simulation of large quantum systems. The field of experimental and theoretical research in quantum information and computation has emerged as very important player in the understanding of quantum phenomena the both the basic and technological levels. This has attracted the attention of numerous researchers with backgrounds ranging from computer science, mathematics and engineerin, to the physical sciences, and we now have an interdisciplinary field where great efforts are being made in order to build devices that allow the progressing of information at a quantum level. A concise introduction to the field of quantum information and quantum computation is presented. This stars with the bassic definitions of bits, quantum registers, through to the universal gate-set for building the universal quantum computer, from a quantum network model of computation. The work shows how two-qubit gates suffice for quantum computation, emphasing the power of the quantum circuit representation for entagling and disentagling quantum states. This leads to the “no-cloning theorem”, which leads us to many interesting applications, such as quantum cryptography. Two alternative approaches or performing quantum computation are also described i) the one-way or measurement based quantum computer method, and ii) holonomic or geometric quantum computation. Following this, quantum entaglement quantification is highlighted, particulary its usefulness as a communication resource, in order to describe some of its most celebrated practical applications to date: quantum teleportation, cryptography, dens coding, and data compression. Deutsch’s concept of quantum parallelism is enphasized in order to gain insight into the potential for efficiently solving certain classically intratable algorithms. A subject central to the field of QIP- quantum decoherence- is then introduced.. Possible ways to overcome it, in particular quantum error correction, are discussed. A descriptios of some of the currently available hardware of the practical implementation of quantum computation is provided with a discussion of the main physical quantum bits that are currently employed (or proposed) for a such a purpose.

Revista de la Academia Colombiana de Ciencias Exactas Físicas y Naturales•Dec 2, 2023•1 citation

Quantum Information Processing

David Peter Divincenzo

Quantum Information Science is a cross-disciplinary subject that has arisen in the last twenty years. It concerns itself with the consequences of our most complete description of the physical world (that is, quantum mechanics) for the reliable, secure, private, and rapid processing of information, both in communication and computation. While its invention is often ascribed to the famous theoretical physicist Richard Feynman in the 1980s, his contributions were only one of many that initiated the field around that time. While he perceived that new types of physical devices, in which the quantum laws of superposition and entanglement function at the logical level, could give new power in the simulation of quantum physics, it was others (Bennett, Brassard) who showed that the uncertainty principle led to fundamentally more secure ways of communicating secret messages. It was yet others (Deutsch, Vazirani) who understood that quantum theory defined a new kind of Turing machine, and that not only quantum physics simulations, but potentially many other computational problems, are sped up in this machine. And it was yet another (Shor) who found a simple, very fast algorithm for prime factorization. The word "qubit" was coined only in 1995. Its introduction is indicative of a new mindset that has developed in recent years for studying and using quantum systems. "Qubit" now stands for a durable paradigm that spans a very wide variety of fields. It thus has many sub-meanings: first, it is the basic abstract unit of information for workers ranging from optical communication engineers to NMR spectroscopists to black-hole theorists. Second, it is the name we now routinely give to physical two level systems, as they are realized by photons, atomic and ionic eigenlevels, electronic and nuclear spin, structural defects in solids, and circulating-current states of superconducting devices. Physics has long dealt with some of these two-level systems, but calling them qubits implies a whole suite of interrelated ideas and capabilities that we ascribe to these systems: the ability to precisely set, and to precisely measure, the quantum state of one unique specimen, to avoid its coupling with the environment while at the same time strongly and controllably coupling the qubits together, to exploit the resulting quantum entanglement as a resource for metrological, cryptographic, and computational tasks. Quantum Information is a very diverse subject pursued today in many different directions, by many hundreds of researchers internationally: In theoretical physics, it has enlivened and sharpened the understanding of efficient representations of entangled many-particle wavefunctions, and has provided the prospect of applications for new concepts such as anyons and majorana fermions. Information theorists has benefitted from having a rigorous extension of the basis of their field, in which classical information theory is subsumed into a greatly broader subject. Theoretical computer scientists continue the search for new quantum algorithms, and have used quantum concepts to prove new results about the classification of computational complexity. Coding theorists have had the new and subtle problem of quantum error correction to analyse and conquer. Most strikingly, the program of experimental physics has been influenced in many directions by Quantum Information Science. State-of-the-art optics experiments transmit quantum states over long distances and perform precision manipulations in single quanta (atomic ions, impurity spins, quantum dots) in the quest to have working quantum cyptography and quantum computing. Quantum Hall systems, and topological insulators, are being assiduously examined for new elementary excitations for use as qubits. In the course of ten years, superconducting devices have improved by over four orders of magnitude in their quantum coherence, a metric made precise by the ideas of quantum computing. [...] DiVincenzo, David

WORLD SCIENTIFIC (EUROPE) eBooks•May 5, 2026•0 citations

Quantum Information Science

Ramani Ramasamy, Thiruselvan Palusamy, A. Ramathilagam

In order to provide novel techniques for processing, storing, and transmitting information, the multidisciplinary field of quantum information science (QIS) integrates ideas from quantum physics [ 4 ] with information science. However, due to a number of events, including Peter Shor’s invention of quantum algorithms and the rise in interest in quantum computing, the history of QIS started to expand quickly in the early to middle 1990s. Peter Shor, a physicist and mathematician, developed the first quantum algorithm that could factor big numbers exponentially more rapidly than any classical algorithm in 1994. This finding triggered strong interest in quantum computing’s potential to tackle issues that are currently unsolvable for classical computers. Since then, QIS has advanced due to the development of novel quantum algorithms and enhancements in the hardware used for quantum computing. Understanding complex quantum phenomena like entanglement and superposition and developing novel strategies for utilizing them for information processing and communication are the core goals of QIS. Quantum bits (qubits) can exist in superpositions of 0 and 1 simultaneously, which enables far more efficient computation than classical bits, which can only be in one state or the other at a given time. Superposition is a key concept in quantum computing. In addition to superposition, entanglement, coherence, and quantum algorithms are other important QIS concepts. Entanglement is a key feature of quantum mechanics and has been observed experimentally in a wide range of physical systems, including photons, atoms, and superconducting qubits. Two particles can get entangled with one another through a phenomenon called entanglement in which their quantum states exhibit a high correlation. This indicates that even if two particles are separated by a considerable distance, modifying the state of one can change the state of the other. No matter how far away two separate particles are from one another when they are entangled, measuring the state of one particle immediately gives the state of another particle. It plays a central role in many quantum technologies, including quantum computing for solving complex problems that take classical computers a long time to solve, quantum cryptography for secure communications, quantum sensing for quantum properties of particles to enable more precise measurements, and quantum networking to improve communication and processing speed over both short and long distances. Quantum metrology methods use the principles of quantum mechanics to improve the accuracy of measurements in fields like gravity sensors, timekeeping, and frequency standards. Some of the benefits of QIS are enhanced computing power, improved communication, advanced cryptography, more precise scientific measurements, and better logistics optimization.

Chapman & Hall/CRC eBooks•Oct 1, 2024•6 citations
Quantum information science has grown from being a very small subfield in the 70s until being one of the most dynamic fields in physics, both in fundamentals and applications. In the theoretical section, perhaps the feature that has attracted most interest is the notion of entanglement, the ghostly relation between particles that dazzled Einstein and has provided fabulous challenges to build a coherent interpretation of quantum mechanics. While not completely solved, we have today learned enough to feel less uneasy with this fundamental problem, and the focus has shifted towards its potential powerful applications. Entanglement is now being studied from different perspectives as a resource for performing information processing tasks.\n\n\t\t\t\t With bipartite entanglement being largely understood nowadays, many questions remain unanswered in the multipartite case. The first part of this thesis deals with multipartite entanglement in different contexts. In the first chapters it is studied within the whole corresponding Hilbert space, and we investigate several entanglement measures searching for states that maximize them, including violations of Bell inequalities. Later, focus is shifted towards hamiltonians that have entangled ground states, and we investigate entanglement as a way to establish a distance between theories and we study frustration and methods to efficiently solve hamiltonians that exhibit it.\n\n\t\t\t\t In the practical section, the most promised upcoming technological advance is the advent of quantum computers. In the 90s some quantum algorithms improving the performance of all known classical algorithms for certain problems started to appear, while in the 2000s the first universal computers of few atoms began to be built, allowing implementation of those algorithms in small scales. The D-Wave machine already performs quantum annealing in thousands of qubits, although some controversy over the true quantumness of its internal workings surrounds it. Many countries in the planet are devoting large amounts of money to this field, with the recent European flagship and the involvement of the largest US technological companies giving reasons for optimism.\n\n\t\t\t\t The second part of this thesis deals with some aspects of quantum computation, starting with the creation of the field of cloud quantum computation with the appearance of the first computer available to the general public through internet, which we have used and analysed extensively. Also small incursions in quantum adiabatic computation and quantum thermodynamics are present in this second part.
The study and characterisation of quantum entanglement represents an extended effort within the field of quantum information. This thesis addresses two problems. The first regards entanglement in open systems, where it’s more difficult to define a dichotomic (two outcome) observable due to population loss. The second problem concerns genuine multipartite entanglement, that is entanglement between many particles in states that cannot be separable with respect to any possible bipartition of a system.\nThe first chapter consists of an introduction to the basic elements of quantum mechanics and quantum information theory. We briefly describe a few historical facts about quantum mechanics and the study of entanglement, to help put things into perspective.\nThe second chapter is a detailed discussion of the neutral kaon system. These particles are produced in pairs and are described as a particle-antiparticle system. This system displays some unique properties like the violation of CP-symmetry, and shares some characteristics with other mesons, such as neutral particle oscillation and decay. This makes formulating Bell-type inequalities for them more difficult, but also provides the opportunity for new tests.\nThe third chapter continues with the presentation of an already existent effective formalism for performing Bell tests on neutral kaons. The essence of the formalism is a switch to the Heisenberg picture, transferring the time evolution and dependence on measurement directions to a so-called effective operator. This has many advantages, some of the most important being a proper normalization during population loss (due to decay), an easy application to\nthe case of multiple particles and the fact that it allows one to observe entanglement within the system for a relatively long amount of time. The final part presents a way to simulate neutral kaons with atomic systems, namely with Ytterbium isotopes and discuss what are the differences between these atomic systems and neutral kaons.\nThe second part of the thesis treats the problem of proving genuine multipartite entanglement from separable two-body marginals. For this, an introduction to semidefinite programming is necessary due to the fact that the problem under study can be formulated in terms of this method. We will briefly discuss linear and semidefinite programming as well as the concept of duality and provide some basic examples.\nThe formal description of this problem and previous results are provided in the fifth chapter. Our result shows that, through a cyclic iteration between two SDPs, one obtains states with the desired properties. Using this method we managed to go up to six qubit states for various configurations. From this we can construct higher-dimensional states having the same properties.
Information is a physical. Physical systems register and process information. These facts generated enormus interest in the development of novel quantum tecnologies, especially because the construction of smaller electronic devices ultimately leads to a consideration of quantum mechanical effects in electronic and computer desingns. The notion of the classical bit of information theory was formally pushed into the realm of the quanta with the introduction of the quantum bit or qubit, in the seminal works of Deutsch (Deutsch, 1985) and Shor (Shor, 1994). They demostrated that, indeed, controlled multipartite qubit interference effects could provide the means for a radical new way of computing, allowing the computation of many intractable computational problems, such as the factoring of large number or exact simulation of large quantum systems. The field of experimental and theoretical research in quantum information and computation has emerged as very important player in the understanding of quantum phenomena the both the basic and technological levels. This has attracted the attention of numerous researchers with backgrounds ranging from computer science, mathematics and engineerin, to the physical sciences, and we now have an interdisciplinary field where great efforts are being made in order to build devices that allow the progressing of information at a quantum level. A concise introduction to the field of quantum information and quantum computation is presented. This stars with the bassic definitions of bits, quantum registers, through to the universal gate-set for building the universal quantum computer, from a quantum network model of computation. The work shows how two-qubit gates suffice for quantum computation, emphasing the power of the quantum circuit representation for entagling and disentagling quantum states. This leads to the “no-cloning theorem”, which leads us to many interesting applications, such as quantum cryptography. Two alternative approaches or performing quantum computation are also described i) the one-way or measurement based quantum computer method, and ii) holonomic or geometric quantum computation. Following this, quantum entaglement quantification is highlighted, particulary its usefulness as a communication resource, in order to describe some of its most celebrated practical applications to date: quantum teleportation, cryptography, dens coding, and data compression. Deutsch’s concept of quantum parallelism is enphasized in order to gain insight into the potential for efficiently solving certain classically intratable algorithms. A subject central to the field of QIP- quantum decoherence- is then introduced.. Possible ways to overcome it, in particular quantum error correction, are discussed. A descriptios of some of the currently available hardware of the practical implementation of quantum computation is provided with a discussion of the main physical quantum bits that are currently employed (or proposed) for a such a purpose.
Quantum Information Science is a cross-disciplinary subject that has arisen in the last twenty years. It concerns itself with the consequences of our most complete description of the physical world (that is, quantum mechanics) for the reliable, secure, private, and rapid processing of information, both in communication and computation. While its invention is often ascribed to the famous theoretical physicist Richard Feynman in the 1980s, his contributions were only one of many that initiated the field around that time. While he perceived that new types of physical devices, in which the quantum laws of superposition and entanglement function at the logical level, could give new power in the simulation of quantum physics, it was others (Bennett, Brassard) who showed that the uncertainty principle led to fundamentally more secure ways of communicating secret messages. It was yet others (Deutsch, Vazirani) who understood that quantum theory defined a new kind of Turing machine, and that not only quantum physics simulations, but potentially many other computational problems, are sped up in this machine. And it was yet another (Shor) who found a simple, very fast algorithm for prime factorization. The word "qubit" was coined only in 1995. Its introduction is indicative of a new mindset that has developed in recent years for studying and using quantum systems. "Qubit" now stands for a durable paradigm that spans a very wide variety of fields. It thus has many sub-meanings: first, it is the basic abstract unit of information for workers ranging from optical communication engineers to NMR spectroscopists to black-hole theorists. Second, it is the name we now routinely give to physical two level systems, as they are realized by photons, atomic and ionic eigenlevels, electronic and nuclear spin, structural defects in solids, and circulating-current states of superconducting devices. Physics has long dealt with some of these two-level systems, but calling them qubits implies a whole suite of interrelated ideas and capabilities that we ascribe to these systems: the ability to precisely set, and to precisely measure, the quantum state of one unique specimen, to avoid its coupling with the environment while at the same time strongly and controllably coupling the qubits together, to exploit the resulting quantum entanglement as a resource for metrological, cryptographic, and computational tasks. Quantum Information is a very diverse subject pursued today in many different directions, by many hundreds of researchers internationally: In theoretical physics, it has enlivened and sharpened the understanding of efficient representations of entangled many-particle wavefunctions, and has provided the prospect of applications for new concepts such as anyons and majorana fermions. Information theorists has benefitted from having a rigorous extension of the basis of their field, in which classical information theory is subsumed into a greatly broader subject. Theoretical computer scientists continue the search for new quantum algorithms, and have used quantum concepts to prove new results about the classification of computational complexity. Coding theorists have had the new and subtle problem of quantum error correction to analyse and conquer. Most strikingly, the program of experimental physics has been influenced in many directions by Quantum Information Science. State-of-the-art optics experiments transmit quantum states over long distances and perform precision manipulations in single quanta (atomic ions, impurity spins, quantum dots) in the quest to have working quantum cyptography and quantum computing. Quantum Hall systems, and topological insulators, are being assiduously examined for new elementary excitations for use as qubits. In the course of ten years, superconducting devices have improved by over four orders of magnitude in their quantum coherence, a metric made precise by the ideas of quantum computing. [...] DiVincenzo, David
In order to provide novel techniques for processing, storing, and transmitting information, the multidisciplinary field of quantum information science (QIS) integrates ideas from quantum physics [ 4 ] with information science. However, due to a number of events, including Peter Shor’s invention of quantum algorithms and the rise in interest in quantum computing, the history of QIS started to expand quickly in the early to middle 1990s. Peter Shor, a physicist and mathematician, developed the first quantum algorithm that could factor big numbers exponentially more rapidly than any classical algorithm in 1994. This finding triggered strong interest in quantum computing’s potential to tackle issues that are currently unsolvable for classical computers. Since then, QIS has advanced due to the development of novel quantum algorithms and enhancements in the hardware used for quantum computing. Understanding complex quantum phenomena like entanglement and superposition and developing novel strategies for utilizing them for information processing and communication are the core goals of QIS. Quantum bits (qubits) can exist in superpositions of 0 and 1 simultaneously, which enables far more efficient computation than classical bits, which can only be in one state or the other at a given time. Superposition is a key concept in quantum computing. In addition to superposition, entanglement, coherence, and quantum algorithms are other important QIS concepts. Entanglement is a key feature of quantum mechanics and has been observed experimentally in a wide range of physical systems, including photons, atoms, and superconducting qubits. Two particles can get entangled with one another through a phenomenon called entanglement in which their quantum states exhibit a high correlation. This indicates that even if two particles are separated by a considerable distance, modifying the state of one can change the state of the other. No matter how far away two separate particles are from one another when they are entangled, measuring the state of one particle immediately gives the state of another particle. It plays a central role in many quantum technologies, including quantum computing for solving complex problems that take classical computers a long time to solve, quantum cryptography for secure communications, quantum sensing for quantum properties of particles to enable more precise measurements, and quantum networking to improve communication and processing speed over both short and long distances. Quantum metrology methods use the principles of quantum mechanics to improve the accuracy of measurements in fields like gravity sensors, timekeeping, and frequency standards. Some of the benefits of QIS are enhanced computing power, improved communication, advanced cryptography, more precise scientific measurements, and better logistics optimization.