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 Journal of Quantum Information

Quantum representation of the earth based on the bloch sphere

Chan Li, Zhu Cao, Dayong Lu, Yuewei Xu, Zhenlei Wang

Published Aug 11, 2025• 1 citation
Publisher

Abstract

Implementing a digital Earth requires processing an enormous amount of data. Compared with classical algorithms, quantum algorithms can take exponential or quadratic acceleration and are more suitable for processing big data. However, existing quantum models require massive resources to process data on the Earth due to their low compatibility with spheres. So, we propose a quantum representation of the Earth based on the Bloch sphere (QREB), which is tailor-made for the Earth. Based on this model, the scale transformation and specific rotation transformation only need to change one variable. And the time complexity of the quantum point of interest extraction algorithm based on this model is the square root of the classical algorithm. Moreover, in the example of extracting thin black lines on the basketball, the accuracy is improved from 50% to 87.5%. The QREB model can reduce the resources required to process spherical data and accelerate the realization of a digital Earth.

DOI
10.1142/s0219749925500224

Related papers

Algorithm for Quantum-like Representation: Transformation of Probabilistic Data into Vectors on Bloch's Sphere

Andrei Yu. Khrennikov

In this paper, we present a simple algorithm for representation of statistical data of any origin by complex probability amplitudes. Numerical simulation with Mathematica-6 is performed, cf. [1] and [2] on recent numerical simulation for quantum correlations. The Bloch's sphere is used for the visualization of results of numerical simulation. On the one hand, creation of such a quantum-like (QL) representation and its numerical approval is an important step in clarification of extremely complicated interrelation between classical and quantum randomness. On the other hand, it opens new possibilities for applying the mathematical formalism of QM in other domains of science.

arXiv:0803.1391•Open Systems & Information Dynamics•Sep 1, 2008•7 citations

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

Patrick K. Inkoom

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.

•Jan 1, 2011•0 citations

Boosting Classification with Quantum-Inspired Augmentations

Matthias Tschöpe, Vítor Fortes Rey, Sogo Pierre Sanon +3 more

Understanding the impact of small quantum gate perturbations, which are common in quantum digital devices but absent in classical computers, is crucial for identifying potential advantages in quantum machine learning. While these perturbations are typically seen as detrimental to quantum computation, they can actually enhance performance by serving as a natural source of data augmentation. Additionally, they can often be efficiently simulated on classical hardware, enabling quantum-inspired approaches to improve classical machine learning methods. In this paper, we investigate random Bloch sphere rotations, which are fundamental SU(2) transformations, as a simple yet effective quantum-inspired data augmentation technique. Unlike conventional augmentations such as flipping, rotating, or cropping, quantum transformations lack intuitive spatial interpretations, making their application to tasks like image classification less straightforward. While common quantum augmentation methods rely on applying quantum models or trainable quanvolutional layers to classical datasets, we focus on the direct application of small-angle Bloch rotations and their effect on classical data. Using the large-scale ImageNet dataset, we demonstrate that our quantum-inspired augmentation method improves image classification performance, increasing Top-1 accuracy by 3%, Top-5 accuracy by 2.5%, and the F$_1$ score from 8% to 12% compared to standard classical augmentation methods. Finally, we examine the use of stronger unitary augmentations. Although these transformations preserve information in principle, they result in visually unrecognizable images with potential applications for privacy computations. However, we show that our augmentation approach and simple SU(2) transformations do not enhance differential privacy and discuss the implications of this limitation.

arXiv:2506.22241•Jun 27, 2025•0 citations

Quantum Computing and the Bloch Sphere: Mathematical Framework, Single-Qubit Transformations, and Circuit Logic

Chinnaraji Annamalai

