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

Quantum Computing for AerospaceResearch and Beyond

Tobias Stollenwerk

Published Jan 1, 2019• 0 citations
OpenAlex

Related papers

Quantum Computing Quibits and Beyond

Dr. N. Kohila Mr. M.Sakthivel Mrs. V.V. Lakshmi Swathi Mrs. K. Pandi Meena Dr. D. Priyadharsini

•Sep 22, 2026•0 citations

Quantum Computing: Rethinking Computation Beyond Classical Limits

Nishant Tripathi

•Jan 1, 2025•0 citations

Quantifiable Simulation of Quantum Computation beyond Stochastic Ensemble Computation (Adv. Quantum Technol. 2/2018)

Jeongho Bang, Junghee Ryu, Chang‐Woo Lee +3 more

A model of quantum computation (QC) is compared with a generalized classical computation model, named stochastic ensemble computation (SEnC), in article number 1800037 by Jeongho Bang, Jinhyoung Lee, Wonmin Son and co-workers. SEnC runs in an ensemble consisting of finite copies of single probabilistic entities, and hence is a generalized probabilistic Turing machine. Impossibility of simulating a QC in the SEnC is proved, manifesting “QC is characterized beyond any classical probabilistic computation,” i.e., SEnC ⊆ QC.

Advanced Quantum Technologies•Oct 1, 2018•0 citations

Quantum Computing for Aerospace Research

Tobias Stollenwerk

•Feb 21, 2019•0 citations

Preliminary study for developing instantaneous quantum computing algorithms (IQCA)

Richard L. Amoroso

Abstract Since the mid-1990s theoretical quadratic exponential and polynomial Quantum Computing (QC) speedup algorithms have been discussed. Recently the advent of relativistic information processing (RIP) introducing a relativistic qubit (r-qubit) with additional degrees of freedom beyond the current Hilbert space Bloch 2-sphere qubit formalism extended theory has appeared. In this work a penultimate form of QC speedup – Instantaneous Quantum Computing Algorithms (IQCA) is proposed. Discussion exists on passing beyond the quantum limits of locality and unitarity heretofore restricting the evolution of quantum systems to the standard Copenhagen Interpretation. In that respect as introduced in prior work an ontological-phase topological QC avails itself of extended modeling. As well-known by EPR experiments instantaneous connectivity exists inherently in the nonlocal arena. As our starting point we utilize Bohm’s super-implicate order where inside a wave packet a super-quantum potential introduces nonlocal connectivity. Additionally EPR experiments entangle simultaneously emitted photon pairs by parametric down-conversion. Operating an IQCA requires a parametric up-conversion cycle an M-Theoretic Unified Field Mechanical (MUFM) set of topological transformations beyond the current Galilean Lorentz-Poincairé transforms of the standard model (SM). Yang-Mills Kaluza-Klein (YM-KK) correspondence is shown to provide a path beyond the semi-quantum limit to realize the local-nonlocal duality required to implement IQCA.

Journal of Physics Conference Series•Jun 1, 2019•0 citations

Programming Quantum Computersfor Aerospace Research

Tobias Stollenwerk

•Jan 1, 2019•0 citations
A model of quantum computation (QC) is compared with a generalized classical computation model, named stochastic ensemble computation (SEnC), in article number 1800037 by Jeongho Bang, Jinhyoung Lee, Wonmin Son and co-workers. SEnC runs in an ensemble consisting of finite copies of single probabilistic entities, and hence is a generalized probabilistic Turing machine. Impossibility of simulating a QC in the SEnC is proved, manifesting “QC is characterized beyond any classical probabilistic computation,” i.e., SEnC ⊆ QC.
Abstract Since the mid-1990s theoretical quadratic exponential and polynomial Quantum Computing (QC) speedup algorithms have been discussed. Recently the advent of relativistic information processing (RIP) introducing a relativistic qubit (r-qubit) with additional degrees of freedom beyond the current Hilbert space Bloch 2-sphere qubit formalism extended theory has appeared. In this work a penultimate form of QC speedup – Instantaneous Quantum Computing Algorithms (IQCA) is proposed. Discussion exists on passing beyond the quantum limits of locality and unitarity heretofore restricting the evolution of quantum systems to the standard Copenhagen Interpretation. In that respect as introduced in prior work an ontological-phase topological QC avails itself of extended modeling. As well-known by EPR experiments instantaneous connectivity exists inherently in the nonlocal arena. As our starting point we utilize Bohm’s super-implicate order where inside a wave packet a super-quantum potential introduces nonlocal connectivity. Additionally EPR experiments entangle simultaneously emitted photon pairs by parametric down-conversion. Operating an IQCA requires a parametric up-conversion cycle an M-Theoretic Unified Field Mechanical (MUFM) set of topological transformations beyond the current Galilean Lorentz-Poincairé transforms of the standard model (SM). Yang-Mills Kaluza-Klein (YM-KK) correspondence is shown to provide a path beyond the semi-quantum limit to realize the local-nonlocal duality required to implement IQCA.