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

A Connection Of Quantum Computation And Dna Computation Using The Bloch Sphere

Patrick K. Inkoom

Published Jan 1, 2011• 0 citations
Publisher

Abstract

Quantum and DNA computing are distributing and parallel types of computing. They are useful for solving problems which require high complexity computations and (or) massive data set computations such as searching, sorting, merging, pattern recognition, image processing, encryption, etc. Quantum and DNA algorithms cannot be efficiently simulated on classical computers because classical computers cannot efficiently deal with the parallelism. The quantum circuit model is adequate to describe quantum algorithms whereas DNA circuit model is adequate to describe DNA algorithms. This thesis establishes the relationship between a quantum qubit and a DNA string using the Bloch sphere. The Bloch sphere is a convenient graphical representation of a qubit in a 3-dimensional space. The model used in this thesis presents one-to-one mapping between qubits, DNA strings, and points on the Bloch sphere. The model is implemented at the real computer - von Neumann machine, therefore, there are restrictions related to the precision of qubits value, the length of DNA strings, and the precisions of coordinates values. The Bloch sphere and the relations between qubits, DNA strings and points are implemented as "Quantum and DNA Computation Simulation Programming System". Quantum and DNA Computation Simulation Programming System is implemented in the Java programming language. This system is a modified and upgraded interactive Quantum Computation applet developed at the Johns Hopkins Center for Educational Resources. The modifications include connecting (a) DNA strings and the Bloch sphere and (b) DNA strings and qubits. There are many researches in Quantum Computing and DNA Computing as independent study fields, but this is the first research which tries to connect Quantum and DNA Computing together using the Bloch sphere.

DOI
10.13016/m28w3850s

Related papers

Multiple-Valued Quantum-DNA Computing

Hafiz Md. Hasan Babu

Quantum and DNA computing are both distributed and parallel types of computing. They're useful for tasks that require high-complexity computations and/or large data sets, such as searching, sorting, merging, pattern recognition, image processing, and encryption. Quantum and DNA algorithms cannot be efficiently simulated on classical computers because they are incapable of coping with parallelism. Quantum computers are more powerful than classical turing machines because of their coherent superposition of states. Biotechnology techniques can be used to evolve DNA computers. Both of these qualities could be captured by combining DNA and quantum computers. Self-assembling quantum logic circuits from gates attached to DNA strands could be achieved using DNA computers. In terms of how inputs are given and outputs are generated, multiple-valued Quantum and DNA computing can be combined in two ways. They can be named as: Multiple-Valued Quantum-DNA Computing, and Multiple-Valued DNA-Quantum Computing.

CRC Press eBooks•Aug 29, 2023•0 citations

The interactive system of Bloch sphere for quantum computing education

Yu-Ping Liao, Yi-Lin Cheng, You-Ting Zhang +2 more

With the advent of quantum computers, applications of quantum computing have also begun to develop. Quantum computing is a difficult field for non-experts to understand. However, most of the ways to realize quantum computing are limited to books or software implementation. This study proposes a Bloch sphere interactive system to visualize the quantum computing simulation. Users can input the quantum bit and quantum gate for quantum computing by the mobile App. And then, parallel computing is performed by the FPGA to simulate quantum circuits using OpenCL. The resultant data is then sent to a microcontroller, which drives the motors to rotate the Bloch sphere to visualize the single-qubit quantum states.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•14 citations

Analysis and Implementation of Quantum Logic Gates and Circuits

Dushyant Kumar, Balwinder Raj, Gurmohan Singh

Superposition, entanglement, and interference are used in quantum computing to solve issues that cannot be solved by traditional computation. Qubits, in contrast to conventional bits, can exist in several states, allowing for exponential parallelism. Its revolutionary impact is demonstrated by quantum gates and algorithms, such as Grover's for search and Shor's for factorization. There are issues with error correction, scalability, and coherence in all of the physical platforms that have been established, such as spin-based qubits, photonic systems, trapped ions, and superconducting circuits. Progress is accelerated by developments in cloud-based services and hybrid quantum-classical computing. Numerous fields, including artificial intelligence, optimization, drug development, and cryptography, can benefit greatly from quantum computing. Classical encryption is under danger from quantum algorithms, which is why quantum-resistant protocols are being developed. Quantum simulation transforms molecular modeling in chemistry and materials science, supporting energy and medical research. Data analysis and pattern recognition are further advanced by quantum-enhanced machine learning. Although still in its infancy, qubit scalability and error correction research is propelling advancements. Quantum computing is still a major area of research and development because of its potential to revolutionize computation and lead to ground-breaking developments in a variety of domains.

International Conference on Electronics, AI and Computing (EAIC)•Jun 5, 2025•0 citations

Quantum Computing

Suraj Ghadge

