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

Modern Physics Letters B

A novel quantum computing model based on entanglement degree

Mohammed Zidan

Published Aug 28, 2020• 45 citations
Publisher

Abstract

This paper shows a novel quantum computing model that solves quantum computing problems based on the degree of entanglement. We show two main theorems: the first theorem shows the quantum circuit that can be used to quantify the concurrence value between two adjacent qubits. The second theorem shows the quantum circuit of a proposed operator, called [Formula: see text] operator, which can be used to differentiate between the non-orthogonal states in the form [Formula: see text], with arbitrary accuracy, using the concurrence value. Then, the mathematical machinery for implementing the proposed model and its techniques using the circuit model is investigated extensively.

DOI
10.1142/s0217984920504011

Related papers

A Quantum Algorithm for Evaluating the Hamming Distance

Sohail Khan, Mohammad Nauman, Suleiman Ali Alsaif +2 more

We present a novel quantum algorithm to evaluate the hamming distance between two unknown oracles via measuring the degree of entanglement between two ancillary qubits. In particular, we use the power of the entanglement degree based quantum computing model that preserves at most the locality of interactions within the quantum model structure. This model uses one of two techniques to retrieve the solution of a quantum computing problem at hand. In the first technique, the solution of the problem is obtained based on whether there is an entanglement between the two ancillary qubits or not. In the second, the solution of the quantum computing problem is obtained as a function in the concurrence value, and the number of states that can be generated from the Boolean variables. The proposed algorithm receives two oracles, each oracle represents an unknown Boolean function, then it measures the hamming distance between these two oracles. The hamming distance is evaluated based on the second technique. It is shown that the proposed algorithm provides exponential speedup compared with the classical counterpart for Boolean functions that have large numbers of Boolean variables. The proposed algorithm is explained via a case study. Finally, employing recently developed experimental techniques, the proposed algorithm has been verified using IBM's quantum computer simulator.

Computers, materials & continua/Computers, materials & continua (Print)•Nov 3, 2021•17 citations

Quantum Entanglement Computing Models: A Novel Approach to Beyond Classical Computation

Jincheng Zhang

Quantum entanglement, a bizarre phenomenon where two or more particles become linked and share the same fate, holds immense promise for revolutionizing computation. This paper explores the potential of quantum entanglement for novel computation paradigms, focusing on a model designed to transcend the limitations of classical computing. We propose a framework centered around a "纠缠信息编解码" mechanism, which utilizes entanglement as the core foundation for computation. This model aims to enhance quantum computer capabilities, particularly in the realm of complex algorithm implementation and precision simulation. This research will detail the core mechanism, outlining the design of a specialized entanglement coding scheme. The paper will conclude by discussing the challenges and future directions of this research, emphasizing its potential impact on the advancement of quantum computing.

•Sep 1, 2026•0 citations

Thermal quantum correlations in a three-qubit spin chain under an in-homogeneous magnetic field

M. Alipour, Rahime Sufiani

The thermal quantum correlations of a three-qubit spin chain of XY type under an in-homogeneous magnetic field have been investigated, where by considering magnetic fields with different magnitudes [Formula: see text], [Formula: see text] and [Formula: see text] for each spin, the quantum correlations between the adjacent and the non-adjacent qubits (spins) have been studied. For this purpose, the concurrence as an entanglement quantifier and the trace distance discord as a discord-like quantifier have been computed for the corresponding bipartite subsystems with the reduced density matrices [Formula: see text], [Formula: see text] and [Formula: see text]. The differences between the concurrence and the trace distance discord, are explained in detail. Their dependence on the parameters of the uniform magnetic field [Formula: see text], the temperature [Formula: see text], and the in-homogeneity parameter [Formula: see text] is discussed so that the thermal correlation decreases by increasing the mentioned parameters. Also, the results show that by changing and controlling the parameters [Formula: see text], [Formula: see text] and [Formula: see text], especially the in-homogeneous magnetic field [Formula: see text], it is possible that the correlation value between non-adjacent spins, i.e. [Formula: see text] can be reached to a greater value than the thermal correlations between adjacent spins, i.e. [Formula: see text] and [Formula: see text]. Moreover, it is shown that the trace distance [Formula: see text] between the non-adjacent spins has always a lower value than those of the adjacent spins [Formula: see text] and [Formula: see text]. Finally, the results show that in-homogeneous magnetic field b can be effective for improving thermal quantum correlation.

Modern Physics Letters A•Oct 10, 2023•0 citations

Quantum Entanglement Computing: A Novel Computational Paradigm

