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

International Symposium on Distributed Computing and Applications for Business Engineering and Science (DCABES)

Calculation of Quantum Entanglement

Jingshui Yu, Wenbo Xu

Published Oct 1, 2011• 0 citations
Publisher

Abstract

Quantum entanglement which is used as the basis for such applications as quantum cryptography, quantum teleportation, and quantum computing, is a multifaceted property that has attracted much attention. The calculation of quantum entanglement therefore has become important. But the calculation of entanglement has become much more complex as systems that use entanglement have evolved. Based on the relative entropy of entanglement, a general method was developed for the calculation of entanglement for n-qubit or n-qudit system, which using an optimization algorithm technique such as genetic algorithm or Quantum-behaved Particle Swarm Optimization. The method using different optimization algorithm was tested on a two qubit system, for which there are some known points, and compared to exact calculations using the entanglement of formation and with each other. Advantages and disadvantages of the method are discussed and directions of future research are exposed.

DOI
10.1109/dcabes.2011.27

Related papers

Quantum Entanglement Information Entropy Calculation and Optimization

Jincheng Zhang

This paper explores the application of quantum entanglement to the calculation and optimization of information entropy. Traditional methods for entropy calculation often rely on classical computation, which is insufficient for analyzing complex quantum systems. We propose a novel approach utilizing the unique properties of entangled states to precisely compute information entropy and provide optimization algorithms for quantum information processing and quantum computation. The core mechanism centers around the conceptualization of "quantum entanglement information entropy" and its integration with entropy calculations, offering a potential pathway to enhanced performance in quantum systems. This research investigates the potential of leveraging entangled states to achieve more efficient computations, addressing limitations of classical methods in the context of quantum information.

•Sep 6, 2026•0 citations

A General Method for Designing n-Qubits Entanglement Creating Circuits and its Application in Different 4-qubits Entanglement Creating Circuits

Mohammed J. Mohammed, Mezher B. Saleh, Ismaeel Al-Baidhany

Abstract One of the most important aspects of quantum computation is quantum entanglement, it is an interesting feature of quantum physics, and has many important applications such as quantum teleportation, cryptography, quantum computation, and dense coding. It is an essential task in quantum computing to design circuits that create an entangled system, and many circuits were implied in the quantum computers that generate the desired entangled state of a system. In this paper, we suggest a general method to design different quantum circuits that produce an entangled system for any number of qubits in different manners. Also, we apply the suggested method in order to design different 4-qubits entanglement creating circuits. The results show that it is possible to design different entanglement creating circuits for any number of qubits by following certain method that will be discussed in the paper, and in the case of 4-qubits system we are going to look only at two circuits, the first creates a “GHZ” like state and the second creates a four-basis entanglement state.

Journal of Physics Conference Series•Sep 1, 2021•2 citations

Quantum Entanglement Algorithmic Self-Organizing Adaptive Algorithm

Jincheng Zhang

Quantum entanglement, a peculiar phenomenon in quantum mechanics, holds immense potential for advanced computation and optimization. This paper explores the concept of a self-organizing adaptive algorithm leveraging quantum entanglement to dynamically adjust parameters within a system, enabling complex optimizations and calculations beyond the limitations of traditional approaches. We propose a novel computational model centered around a dynamically evolving "quantum entanglement network," where the entanglement state itself serves as a core control mechanism for self-adaptation. This algorithm aims to address challenges in optimization and computation by exploiting the inherent properties of entanglement. The core claim is that this algorithm can achieve significant performance improvements through continuous, self-adjusting parameter manipulation. This work presents a foundational framework for exploring the application of quantum entanglement in algorithm design, highlighting potential avenues for future research and development.

•Aug 31, 2026•0 citations

Quantum Algorithm Design and Its Implementation for Solving Test Sheet Composition Optimization Using a Quantum Annealing Approach

Chu‐Fu Wang, Yih–Kai Lin, Ling Cheng

In testing systems, Item Response Theory (IRT) is a widely used model for accurately synthesizing user response information. However, compared to Classical Test Theory (CTT) approaches, it imposes a higher computational burden and increases system design complexity. Quantum computing has shown promise in alleviating these computational challenges. Currently, general-purpose quantum computers are still in a relatively early stage of development. However, special-purpose quantum computing architectures have been designed to solve combinatorial optimization problems, attracting significant attention across various fields. These systems enable researchers to tackle domain-specific optimization problems with reduced computational time. To the best of our knowledge, no applications of quantum computing have been proposed in the field of educational technology. This study therefore aimed to design a quantum QUBO (Quadratic Unconstrained Binary Optimization) formulation for optimizing test sheet composition. The proposed model can be implemented on practical quantum Ising machines (or digital quantum Ising machines for larger qubit usage) to evaluate system efficiency. Simulation results demonstrate that the proposed approach outperforms traditional methods, including the genetic algorithm and particle swarm optimization algorithm, in terms of computational efficiency.

IEEE Transactions on Learning Technologies•Jan 1, 2025•0 citations

Numerical calculation of the measure of entanglement of qutrits multiparty

Werther Xisto da Silva Cardoso

This work discusses the numerical calculation of the measure of entanglement by minimizing the Shannon entropy. This is an optimization problem and it becomes hard when the number of quantum levels of the system and the number of parts increase. A genetic algorithm is presented for calculating the measure of entanglement of qutrits.

•Jan 1, 2011•0 citations

High-Speed and Secure PRNG for Cryptographic Applications

Zhengbing Hu, Sergiy O. Gnatyuk, Тетяна Охріменко +2 more

