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

AIP conference proceedings

A New Concept On A Quantum Computer Based On Schockley-Read-Hall Recombination Statistics In Microelectronic Devices

K. Theodoropoulos

Published Jan 1, 2005• 0 citations
Publisher

Abstract

In this paper a quantum computer based on the recombination processes happening in semiconductor devices is presented. A “data element” and a “computational element” are derived based on Schokley‐Read‐Hall statistics and they can later be used in order to manifest a simple and known quantum algorithm. Such a paradigm is shown by the application of the proposed technology onto the Shor’s period‐finding algorithm.

DOI
10.1063/1.1994667

Related papers

A quantum computer based on recombination processes in microelectronic devices

K Theodoropoulos, Dimitris Ntalaperas, Ivo Petráš +1 more

In this paper a quantum computer based on the recombination processes happening in semiconductor devices is presented. A "data element" and a "computational element" are derived based on Schokley-Read-Hall statistics and they can later be used to manifest a simple and known quantum computing process. Such a paradigm is shown by the application of the proposed computer onto a well known physical system involving traps in semiconductor devices.

Journal of Physics Conference Series•Jan 1, 2005•0 citations

Quantum computation

ARTUR K. EKERT

Quantum theory is vital for the next generation data processing devices. As computers become faster they must become smaller because of the finiteness of the speed of light. The history of computer technology has involved a sequence of changes from one type of physical realisation to another - from gears to relays to valves to transistors to integrated circuits and so on. The step to the molecular scale - the quantum level - will be next. Quantum theory is already important in the design of microelectronic components. Soon it will be necessary to harness quantum theory, rather than simply take it into account, to give data processing devices new functionality.

17th Congress of the International Commission for Optics: Optics for Science and New Technology•Sep 1, 1996•0 citations

Quantum Computers and Their Simulation.

Thomas Lippert

Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.

ARCS Workshops•Jan 1, 2004•0 citations

Quantum Digital–Analogue Computing

Vladimir I. Hahanov, Wajeb Gharibi, Mikhail F. Karavay +6 more

Nature is the relations between processes and phenomena. Nothing exists in a Universe without relations. Computing is the transaction of relations between data using control and execution mechanisms. Quantum relations are a superposition of particles and their states. Quantum computing is unconditional transactions of relations between qubit data. Entanglement is a nonlocal superposition of deterministic states. A quantum computer is an analog device for solving combinatorial problems in parallel. Practically focused definitions of the concepts of quantum computing represent a path to the development of scalable quantum parallel algorithms for solving combinatorial problems. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer uses previously created primitives-constructs to build an always non-optimal calculator. The deterministic paradigm of creating quantum computing by using photon transactions on the electrons of an atom can exclude the use of quantum logic. The evolutionary path of quantum computing from the classical one: Memory-Address-Transaction (MAT) $\rightarrow$ Electron-Address-Transaction $\rightarrow$Electron-Address-Quantaction (EAQ)$\rightarrow$State-Superposition- Logic. What is calculated on a quantum computer can be calculated in parallel on a classical computer due to the redundancy of memory. MAT-computing implements any algorithms through transactions (read-write) in memory. Qubit-vector models for describing functionalities differ from the known truth tables in terms of compactness of description and technological implementation of parallel algorithms for the synthesis and analysis of digital devices and SoC-components. An example is given – a memory-driven algorithm for simulating digital devices based on qubit-vector forms of describing functionalities for a significant increase in the productivity of computing processes by parallel execution of logical operations. Comparative evaluations of the use of qubit models and methods show an increase in the efficiency of algorithms for simulating digital devices in comparison with tabular ones. The superposition of classical, quantum and analog computing is integrally presented, which makes it possible to search the best solutions for recognition and decision making.

IEEE East-West Design & Test Symposium (EWDTS)•Sep 10, 2021•2 citations

Application of Quantum Key Distribution

Joseph Russell

Quantum key distribution is an innovative technique to distribute encryption keys without compromise. This paper focuses on the application of this technique to achieve reliable communication in an ever-evolving and increasingly vulnerable environment. Designers of cryptosystems have three basic objectives; designing cryptographic algorithms that adequately scramble the target data, developing strong encryption keys to lock and unlock the algorithm, and securely distributing the keys between communicating devices. The advance of quantum computing technologies threatens to expose the world's most prolific key method overnight. Though quantum computing is not yet a reality, the basic principles have been proven in laboratories. Furthermore, quantum computing has been shown to be especially suited for computations of complex mathematic equations; such as distilling the private keys from the public keys used in public key infrastructures (PKI). In this environment, it's comforting to know that the most advanced technology in the broad field of quantum communications just happens to be a new method of creating and distributing encryption keys. This technology is referred to as quantum key distribution (QKD). QKD technologies shift the current paradigm on two plains. The first is that it uses quantum principles, rather than conventional means, for distributing keys between devices. The quantum principles guarantee the key can not be intercepted during transmission without alerting the users of a compromise. The second shift is derived from the fact that encrypted data can not be intercepted today and decrypted at a later date when the computing power exists to crack the code. This shift is dependant on the use of a combination of QKD and one-time pad. Because of the quantum principles that QKD relies on, when a key is successfully created and shared, it can not be cracked using intercepted data. The keys are derived from a convergence of random operations conducted at the sender and receiver stations. Indeed, neither the sender nor the receiver can determine what the key will be until the entire process is completed. As a piece of our security infrastructure, QKD significantly raises our security posture. This paper explains the application of quantum principals used to enable QKD systems.