Jincheng Zhang

Quantum entanglement, a peculiar phenomenon where two or more particles become correlated in such a way that their fates are intertwined, presents a potentially transformative paradigm shift in computation. This paper explores the application of entanglement to quantum computing, specifically focusing on a novel computational model based on non-linear entanglement. We propose a framework that leverages the inherent properties of entanglement to achieve significant speedups and enable novel quantum algorithms. The core claim of this research is that a model incorporating non-linear entanglement will significantly enhance computational capabilities, particularly in areas such as quantum simulation and quantum algorithm development. This work presents a conceptual outline for a quantum computing paradigm centered on leveraging entanglement's unique characteristics. The paper discusses the potential benefits and challenges associated with this approach, highlighting the importance of understanding and effectively manipulating entanglement for practical applications.

•Sep 4, 2026•0 citations

The Bell-based super-coherent states: Uncertainty relations, Golden ratio and fermion–boson entanglement

Октай Камал Оглы Пашаев, Aygül Koçak

The set of maximally fermion–boson entangled Bell super-coherent states is introduced. A superposition of these states with separable bosonic coherent states, represented by points on the super-Bloch sphere, we call the Bell-based super-coherent states. Entanglement of bosonic and fermionic degrees of freedom in these states is studied by using displacement bosonic operator. It acts on the super-qubit reference state, representing superposition of the zero and the one super-number states, forming computational basis super-states. We show that the states are completely characterized by displaced Fock states, as a superposition with non-classical, the photon added coherent states, and the entanglement is independent of coherent state parameter [Formula: see text] and of the time evolution. In contrast to never orthogonal Glauber coherent states, our entangled super-coherent states can be orthogonal. The uncertainty relation in the states is monotonically growing function of the concurrence and for entangled states we get non-classical quadrature squeezing and representation of uncertainty by ratio of two Fibonacci numbers. The sequence of concurrences, and corresponding uncertainties [Formula: see text], in the limit [Formula: see text], convergent to the Golden ratio uncertainty [Formula: see text], where [Formula: see text] is found.

arXiv:2405.08594•International Journal of Geometric Methods in Modern Physics•Jul 3, 2024•6 citations

Quantum Entanglement as a Logical Computation Model

Jincheng Zhang

Quantum entanglement, a perplexing phenomenon where two or more particles become linked in such a way that they share the same fate, presents a tantalizing prospect for advanced computation. This paper explores the potential of utilizing quantum entanglement to construct a logical computation model, leveraging its unique properties for parallel processing and complex operations. We propose a novel quantum algorithm predicated on this model, aiming to revolutionize traditional computational approaches. The core of this work lies in a detailed architectural design of the entanglement-based logic engine, outlining the fundamental operations and potential applications. The study critically examines the theoretical implications of this approach, focusing on the advantages over existing quantum computing paradigms. We propose a new approach to quantum algorithm development based on entanglement as the foundation.