Due to the fundamentally different approach underlying quantum cryptography (QC), it has not only become competitive, but also has significant advantages over traditional cryptography methods.Such significant advantage as theoretical and informational stability is achieved through the use of unique quantum particles and the inviolability of quantum physics postulates, in addition it does not depend on the intruder computational capabilities.However, even with such impressive reliability results, QC methods have some disadvantages.For instance, such promising trend as quantum secure direct communicationeliminates the problem of key distribution, since it allows to transmit information by open channel without encrypting it.However, in these protocols, each bit is confidential and should not be compromised, therefore, the requirements for protocol stability are increasing and additional security methods are needed.For a whole class of methods to ensure qutrit QC protocols stability, reliable trit generation method is required.In this paper authors have developed and studied trit generation method and software tool TriGen v.2.0 PRNG.Developed PRNG is important for various practical cryptographic applications (for example, trit QC systems, IoT and Blockchain technologies).Future research can be related with developing fully functional version of testing technique and software tool.

International Journal of Computer Network and Information Security•Jun 8, 2020•63 citations
Quantum entanglement which is used as the basis for such applications as quantum cryptography, quantum teleportation, and quantum computing, is a multifaceted property that has attracted much attention. The calculation of quantum entanglement therefore has become important. But the calculation of entanglement has become much more complex as systems that use entanglement have evolved. Based on the relative entropy of entanglement, a general method was developed for the calculation of entanglement for n-qubit or n-qudit system, which using an optimization algorithm technique such as genetic algorithm or Quantum-behaved Particle Swarm Optimization. The method using different optimization algorithm was tested on a two qubit system, for which there are some known points, and compared to exact calculations using the entanglement of formation and with each other. Advantages and disadvantages of the method are discussed and directions of future research are exposed.
This paper explores the application of quantum entanglement to the calculation and optimization of information entropy. Traditional methods for entropy calculation often rely on classical computation, which is insufficient for analyzing complex quantum systems. We propose a novel approach utilizing the unique properties of entangled states to precisely compute information entropy and provide optimization algorithms for quantum information processing and quantum computation. The core mechanism centers around the conceptualization of "quantum entanglement information entropy" and its integration with entropy calculations, offering a potential pathway to enhanced performance in quantum systems. This research investigates the potential of leveraging entangled states to achieve more efficient computations, addressing limitations of classical methods in the context of quantum information.
Abstract One of the most important aspects of quantum computation is quantum entanglement, it is an interesting feature of quantum physics, and has many important applications such as quantum teleportation, cryptography, quantum computation, and dense coding. It is an essential task in quantum computing to design circuits that create an entangled system, and many circuits were implied in the quantum computers that generate the desired entangled state of a system. In this paper, we suggest a general method to design different quantum circuits that produce an entangled system for any number of qubits in different manners. Also, we apply the suggested method in order to design different 4-qubits entanglement creating circuits. The results show that it is possible to design different entanglement creating circuits for any number of qubits by following certain method that will be discussed in the paper, and in the case of 4-qubits system we are going to look only at two circuits, the first creates a “GHZ” like state and the second creates a four-basis entanglement state.
Quantum entanglement, a peculiar phenomenon in quantum mechanics, holds immense potential for advanced computation and optimization. This paper explores the concept of a self-organizing adaptive algorithm leveraging quantum entanglement to dynamically adjust parameters within a system, enabling complex optimizations and calculations beyond the limitations of traditional approaches. We propose a novel computational model centered around a dynamically evolving "quantum entanglement network," where the entanglement state itself serves as a core control mechanism for self-adaptation. This algorithm aims to address challenges in optimization and computation by exploiting the inherent properties of entanglement. The core claim is that this algorithm can achieve significant performance improvements through continuous, self-adjusting parameter manipulation. This work presents a foundational framework for exploring the application of quantum entanglement in algorithm design, highlighting potential avenues for future research and development.
In testing systems, Item Response Theory (IRT) is a widely used model for accurately synthesizing user response information. However, compared to Classical Test Theory (CTT) approaches, it imposes a higher computational burden and increases system design complexity. Quantum computing has shown promise in alleviating these computational challenges. Currently, general-purpose quantum computers are still in a relatively early stage of development. However, special-purpose quantum computing architectures have been designed to solve combinatorial optimization problems, attracting significant attention across various fields. These systems enable researchers to tackle domain-specific optimization problems with reduced computational time. To the best of our knowledge, no applications of quantum computing have been proposed in the field of educational technology. This study therefore aimed to design a quantum QUBO (Quadratic Unconstrained Binary Optimization) formulation for optimizing test sheet composition. The proposed model can be implemented on practical quantum Ising machines (or digital quantum Ising machines for larger qubit usage) to evaluate system efficiency. Simulation results demonstrate that the proposed approach outperforms traditional methods, including the genetic algorithm and particle swarm optimization algorithm, in terms of computational efficiency.
Due to the fundamentally different approach underlying quantum cryptography (QC), it has not only become competitive, but also has significant advantages over traditional cryptography methods.Such significant advantage as theoretical and informational stability is achieved through the use of unique quantum particles and the inviolability of quantum physics postulates, in addition it does not depend on the intruder computational capabilities.However, even with such impressive reliability results, QC methods have some disadvantages.For instance, such promising trend as quantum secure direct communicationeliminates the problem of key distribution, since it allows to transmit information by open channel without encrypting it.However, in these protocols, each bit is confidential and should not be compromised, therefore, the requirements for protocol stability are increasing and additional security methods are needed.For a whole class of methods to ensure qutrit QC protocols stability, reliable trit generation method is required.In this paper authors have developed and studied trit generation method and software tool TriGen v.2.0 PRNG.Developed PRNG is important for various practical cryptographic applications (for example, trit QC systems, IoT and Blockchain technologies).Future research can be related with developing fully functional version of testing technique and software tool.