Abstract: Quantum computing is a new type of computing that uses the principles of quantum physics to perform calculations in ways that are not possible with traditional computers. Unlike classical computers, which process information using bits that are either 0 or 1, quantum computers use quantum bits (qubits) that can exist in multiple states at the same time. This ability allows quantum systems to solve certain complex problems much faster than classical machines. This paper presents a simple and human-centered explanation of quantum computing, focusing on how it works, why it matters, and how it can be applied in real-world situations. The study discusses key concepts such as superposition, entanglement, and quantum gates using easy-to-understand language. It also explores practical applications including cryptography, optimization, drug discovery, and material simulation. In addition, this paper examines the current challenges in quantum computing, such as hardware instability, error correction, limited qubit scalability, and high implementation cost. A conceptual hybrid classical–quantum system model is proposed to show how quantum and classical computers can work together to solve complex problems more efficiently. The goal of this research is to make quantum computing more understandable to students, educators, and decision-makers, and to encourage early awareness and responsible development of this powerful technology. Keywords — quantum computing, qubit, superposition, entanglement, quantum gate, error correction, hybrid computing

International Scientific Journal of Engineering and Management•Dec 17, 2025•0 citations

Asymmetric Sugar–Phosphate Backbone and Base-Pair Bloch Sphere Representation in DNA Computing Linked to Artificial Intelligence

Chur Chin

In DNA computing models, the sugar–phosphate backbone exhibits structural asymmetry, where phosphate groups covalently connect the 5′ carbon of one deoxyribose to the 3′ carbon of the next, producing a directionally polarized framework. This molecular asymmetry serves not only as a fundamental basis for replication fidelity and biological transcription but also as a topological precursor for encoding quantum states. In this paper, we propose that the canonical DNA bases, embedded in this asymmetric backbone, can be modeled as qubits projected onto a Bloch sphere, whose coordinates—x, y, z—arise from the intrinsic asymmetry and base stacking interactions. These quantum models of DNA bases are elements of a two-dimensional Hilbert space H2, establishing a framework for linking DNA computation to artificial intelligence (AI), specifically through entanglement, quantum superposition, and state collapse. We explore the implications of this Bloch sphere–Hilbert space representation for information processing, quantum learning architectures, and AI-enhanced encryption systems.

•May 16, 2025•0 citations

Design and Implementation of Color Image Encryption Based on Qubit Rotation About Axis

Xiande Liu, Hong Yu Xiao, Panchi Li +1 more

Currently, almost all color image encryption/decryption algorithms are designed based on a classical computer, in which the key space is relatively small, and the huge gains from quantum parallelism are not obtained. To address this problem, we propose a novel color image encryption/decryption method based on random rotation of qubit and Quantum Fourier transform (QFT). First, the color image is represented in a quantum superposition state |Image⟩, in which the color information of each pixel is described by only one qubit |c⟩. Then, the |c⟩ are randomly rotated on the Bloch sphere about three coordinate axis, and the QFT is performed on the |Image⟩. Once again, the |c⟩ is randomly rotated on the Bloch sphere and then the inverse QFT is performed on the |Image⟩, which the encryption process is implemented. The keys are the rotation angles of two above-mentioned rotations. The decryption is the inverse process of the encryption. Our method may run on a quantum computer in the future. The simulation results on the classic computer show that our approaches have better security.