Quantum computing leverages fundamental principles of quantum mechanics to perform computations far exceeding classical architectures. At the core of single-qubit quantum state manipulation is the Bloch sphere, a geometric representation mapping the state space of two-level quantum systems onto a three-dimensional unit sphere. This paper presents a comprehensive theoretical framework of qubits, starting from single-qubit geometric state vectors and expanding to rigorous multi-qubit mathematical formulations. Furthermore, it analyzes single-qubit quantum gates as unitary rotations on the Bloch sphere, evaluates multi-qubit system scaling, and explicitly proves state normalization conditions using Born's rule across multi-dimensional Hilbert spaces.

•Sep 14, 2026•4 citations

Quandoop: A Classical Simulator of Quantum Walks on Computer Clusters

David Rodrigues de Souza, Franklin de Lima Marquezino, ALEXANDRE ANTÔNIO DE LIMA JUNIOR

The Ordinary Kriging (OK) algorithm is an important method used in geostatistics applications for data interpolation usually based on field measurements of a variable of interest.The OK algorithm is used to estimate the value of a variable based on the variance of previous measurements.The OK algorithm has applications in areas such as environmental science, hydrogeology, mining, weather prediction and remote sensing.However, the OK algorithm is many times not suitable for large volumes of data due to its computational cost.In this work we present a study of a parallel implementation of the OK algorithm that takes advantage of heterogeneous computing environments through the usage of the Open Computing Language (OpenCL) framework.We use the OK algorithm to estimate a Digital Terrain Model (DTM) from a point cloud of a mangrove forest obtained via a terrestrial laser 3D scanning device.A downsampling procedure is applied to the raw data in order to extract the points that belong to the ground and then the OK algorithm is applied to obtain the DTM.The objective of our implementation is to effectively use all the computational resources available to accelerate the OK procedure.We show that our implementation can scale across multiple CPUs and GPUs devices and it is able to handle volumes of data that are typically produced by real world field measurements.The interpolation is a crucial step to make predictions of a variable at unknown locations, it is important to use the maximum amount of measurements possible in order to increase the performance of the prediction algorithm.Reducing the time to generate the interpolation model is, therefore, extremely important.We also compare the run times of a reference sequential implementation with our parallel one to show that the usage of parallel programming techniques can accelerate the fundamental steps of many important scientific researches.

Journal of Computational Interdisciplinary Sciences•Jan 1, 2017•0 citations

A Proposal of Visualization System for Understanding Quantum Algorithms

Mariko Sasakura, Shingo Taniuchi, Kenichi Iwata

Quantum algorithms which are performed on quantum computers are hardly developed, because the principle of quantum computers are totally different from classical computers. We would like to discuss the way of visualization to assist understanding quantum algorithms. As the first step, we have developed visualization system of the Bloch sphere, which is the popular way to show the status of one quantum bit. In the system, we can see the Bloch sphere as 3DCG and interact with it. Next, we discuss the problems of visualizing multiple quantum bits and quantum algorithms.

