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

World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering

Entanglement-Based Quantum Computing By Diagrams Of States

Sara Felloni, G. Strini

Published Sep 23, 2009• 2 citations
Publisher

Abstract

We explore entanglement in composite quantum systems and how its peculiar properties are exploited in quantum information and communication protocols by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by quantum circuits. We present quantum diagrams of states for Bell states generation, measurements and projections, for dense coding and quantum teleportation, for probabilistic quantum machines designed to perform approximate quantum cloning and universal NOT and, finally, for quantum privacy amplification based on entanglement purification. Diagrams of states prove to be a useful approach to analyze quantum computations, by offering an intuitive graphic representation of the processing of quantum information. They also help in conceiving novel quantum computations, from describing the desired information processing to deriving the final implementation by quantum gate arrays.

DOI
10.5281/zenodo.1086070

Related papers

Evolution of Quantum Systems by Diagrams of States

Sara Felloni, Alberto Leporati, G. Strini

We explore the main processes involved in the evolution of general quantum systems by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by quantum circuits. We present quantum diagrams of states for representations of quantum states by density matrices, partial trace operations, density matrix purification and time-evolution by Kraus operators. Following these representations, we describe by diagrams of states the most general transformations related to singlequbit decoherence and errors. Diagrams of states prove to be a useful approach to analyze quantum computations, by offering an intuitive graphic representation of the processing of quantum information. They also help in conceiving novel quantum computations, from describing the desired information processing to deriving the final implementation by quantum gate arrays.

arXiv:0912.0026•Dec 1, 2009•2 citations

Diagrams of States in Quantum Information: an Illustrative Tutorial

Sara Felloni, Alberto Leporati, G. Strini

We present "Diagrams of States", a way to graphically represent and analyze how quantum information is elaborated during the execution of quantum circuits. This introductory tutorial illustrates the basics, providing useful examples of quantum computations: elementary operations in single-qubit, two-qubit and three-qubit systems, immersions of gates on higher dimensional spaces, generation of single and multi-qubit states, procedures to synthesize unitary, controlled and diagonal matrices. To perform the analysis of quantum processes, we directly derive diagrams of states from physical implementations of quantum circuits associated to the processes. Complete diagrams are then rearranged into simplified diagrams, to visualize the overall effects of computations. Conversely, diagrams of states help to conceive new quantum algorithms, by schematically describing desired manipulations of quantum information with intuitive diagrams and then by guessing the equivalent complete diagrams, from which the corresponding quantum circuit is obtained effortlessly. Related examples and analysis of complex algorithms will be provided in future works, for whose comprehension this first tutorial offers the necessary introduction.

arXiv:0904.2656•Apr 17, 2009•3 citations

A Graphic Representation of States for Quantum Copying Machines

Sara Felloni, G. Strini

The aim of this paper is to introduce a new graphic representation of quantum states by means of a specific application: the analysis of two models of quantum copying machines. The graphic representation by diagrams of states offers a clear and detailed visualization of quantum information's flow during the unitary evolution of not too complex systems. The diagrams of states are exponentially more complex in respect to the standard representation and this clearly illustrates the discrepancy of computational power between quantum and classical systems. After a brief introductive exposure of the general theory, we present a constructive procedure to illustrate the new representation by means of concrete examples. Elementary diagrams of states for single-qubit and two-qubit systems and a simple scheme to represent entangled states are presented. Quantum copying machines as imperfect cloners of quantum states are introduced and the quantum copying machines of Griffiths and Niu and of Buzek and Hillery are analyzed, determining quantum circuits of easier interpretation. The method has indeed shown itself to be extremely successful for the representation of the involved quantum operations and it has allowed to point out the characteristic aspects of the quantum computations examined.

arXiv:quant-ph/0609230•Sep 29, 2006•2 citations

The Study of Entangled States in Quantum Computation and Quantum Information Science

Hyeyoun Chung