IEEE Military Communications Conference (MILCOM)•Nov 1, 2008•8 citations

Quantum Algorithms in Quantum Computers

Fernández Sánchez, Xabier

[EN] An introduction to quantum computing and the quantum circuit model is given. Three quantum algorithms (Grover's Algorithm, Counting Algorithm and Shor's Algorithm) are discussed and simulated using Python coding and Qiskit libraries. Simulation results are discussed and compared with theoretical expectations.

•Jul 19, 2024•0 citations
In this paper a quantum computer based on the recombination processes happening in semiconductor devices is presented. A “data element” and a “computational element” are derived based on Schokley‐Read‐Hall statistics and they can later be used in order to manifest a simple and known quantum algorithm. Such a paradigm is shown by the application of the proposed technology onto the Shor’s period‐finding algorithm.
Quantum theory is vital for the next generation data processing devices. As computers become faster they must become smaller because of the finiteness of the speed of light. The history of computer technology has involved a sequence of changes from one type of physical realisation to another - from gears to relays to valves to transistors to integrated circuits and so on. The step to the molecular scale - the quantum level - will be next. Quantum theory is already important in the design of microelectronic components. Soon it will be necessary to harness quantum theory, rather than simply take it into account, to give data processing devices new functionality.
Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.
Nature is the relations between processes and phenomena. Nothing exists in a Universe without relations. Computing is the transaction of relations between data using control and execution mechanisms. Quantum relations are a superposition of particles and their states. Quantum computing is unconditional transactions of relations between qubit data. Entanglement is a nonlocal superposition of deterministic states. A quantum computer is an analog device for solving combinatorial problems in parallel. Practically focused definitions of the concepts of quantum computing represent a path to the development of scalable quantum parallel algorithms for solving combinatorial problems. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer uses previously created primitives-constructs to build an always non-optimal calculator. The deterministic paradigm of creating quantum computing by using photon transactions on the electrons of an atom can exclude the use of quantum logic. The evolutionary path of quantum computing from the classical one: Memory-Address-Transaction (MAT) →\rightarrow→ Electron-Address-Transaction →\rightarrow→Electron-Address-Quantaction (EAQ)→\rightarrow→State-Superposition- Logic. What is calculated on a quantum computer can be calculated in parallel on a classical computer due to the redundancy of memory. MAT-computing implements any algorithms through transactions (read-write) in memory. Qubit-vector models for describing functionalities differ from the known truth tables in terms of compactness of description and technological implementation of parallel algorithms for the synthesis and analysis of digital devices and SoC-components. An example is given – a memory-driven algorithm for simulating digital devices based on qubit-vector forms of describing functionalities for a significant increase in the productivity of computing processes by parallel execution of logical operations. Comparative evaluations of the use of qubit models and methods show an increase in the efficiency of algorithms for simulating digital devices in comparison with tabular ones. The superposition of classical, quantum and analog computing is integrally presented, which makes it possible to search the best solutions for recognition and decision making.
Quantum key distribution is an innovative technique to distribute encryption keys without compromise. This paper focuses on the application of this technique to achieve reliable communication in an ever-evolving and increasingly vulnerable environment. Designers of cryptosystems have three basic objectives; designing cryptographic algorithms that adequately scramble the target data, developing strong encryption keys to lock and unlock the algorithm, and securely distributing the keys between communicating devices. The advance of quantum computing technologies threatens to expose the world's most prolific key method overnight. Though quantum computing is not yet a reality, the basic principles have been proven in laboratories. Furthermore, quantum computing has been shown to be especially suited for computations of complex mathematic equations; such as distilling the private keys from the public keys used in public key infrastructures (PKI). In this environment, it's comforting to know that the most advanced technology in the broad field of quantum communications just happens to be a new method of creating and distributing encryption keys. This technology is referred to as quantum key distribution (QKD). QKD technologies shift the current paradigm on two plains. The first is that it uses quantum principles, rather than conventional means, for distributing keys between devices. The quantum principles guarantee the key can not be intercepted during transmission without alerting the users of a compromise. The second shift is derived from the fact that encrypted data can not be intercepted today and decrypted at a later date when the computing power exists to crack the code. This shift is dependant on the use of a combination of QKD and one-time pad. Because of the quantum principles that QKD relies on, when a key is successfully created and shared, it can not be cracked using intercepted data. The keys are derived from a convergence of random operations conducted at the sender and receiver stations. Indeed, neither the sender nor the receiver can determine what the key will be until the entire process is completed. As a piece of our security infrastructure, QKD significantly raises our security posture. This paper explains the application of quantum principals used to enable QKD systems.