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

Lecture notes in networks and systems

Representation of a Basic Data Structure in Quantum Computing

Varun Puram, K. M. George, Johnson P. Thomas

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-3-031-84460-7_3

Related papers

Computability in Basic Quantum Mechanics

Eike Neumann, Martin Pape, Thomas Streicher

The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and observable can be formulated as kinds of measures as in [21]. The aim of this paper is to show that there is a good notion of computability for these data structures in the sense of Weihrauch's Type Two Effectivity (TTE) [26]. Instead of explicitly exhibiting admissible representations for the data types under consideration we show that they do live within the category $\mathbf{QCB}_0$ which is equivalent to the category $\mathbf{AdmRep}$ of admissible representations and continuously realizable maps between them. For this purpose in case of observables we have to replace measures by valuations which allows us to prove an effective version of von Neumann's Spectral Theorem.

arXiv:1610.09209•Logical Methods in Computer Science•Jun 19, 2018•1 citation

Representing Data on a Quantum Computer

Maria Schuld, Francesco Petruccione

Quantum science and technology•Jan 1, 2021•11 citations

Storing the Quantum Fourier Operator in the QuIDD Data Structure

Katalin Friedl, László Kabódi

Quantum algorithms can be simulated using classical computers, but the typical time complexity of the simulation is exponential. There are some data structures which can speed up this simulation to make it possible to test these algorithms on classical computers using more than a few qubits. One of them is QuIDD by Viamontes et al., which is an extension of the Algebraic Decision Diagram. In this paper, we examine the matrix of Fourier operator and its QuIDD representation. To utilize the structure of the operator we propose two orderings (reversed column variables and even-odd order), both resulting in smaller data structure than the standard one. After that, we propose a new method of storing the Fourier operator, using a weighted decision diagram that further reduces its size. It should be the topic of subsequent research whether the basic operations can be performed efficiently on this weighted structure.

Acta Cybernetica•Jan 1, 2017•1 citation

Quantum Data Structures and Encoding

Jesse Van Griensven Thé, Roydon Andrew Fraser, José R. Rosas-Bustos

Springer eBooks•Jan 1, 2025•0 citations

Delving into the Basics of QC

M M Anishin Raj, Varghese S. Chooralil, Sebastian Terance +2 more

Data is the most essential component of information systems which is represented by classical bit of data such as 0 and 1 in conventional computing machines. These machines execute binary operations to implement classical algorithms for providing solutions for the tasks in a specific domain. Data manipulation techniques are mostly utilized; their main operators are arithmetic, boolean, logical, and relational operators. At this modern juncture, there is a huge transformation on data bit processing using quantum computing (QC) techniques. QC is the most powerful technique which utilizes the principles of quantum mechanics to solve complex problems. There is a global stakes and conceivable progress in the domain of quantum technology effectively for data collection and communication, algorithm execution, and numerous levels of application domains with use cases. The computation speed of quantum machines is increasing enormously when compared to traditional machines. This chapter presents various fundamental concepts of QC, the structure of qubit and its representation, and core operations such as superposition and entanglement. In addition to quantum gates and circuits, the chapter examines various quantum operations that manipulate qubits to perform sophisticated computations beyond what classical computers are capable of. Upon completion of this chapter, the readers will have a solid understanding of quantum computation's foundational mechanics and an appreciation for its revolutionary potential for various domains such as information security, optimization, and artificial intelligence.

Wiley eBooks•May 22, 2026•0 citations

Basic Concepts in Quantum Computation

ARTUR K. EKERT, Patrick M. Hayden, Hitoshi Inamori

arXiv:quant-ph/0011013•Springer eBooks•Jul 2, 2007•123 citations
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space H\mathcal{H}H. In terms of the Hilbert lattice L\mathcal{L}L of closed linear subspaces of H\mathcal{H}H the notions of state and observable can be formulated as kinds of measures as in [21]. The aim of this paper is to show that there is a good notion of computability for these data structures in the sense of Weihrauch's Type Two Effectivity (TTE) [26]. Instead of explicitly exhibiting admissible representations for the data types under consideration we show that they do live within the category QCB0\mathbf{QCB}_0QCB0​ which is equivalent to the category AdmRep\mathbf{AdmRep}AdmRep of admissible representations and continuously realizable maps between them. For this purpose in case of observables we have to replace measures by valuations which allows us to prove an effective version of von Neumann's Spectral Theorem.
Quantum algorithms can be simulated using classical computers, but the typical time complexity of the simulation is exponential. There are some data structures which can speed up this simulation to make it possible to test these algorithms on classical computers using more than a few qubits. One of them is QuIDD by Viamontes et al., which is an extension of the Algebraic Decision Diagram. In this paper, we examine the matrix of Fourier operator and its QuIDD representation. To utilize the structure of the operator we propose two orderings (reversed column variables and even-odd order), both resulting in smaller data structure than the standard one. After that, we propose a new method of storing the Fourier operator, using a weighted decision diagram that further reduces its size. It should be the topic of subsequent research whether the basic operations can be performed efficiently on this weighted structure.
Data is the most essential component of information systems which is represented by classical bit of data such as 0 and 1 in conventional computing machines. These machines execute binary operations to implement classical algorithms for providing solutions for the tasks in a specific domain. Data manipulation techniques are mostly utilized; their main operators are arithmetic, boolean, logical, and relational operators. At this modern juncture, there is a huge transformation on data bit processing using quantum computing (QC) techniques. QC is the most powerful technique which utilizes the principles of quantum mechanics to solve complex problems. There is a global stakes and conceivable progress in the domain of quantum technology effectively for data collection and communication, algorithm execution, and numerous levels of application domains with use cases. The computation speed of quantum machines is increasing enormously when compared to traditional machines. This chapter presents various fundamental concepts of QC, the structure of qubit and its representation, and core operations such as superposition and entanglement. In addition to quantum gates and circuits, the chapter examines various quantum operations that manipulate qubits to perform sophisticated computations beyond what classical computers are capable of. Upon completion of this chapter, the readers will have a solid understanding of quantum computation's foundational mechanics and an appreciation for its revolutionary potential for various domains such as information security, optimization, and artificial intelligence.