This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many areas of theoretical quantum information science, including quantum error correction, quantum cryptography, and quantum algorithms. We first investigate the equivalence classes of a particular class of entangled states (known as graph states due to their association with mathematical graphs) under local operations. We prove that for graph states corresponding to graphs with neither cycles of length 3 nor 4, the equivalence classes can be characterized in a very simple way. We also present software for analyzing and manipulating graph states. We then study quantum error-correcting codes whose codewords are highly entangled states. An important area of investigation concerning QECCs is to determine which resources are necessary in order to carry out any computation on the code to an arbitrary degree of accuracy, while simultaneously maintaining a high degree of resistance to noise. We prove that transversal gates, which are designed to prevent the propagation of errors through a system, are insufficient to achieve universal computation on almost all QECCs. Finally, we study the problem of creating efficient quantum circuits for creating entangling measurements. Entangling measurements can be used to harness the apparent extra computing power of quantum systems by allowing us to extract information about the global, collective properties of a quantum state using local measurements. We construct explicit quantum circuits that create entangling measurements, and show that these circuits scale polynomially in the input parameters.

arXiv:0808.1546•Aug 11, 2008•0 citations

Manipulation of Entangled States for Quantum Information Processing

Sougato Bose, Susana F. Huelga, Daniel Jonathan +4 more

Entanglement manipulation, and especially Entanglement Swapping is at the heart of current work on quantum information processing, purification and quantum teleportation. We will discuss how it may be generalized to multiparticle systems and how this enables multi-user quantum cryptographic protocols to be developed. Our scheme allows us to establish multiparticle entanglement between particles which belong to distant users in a communication network through a prior distribution of Bell state singlets followed by local measurements. We compare our method for generating entanglement with existing schemes using simple quantum networks, and highlight the advantages and applications in cryptographic conferencing and in reading messages from more than one source through a single quantum measurement. We also discuss how entanglement leads to the idea of ‘telecloning’, in which a teleportation-like protocol can be found which reproduces the output of an optimal quantum cloning machine. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Kluwer Academic Publishers eBooks•Dec 19, 2005•3 citations

Simulation and Analysis of Bell States via Qiskit Quantum Circuits

Mounaim Hamdoune, Mohammed Daoud A

Abstract The visualization of qubit states plays a fundamental role in understanding quantum information processing. This study explores the use of the Bloch sphere as a geometrical tool for representing and interpreting single-qubit and two-qubit states. Using the Qiskit framework, we simulate quantum circuits to demonstrate the action of quantum gates and the generation of entangled states, such as Bell states. The effects of various gate operations on qubit orientation are analyzed in the Bloch sphere representation. Furthermore, we examine the matrix formalism of quantum states and provide a statistical analysis of measurement outcomes. This work bridges the gap between theoretical quantum mechanics and experimental simulation, offering insights for both educational and research purposes in quantum computing.