•Sep 7, 2026•0 citations
This paper shows a novel quantum computing model that solves quantum computing problems based on the degree of entanglement. We show two main theorems: the first theorem shows the quantum circuit that can be used to quantify the concurrence value between two adjacent qubits. The second theorem shows the quantum circuit of a proposed operator, called [Formula: see text] operator, which can be used to differentiate between the non-orthogonal states in the form [Formula: see text], with arbitrary accuracy, using the concurrence value. Then, the mathematical machinery for implementing the proposed model and its techniques using the circuit model is investigated extensively.
We present a novel quantum algorithm to evaluate the hamming distance between two unknown oracles via measuring the degree of entanglement between two ancillary qubits. In particular, we use the power of the entanglement degree based quantum computing model that preserves at most the locality of interactions within the quantum model structure. This model uses one of two techniques to retrieve the solution of a quantum computing problem at hand. In the first technique, the solution of the problem is obtained based on whether there is an entanglement between the two ancillary qubits or not. In the second, the solution of the quantum computing problem is obtained as a function in the concurrence value, and the number of states that can be generated from the Boolean variables. The proposed algorithm receives two oracles, each oracle represents an unknown Boolean function, then it measures the hamming distance between these two oracles. The hamming distance is evaluated based on the second technique. It is shown that the proposed algorithm provides exponential speedup compared with the classical counterpart for Boolean functions that have large numbers of Boolean variables. The proposed algorithm is explained via a case study. Finally, employing recently developed experimental techniques, the proposed algorithm has been verified using IBM's quantum computer simulator.
Quantum entanglement, a bizarre phenomenon where two or more particles become linked and share the same fate, holds immense promise for revolutionizing computation. This paper explores the potential of quantum entanglement for novel computation paradigms, focusing on a model designed to transcend the limitations of classical computing. We propose a framework centered around a "纠缠信息编解码" mechanism, which utilizes entanglement as the core foundation for computation. This model aims to enhance quantum computer capabilities, particularly in the realm of complex algorithm implementation and precision simulation. This research will detail the core mechanism, outlining the design of a specialized entanglement coding scheme. The paper will conclude by discussing the challenges and future directions of this research, emphasizing its potential impact on the advancement of quantum computing.
The thermal quantum correlations of a three-qubit spin chain of XY type under an in-homogeneous magnetic field have been investigated, where by considering magnetic fields with different magnitudes [Formula: see text], [Formula: see text] and [Formula: see text] for each spin, the quantum correlations between the adjacent and the non-adjacent qubits (spins) have been studied. For this purpose, the concurrence as an entanglement quantifier and the trace distance discord as a discord-like quantifier have been computed for the corresponding bipartite subsystems with the reduced density matrices [Formula: see text], [Formula: see text] and [Formula: see text]. The differences between the concurrence and the trace distance discord, are explained in detail. Their dependence on the parameters of the uniform magnetic field [Formula: see text], the temperature [Formula: see text], and the in-homogeneity parameter [Formula: see text] is discussed so that the thermal correlation decreases by increasing the mentioned parameters. Also, the results show that by changing and controlling the parameters [Formula: see text], [Formula: see text] and [Formula: see text], especially the in-homogeneous magnetic field [Formula: see text], it is possible that the correlation value between non-adjacent spins, i.e. [Formula: see text] can be reached to a greater value than the thermal correlations between adjacent spins, i.e. [Formula: see text] and [Formula: see text]. Moreover, it is shown that the trace distance [Formula: see text] between the non-adjacent spins has always a lower value than those of the adjacent spins [Formula: see text] and [Formula: see text]. Finally, the results show that in-homogeneous magnetic field b can be effective for improving thermal quantum correlation.
Quantum entanglement, a peculiar phenomenon where two or more particles become correlated in such a way that their fates are intertwined, presents a potentially transformative paradigm shift in computation. This paper explores the application of entanglement to quantum computing, specifically focusing on a novel computational model based on non-linear entanglement. We propose a framework that leverages the inherent properties of entanglement to achieve significant speedups and enable novel quantum algorithms. The core claim of this research is that a model incorporating non-linear entanglement will significantly enhance computational capabilities, particularly in areas such as quantum simulation and quantum algorithm development. This work presents a conceptual outline for a quantum computing paradigm centered on leveraging entanglement's unique characteristics. The paper discusses the potential benefits and challenges associated with this approach, highlighting the importance of understanding and effectively manipulating entanglement for practical applications.
The set of maximally fermion–boson entangled Bell super-coherent states is introduced. A superposition of these states with separable bosonic coherent states, represented by points on the super-Bloch sphere, we call the Bell-based super-coherent states. Entanglement of bosonic and fermionic degrees of freedom in these states is studied by using displacement bosonic operator. It acts on the super-qubit reference state, representing superposition of the zero and the one super-number states, forming computational basis super-states. We show that the states are completely characterized by displaced Fock states, as a superposition with non-classical, the photon added coherent states, and the entanglement is independent of coherent state parameter [Formula: see text] and of the time evolution. In contrast to never orthogonal Glauber coherent states, our entangled super-coherent states can be orthogonal. The uncertainty relation in the states is monotonically growing function of the concurrence and for entangled states we get non-classical quadrature squeezing and representation of uncertainty by ratio of two Fibonacci numbers. The sequence of concurrences, and corresponding uncertainties [Formula: see text], in the limit [Formula: see text], convergent to the Golden ratio uncertainty [Formula: see text], where [Formula: see text] is found.
Quantum entanglement, a perplexing phenomenon where two or more particles become linked in such a way that they share the same fate, presents a tantalizing prospect for advanced computation. This paper explores the potential of utilizing quantum entanglement to construct a logical computation model, leveraging its unique properties for parallel processing and complex operations. We propose a novel quantum algorithm predicated on this model, aiming to revolutionize traditional computational approaches. The core of this work lies in a detailed architectural design of the entanglement-based logic engine, outlining the fundamental operations and potential applications. The study critically examines the theoretical implications of this approach, focusing on the advantages over existing quantum computing paradigms. We propose a new approach to quantum algorithm development based on entanglement as the foundation.