IEEE Conference on Information Visualization (IV)•Jul 1, 2019•1 citation
Implementing a digital Earth requires processing an enormous amount of data. Compared with classical algorithms, quantum algorithms can take exponential or quadratic acceleration and are more suitable for processing big data. However, existing quantum models require massive resources to process data on the Earth due to their low compatibility with spheres. So, we propose a quantum representation of the Earth based on the Bloch sphere (QREB), which is tailor-made for the Earth. Based on this model, the scale transformation and specific rotation transformation only need to change one variable. And the time complexity of the quantum point of interest extraction algorithm based on this model is the square root of the classical algorithm. Moreover, in the example of extracting thin black lines on the basketball, the accuracy is improved from 50% to 87.5%. The QREB model can reduce the resources required to process spherical data and accelerate the realization of a digital Earth.
In this paper, we present a simple algorithm for representation of statistical data of any origin by complex probability amplitudes. Numerical simulation with Mathematica-6 is performed, cf. [1] and [2] on recent numerical simulation for quantum correlations. The Bloch's sphere is used for the visualization of results of numerical simulation. On the one hand, creation of such a quantum-like (QL) representation and its numerical approval is an important step in clarification of extremely complicated interrelation between classical and quantum randomness. On the other hand, it opens new possibilities for applying the mathematical formalism of QM in other domains of science.
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.
Understanding the impact of small quantum gate perturbations, which are common in quantum digital devices but absent in classical computers, is crucial for identifying potential advantages in quantum machine learning. While these perturbations are typically seen as detrimental to quantum computation, they can actually enhance performance by serving as a natural source of data augmentation. Additionally, they can often be efficiently simulated on classical hardware, enabling quantum-inspired approaches to improve classical machine learning methods. In this paper, we investigate random Bloch sphere rotations, which are fundamental SU(2) transformations, as a simple yet effective quantum-inspired data augmentation technique. Unlike conventional augmentations such as flipping, rotating, or cropping, quantum transformations lack intuitive spatial interpretations, making their application to tasks like image classification less straightforward. While common quantum augmentation methods rely on applying quantum models or trainable quanvolutional layers to classical datasets, we focus on the direct application of small-angle Bloch rotations and their effect on classical data. Using the large-scale ImageNet dataset, we demonstrate that our quantum-inspired augmentation method improves image classification performance, increasing Top-1 accuracy by 3%, Top-5 accuracy by 2.5%, and the F1_11​ score from 8% to 12% compared to standard classical augmentation methods. Finally, we examine the use of stronger unitary augmentations. Although these transformations preserve information in principle, they result in visually unrecognizable images with potential applications for privacy computations. However, we show that our augmentation approach and simple SU(2) transformations do not enhance differential privacy and discuss the implications of this limitation.
Quantum computing leverages fundamental principles of quantum mechanics to perform computations far exceeding classical architectures. At the core of single-qubit quantum state manipulation is the Bloch sphere, a geometric representation mapping the state space of two-level quantum systems onto a three-dimensional unit sphere. This paper presents a comprehensive theoretical framework of qubits, starting from single-qubit geometric state vectors and expanding to rigorous multi-qubit mathematical formulations. Furthermore, it analyzes single-qubit quantum gates as unitary rotations on the Bloch sphere, evaluates multi-qubit system scaling, and explicitly proves state normalization conditions using Born's rule across multi-dimensional Hilbert spaces.
The Ordinary Kriging (OK) algorithm is an important method used in geostatistics applications for data interpolation usually based on field measurements of a variable of interest.The OK algorithm is used to estimate the value of a variable based on the variance of previous measurements.The OK algorithm has applications in areas such as environmental science, hydrogeology, mining, weather prediction and remote sensing.However, the OK algorithm is many times not suitable for large volumes of data due to its computational cost.In this work we present a study of a parallel implementation of the OK algorithm that takes advantage of heterogeneous computing environments through the usage of the Open Computing Language (OpenCL) framework.We use the OK algorithm to estimate a Digital Terrain Model (DTM) from a point cloud of a mangrove forest obtained via a terrestrial laser 3D scanning device.A downsampling procedure is applied to the raw data in order to extract the points that belong to the ground and then the OK algorithm is applied to obtain the DTM.The objective of our implementation is to effectively use all the computational resources available to accelerate the OK procedure.We show that our implementation can scale across multiple CPUs and GPUs devices and it is able to handle volumes of data that are typically produced by real world field measurements.The interpolation is a crucial step to make predictions of a variable at unknown locations, it is important to use the maximum amount of measurements possible in order to increase the performance of the prediction algorithm.Reducing the time to generate the interpolation model is, therefore, extremely important.We also compare the run times of a reference sequential implementation with our parallel one to show that the usage of parallel programming techniques can accelerate the fundamental steps of many important scientific researches.
Quantum algorithms which are performed on quantum computers are hardly developed, because the principle of quantum computers are totally different from classical computers. We would like to discuss the way of visualization to assist understanding quantum algorithms. As the first step, we have developed visualization system of the Bloch sphere, which is the popular way to show the status of one quantum bit. In the system, we can see the Bloch sphere as 3DCG and interact with it. Next, we discuss the problems of visualizing multiple quantum bits and quantum algorithms.