Chinese Journal of Electronics•Jul 1, 2018•11 citations
Quantum and DNA computing are distributing and parallel types of computing. They are useful for solving problems which require high complexity computations and (or) massive data set computations such as searching, sorting, merging, pattern recognition, image processing, encryption, etc. Quantum and DNA algorithms cannot be efficiently simulated on classical computers because classical computers cannot efficiently deal with the parallelism. The quantum circuit model is adequate to describe quantum algorithms whereas DNA circuit model is adequate to describe DNA algorithms. This thesis establishes the relationship between a quantum qubit and a DNA string using the Bloch sphere. The Bloch sphere is a convenient graphical representation of a qubit in a 3-dimensional space. The model used in this thesis presents one-to-one mapping between qubits, DNA strings, and points on the Bloch sphere. The model is implemented at the real computer - von Neumann machine, therefore, there are restrictions related to the precision of qubits value, the length of DNA strings, and the precisions of coordinates values. The Bloch sphere and the relations between qubits, DNA strings and points are implemented as "Quantum and DNA Computation Simulation Programming System". Quantum and DNA Computation Simulation Programming System is implemented in the Java programming language. This system is a modified and upgraded interactive Quantum Computation applet developed at the Johns Hopkins Center for Educational Resources. The modifications include connecting (a) DNA strings and the Bloch sphere and (b) DNA strings and qubits. There are many researches in Quantum Computing and DNA Computing as independent study fields, but this is the first research which tries to connect Quantum and DNA Computing together using the Bloch sphere.
Quantum and DNA computing are both distributed and parallel types of computing. They're useful for tasks that require high-complexity computations and/or large data sets, such as searching, sorting, merging, pattern recognition, image processing, and encryption. Quantum and DNA algorithms cannot be efficiently simulated on classical computers because they are incapable of coping with parallelism. Quantum computers are more powerful than classical turing machines because of their coherent superposition of states. Biotechnology techniques can be used to evolve DNA computers. Both of these qualities could be captured by combining DNA and quantum computers. Self-assembling quantum logic circuits from gates attached to DNA strands could be achieved using DNA computers. In terms of how inputs are given and outputs are generated, multiple-valued Quantum and DNA computing can be combined in two ways. They can be named as: Multiple-Valued Quantum-DNA Computing, and Multiple-Valued DNA-Quantum Computing.
With the advent of quantum computers, applications of quantum computing have also begun to develop. Quantum computing is a difficult field for non-experts to understand. However, most of the ways to realize quantum computing are limited to books or software implementation. This study proposes a Bloch sphere interactive system to visualize the quantum computing simulation. Users can input the quantum bit and quantum gate for quantum computing by the mobile App. And then, parallel computing is performed by the FPGA to simulate quantum circuits using OpenCL. The resultant data is then sent to a microcontroller, which drives the motors to rotate the Bloch sphere to visualize the single-qubit quantum states.
Superposition, entanglement, and interference are used in quantum computing to solve issues that cannot be solved by traditional computation. Qubits, in contrast to conventional bits, can exist in several states, allowing for exponential parallelism. Its revolutionary impact is demonstrated by quantum gates and algorithms, such as Grover's for search and Shor's for factorization. There are issues with error correction, scalability, and coherence in all of the physical platforms that have been established, such as spin-based qubits, photonic systems, trapped ions, and superconducting circuits. Progress is accelerated by developments in cloud-based services and hybrid quantum-classical computing. Numerous fields, including artificial intelligence, optimization, drug development, and cryptography, can benefit greatly from quantum computing. Classical encryption is under danger from quantum algorithms, which is why quantum-resistant protocols are being developed. Quantum simulation transforms molecular modeling in chemistry and materials science, supporting energy and medical research. Data analysis and pattern recognition are further advanced by quantum-enhanced machine learning. Although still in its infancy, qubit scalability and error correction research is propelling advancements. Quantum computing is still a major area of research and development because of its potential to revolutionize computation and lead to ground-breaking developments in a variety of domains.
Abstract: Quantum computing is a new type of computing that uses the principles of quantum physics to perform calculations in ways that are not possible with traditional computers. Unlike classical computers, which process information using bits that are either 0 or 1, quantum computers use quantum bits (qubits) that can exist in multiple states at the same time. This ability allows quantum systems to solve certain complex problems much faster than classical machines. This paper presents a simple and human-centered explanation of quantum computing, focusing on how it works, why it matters, and how it can be applied in real-world situations. The study discusses key concepts such as superposition, entanglement, and quantum gates using easy-to-understand language. It also explores practical applications including cryptography, optimization, drug discovery, and material simulation. In addition, this paper examines the current challenges in quantum computing, such as hardware instability, error correction, limited qubit scalability, and high implementation cost. A conceptual hybrid classical–quantum system model is proposed to show how quantum and classical computers can work together to solve complex problems more efficiently. The goal of this research is to make quantum computing more understandable to students, educators, and decision-makers, and to encourage early awareness and responsible development of this powerful technology. Keywords — quantum computing, qubit, superposition, entanglement, quantum gate, error correction, hybrid computing
In DNA computing models, the sugar–phosphate backbone exhibits structural asymmetry, where phosphate groups covalently connect the 5′ carbon of one deoxyribose to the 3′ carbon of the next, producing a directionally polarized framework. This molecular asymmetry serves not only as a fundamental basis for replication fidelity and biological transcription but also as a topological precursor for encoding quantum states. In this paper, we propose that the canonical DNA bases, embedded in this asymmetric backbone, can be modeled as qubits projected onto a Bloch sphere, whose coordinates—x, y, z—arise from the intrinsic asymmetry and base stacking interactions. These quantum models of DNA bases are elements of a two-dimensional Hilbert space H2, establishing a framework for linking DNA computation to artificial intelligence (AI), specifically through entanglement, quantum superposition, and state collapse. We explore the implications of this Bloch sphere–Hilbert space representation for information processing, quantum learning architectures, and AI-enhanced encryption systems.
Currently, almost all color image encryption/decryption algorithms are designed based on a classical computer, in which the key space is relatively small, and the huge gains from quantum parallelism are not obtained. To address this problem, we propose a novel color image encryption/decryption method based on random rotation of qubit and Quantum Fourier transform (QFT). First, the color image is represented in a quantum superposition state |Image⟩, in which the color information of each pixel is described by only one qubit |c⟩. Then, the |c⟩ are randomly rotated on the Bloch sphere about three coordinate axis, and the QFT is performed on the |Image⟩. Once again, the |c⟩ is randomly rotated on the Bloch sphere and then the inverse QFT is performed on the |Image⟩, which the encryption process is implemented. The keys are the rotation angles of two above-mentioned rotations. The decryption is the inverse process of the encryption. Our method may run on a quantum computer in the future. The simulation results on the classic computer show that our approaches have better security.