•Aug 26, 2025•0 citations
We explore entanglement in composite quantum systems and how its peculiar properties are exploited in quantum information and communication protocols by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by quantum circuits. We present quantum diagrams of states for Bell states generation, measurements and projections, for dense coding and quantum teleportation, for probabilistic quantum machines designed to perform approximate quantum cloning and universal NOT and, finally, for quantum privacy amplification based on entanglement purification. Diagrams of states prove to be a useful approach to analyze quantum computations, by offering an intuitive graphic representation of the processing of quantum information. They also help in conceiving novel quantum computations, from describing the desired information processing to deriving the final implementation by quantum gate arrays.
We explore the main processes involved in the evolution of general quantum systems by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by quantum circuits. We present quantum diagrams of states for representations of quantum states by density matrices, partial trace operations, density matrix purification and time-evolution by Kraus operators. Following these representations, we describe by diagrams of states the most general transformations related to singlequbit decoherence and errors. Diagrams of states prove to be a useful approach to analyze quantum computations, by offering an intuitive graphic representation of the processing of quantum information. They also help in conceiving novel quantum computations, from describing the desired information processing to deriving the final implementation by quantum gate arrays.
We present "Diagrams of States", a way to graphically represent and analyze how quantum information is elaborated during the execution of quantum circuits. This introductory tutorial illustrates the basics, providing useful examples of quantum computations: elementary operations in single-qubit, two-qubit and three-qubit systems, immersions of gates on higher dimensional spaces, generation of single and multi-qubit states, procedures to synthesize unitary, controlled and diagonal matrices. To perform the analysis of quantum processes, we directly derive diagrams of states from physical implementations of quantum circuits associated to the processes. Complete diagrams are then rearranged into simplified diagrams, to visualize the overall effects of computations. Conversely, diagrams of states help to conceive new quantum algorithms, by schematically describing desired manipulations of quantum information with intuitive diagrams and then by guessing the equivalent complete diagrams, from which the corresponding quantum circuit is obtained effortlessly. Related examples and analysis of complex algorithms will be provided in future works, for whose comprehension this first tutorial offers the necessary introduction.
The aim of this paper is to introduce a new graphic representation of quantum states by means of a specific application: the analysis of two models of quantum copying machines. The graphic representation by diagrams of states offers a clear and detailed visualization of quantum information's flow during the unitary evolution of not too complex systems. The diagrams of states are exponentially more complex in respect to the standard representation and this clearly illustrates the discrepancy of computational power between quantum and classical systems. After a brief introductive exposure of the general theory, we present a constructive procedure to illustrate the new representation by means of concrete examples. Elementary diagrams of states for single-qubit and two-qubit systems and a simple scheme to represent entangled states are presented. Quantum copying machines as imperfect cloners of quantum states are introduced and the quantum copying machines of Griffiths and Niu and of Buzek and Hillery are analyzed, determining quantum circuits of easier interpretation. The method has indeed shown itself to be extremely successful for the representation of the involved quantum operations and it has allowed to point out the characteristic aspects of the quantum computations examined.
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many areas of theoretical quantum information science, including quantum error correction, quantum cryptography, and quantum algorithms. We first investigate the equivalence classes of a particular class of entangled states (known as graph states due to their association with mathematical graphs) under local operations. We prove that for graph states corresponding to graphs with neither cycles of length 3 nor 4, the equivalence classes can be characterized in a very simple way. We also present software for analyzing and manipulating graph states. We then study quantum error-correcting codes whose codewords are highly entangled states. An important area of investigation concerning QECCs is to determine which resources are necessary in order to carry out any computation on the code to an arbitrary degree of accuracy, while simultaneously maintaining a high degree of resistance to noise. We prove that transversal gates, which are designed to prevent the propagation of errors through a system, are insufficient to achieve universal computation on almost all QECCs. Finally, we study the problem of creating efficient quantum circuits for creating entangling measurements. Entangling measurements can be used to harness the apparent extra computing power of quantum systems by allowing us to extract information about the global, collective properties of a quantum state using local measurements. We construct explicit quantum circuits that create entangling measurements, and show that these circuits scale polynomially in the input parameters.
Entanglement manipulation, and especially Entanglement Swapping is at the heart of current work on quantum information processing, purification and quantum teleportation. We will discuss how it may be generalized to multiparticle systems and how this enables multi-user quantum cryptographic protocols to be developed. Our scheme allows us to establish multiparticle entanglement between particles which belong to distant users in a communication network through a prior distribution of Bell state singlets followed by local measurements. We compare our method for generating entanglement with existing schemes using simple quantum networks, and highlight the advantages and applications in cryptographic conferencing and in reading messages from more than one source through a single quantum measurement. We also discuss how entanglement leads to the idea of ‘telecloning’, in which a teleportation-like protocol can be found which reproduces the output of an optimal quantum cloning machine. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Abstract The visualization of qubit states plays a fundamental role in understanding quantum information processing. This study explores the use of the Bloch sphere as a geometrical tool for representing and interpreting single-qubit and two-qubit states. Using the Qiskit framework, we simulate quantum circuits to demonstrate the action of quantum gates and the generation of entangled states, such as Bell states. The effects of various gate operations on qubit orientation are analyzed in the Bloch sphere representation. Furthermore, we examine the matrix formalism of quantum states and provide a statistical analysis of measurement outcomes. This work bridges the gap between theoretical quantum mechanics and experimental simulation, offering insights for both educational and research purposes in quantum computing.