Quantum Computation

Of the many and varied applications of quantum information theory, perhaps the most fascinating is the sub-field of quantum computation. In this sub-field, computational algorithms are designed which utilise the resources available in quantum systems in order to compute solutions to computational problems with, in some cases, exponentially fewer resources than any known classical algorithm. While the fact of quantum computational speedup is almost beyond doubt, the source of quantum speedup is still a matter of debate. In this paper I (...) argue that entanglement is a necessary component for any explanation of quantum speedup and I address some purported counter-examples that some claim show that the contrary is true. In particular, I address Cleve et al.'s solution to Deutsch's problem, Biham et al.'s mixed-state version of the Deutsch-Jozsa algorithm, and Knill & Laflamme's deterministic quantum computation with one qubit model of quantum computation. I argue that these examples do not demonstrate that entanglement is unnecessary for the explanation of quantum speedup, but that they rather illuminate and clarify the role that entanglement does play. (shrink)

Here, we try to answer some questions about and around the project “Fuzzy Time and the possible impacts of it on science”, mainly proposed by individuals. Besides that, RG (Random Generator modele) is proposed to remove CON(TC*) from the above deduction. It is interesting and surprising although some ask the author interesting questions nevertheless none of them ask this, which author was waiting for that!

Quantum computers are hypothetical quantum information processing (QIP) devices that allow one to store, manipulate, and extract information while harnessing quantum physics to solve various computational problems and do so putatively more efficiently than any known classical counterpart. Despite many ‘proofs of concept’ (Aharonov and Ben–Or 1996; Knill and Laflamme 1996; Knill et al. 1996; Knill et al. 1998) the key obstacle in realizing these powerful machines remains their scalability and susceptibility to noise: almost three decades after their conceptions, experimentalists (...) still struggle to maintain useful quantum coherence in QIP devices with more than a pair of qubits (e.g., Blatt and Wineland 2008). This slow progress has prompted debates on the feasibility of quantum computers, yet the quantum information community has dismissed the skepticism as “ideology” (Aaronson 2004), claiming that the obstacles are merely technological (Kaye et al. 2007, 240). In a recent paper (Hagar 2009) I’ve argued that such a skepticism with respect to the feasibility of quantum computers need not be deemed ideological at all, and that the aforementioned ‘proofs of concept’ are physically suspect. Using analogies from the foundations of classical statistical mechanics (SM), I’ve also argued that instead of active error correction, the appropriate framework for debating the feasibility of large–scale, fault–tolerant and computationally superior quantum computers should be the project of error avoidance: rather than trying to constantly ‘cool down’ the QIP device and prevent its thermalization, one should try to locate those regions in the device’s state space which are thermodynamically ‘abnormal’, i.e., those regions in the device’s state space which resist thermalization regardless of external noise. This paper is intended as a further contribution to the debate on the feasibility of large–scale, fault–tolerant and computationally superior quantum computers. Relying again on analogies from the foundations of classical SM, it suggests a skeptical conjecture and frames it in the ‘passive’, error avoidance, context.. (shrink)

The potential for scalable quantum computing depends on the viability of fault tolerance and quantum error correction, by which the entropy of environmental noise is removed during a quantum computation to maintain the physical reversibility of the computer’s logical qubits. However, the theory underlying quantum error correction applies a linguistic double standard to the words “noise” and “measurement” by treating environmental interactions during a quantum computation as inherently reversible, and environmental interactions at the end of a quantum computation as irreversible (...) measurements. Specifically, quantum error correction theory models noise as interactions that are uncorrelated or that result in correlations that decay in space and/or time, thus embedding no permanent information to the environment. I challenge this assumption both on logical grounds and by discussing a hypothetical quantum computer based on “position qubits.” The technological difficulties of producing a useful scalable position-qubit quantum computer parallel the overwhelming difficulties in performing a double-slit interference experiment on an object comprising a million to a billion fermions. (shrink)

Human thinking does not proceed within a single logic. It stabilizes meaning at the intersection of multiple, partially incompatible logics while tolerating indeterminacy. This paper develops quantum-inspired polylogical systems - formal framework in which this cognitive fact becomes a principle of inference. Building on Resolution Matrix Semantics, indeterminate truth values are interpreted as semantic superpositions, and logical systems themselves form a space of interacting constraints. Inference is reconceived not as derivation within a fixed logic, but as the emergence of stable (...) semantic configurations through interference and suppression. Unlike conventional quantum AI, which accelerates classical reasoning, the proposed model alters the semantics of inference itself. Poly-Logic Quantum AI thus offers a structural model of human reasoning—one that explains coherence without certainty, context sensitivity without logic switching, and the emergence of new ideas without randomness. The result is a theory of artificial reasoning closer to human thinking than to calculation. (shrink)

This work-in-progress paper consists of four points which relate to the foundations and physical realization of quantum computing. The first point is that the qubit cannot be taken as the basic unit for quantum computing, because not every superposition of bit-strings of length n can be factored into a string of n-qubits. The second point is that the “No-cloning” theorem does not apply to the copying of one quantum register into another register, because the mathematical representation of this copying is (...) the identity operator, which is manifestly linear. The third point is that quantum parallelism is not destroyed only by environmental decoherence. There are two other forms of decoherence, which we call measurement decoherence and internal decoherence, that can also destroy quantum parallelism. The fourth point is that processing the contents of a quantum register “one qubit at a time” destroys entanglement. (shrink)

This work presents the formalization of the Ahnend Logical Q-State Core (ALQC), a system designed to manage informational entropy through non-orientable topological constraints. Utilizing a 144-node Latin Square lattice with a 110-connectivity governor, the framework establishes a "Total Symmetry Principle" (TSP) where informational debt (Q2) is recursively inverted into systemic propulsion. This 13-year project provides an invariant proof for the persistence of identity across chaotic state transitions. DOI 10.5281/zenodo.18942849. -/- Newest Uplaod, I fixed some typos. ENJOY. I am done, btw. (...) Ya'll need to start askin questions, I'm getting bored coming up with more stuff by myself. -/- Youtube: @theimpossibleboy13 -/- <Tempus Finitum> . (shrink)

O lucrare de sinteză și inițiere care articulează, într-un cadru unitar, trei direcții majore ale „tehnologiilor cuantice”: (i) calculul cuantic, (ii) criptografia/comunicațiile cuantice și (iii) reflecția filosofică asupra implicațiilor epistemice, etice și politico-instituționale ale „celei de-a doua revoluții cuantice”. Volumul este însoțit de date bibliografice complete. Cartea urmărește să ofere o introducere accesibilă, dar riguroasă, destinată în special cititorilor cu bază în știință și informatică, interesați de impactul fenomenelor cuantice asupra procesării informației și securității. În centrul demersului se află ideea (...) că avantajele (și riscurile) tehnologice provin din proprietăți fundamentale precum superpoziția, inseparabilitatea, interferența, incertitudinea și non-clonarea, discutate ca „resurse” operaționale pentru calcul, comunicație și securitate. Structura este stratificată: începe cu o secțiune de orientare („Tehnologii cuantice pentru informatică și securitate”), apoi aprofundează prin două blocuri didactic-tehnice (calcul cuantic; criptografie cuantică) și se încheie cu un modul filosofic dedicat implicațiilor conceptuale și normative. Cuprinsul indică o progresie de la fundamente (QIS și noțiuni de mecanică cuantică relevante) către aplicații, limitări și guvernanță (UE și România), urmate de resurse/bibliografie. Un element distinctiv al volumului este conectarea discuției tehnice la politici și strategii: sunt prezentate atât Strategia UE „Quantum Europe Strategy: Quantum Europe in a Changing World” (Comisia Europeană, 2 iulie 2025), cu accent pe trecerea „de la laborator la fabrică și utilizare”, cât și Strategia națională a României (2024–2029), orientată spre resurse, industrie și poziționare internațională, inclusiv infrastructură, competențe și securitate „by design”. Prin combinarea (a) unui parcurs didactic cu exerciții și soluții, (b) a unei sinteze aplicate pentru informatică și securitate, (c) a unui cadru de referințe/bibliografie și (d) a unei secțiuni de reflecție filosofico-etică, cartea funcționează ca manual introductiv, ghid de orientare interdisciplinară și punct de plecare pentru discuții despre guvernanța tehnologiilor cuantice. Într-o prezentare academică, volumul poate fi încadrat drept o lucrare de „interfață” între curricula tehnică (algoritmi, protocoale, hardware) și problematica de responsabilitate socială (riscuri, utilizare duală, educație și „balustrade etice”). (shrink)

A Unified (Unitized) Field Theory that Gets Us to (Quantum) Computing without Limitations (no Error or Cooling issues).

In a two-state system, where X is Y, and-is-or (and, as important, always, vice-versa).

Resolution Matrix Semantics (RMS) introduces the alternative truth-value-based framework for modal logic, providing a substantive alternative to Kripke’s relational semantics of possible worlds. Drawing inspiration from Y. Ivlev’s substantive semantics, RMS utilizes a 4-valued structure—necessary truth (tn), contingent truth (tc), contingent false (fc), and necessary false (fn)—augmented by indeterminate values (t, f, t/f) to define modal systems Km, KDm, KTm, S4m, and S5m, analogous to Kripke’s K, KD, T, S4, and S5. By directly assigning determined and indeterminate truth values via (...) an interpretation function, RMS validates formulas without relying on accessibility relations, as demonstrated through soundness and completeness proofs and a tailored tableau method. The framework’s versatility extends to applications in deontic logic, artificial intelligence, and quantum computing, enabling context-dependent reasoning with computational efficiency. RMS thus bridges philosophical logic and practical domains, offering a truth-centric perspective on modal reasoning’s complexities. (shrink)

One of the most fundamental theoretical results in quantum mechanics, the theorem of Simon Kochen and Ernst Specker (1967), is investigated from a rather mathematical and philosophical than physical viewpoint (i.e. unlike as usual). The absence of hidden variables is interpreted philosophically and ontomathematically: as the identity of the mathematical model by the separable complex Hilbert space (equivalent to the qubit Hilbert space) and physical reality. It implies the completeness of just that model to physical reality including in the sense (...) of its cognitive finality. In other words, "hidden variables" are also interpreted as any mismatch between model and reality implied by the theorem not to be. That property of the qubit Hilbert space unique among all other mathematical theories (i.e., all first-order logics) is deduced as a corollary from the theorem as well. The approach at issue to the theorem implies its inherent contextuality to be deduced also in an "apophatic" or holistic version stating that omitting even a single "axis" of Hilbert space or a single value of probability density break its contextuality thus being inconsistent to the theorem. The concept of "fundamental randomness" is newly introduced as originating from the absence of hidden variables in any probability (density or not) distribution, the characteristic function of which is interpreted to be a (qubit) wave function. Then, the Kochen-Specker theorem implies no deviation from that "fundamental randomness" exists once its preconditions have been satisfied. The deviations at issue are seen to be any excluded degrees of freedom in a variable describing whatever. Just this statement is interpreted to be the theorem's "apophatic interpretation". A powerful method for proving statements in Hilbert arithmetic's number theory is offered as a conjecture to be reasoned and proved in a forthcoming paper. (shrink)

The GOOGLE and XPRIZE $5,000,000 for the practical and socially useful utilization of the quantum computer is the starting point for ontomathematical reflections for what it can really serve. Its “output by measurement” is opposed to the conjecture for a coherent ray able alternatively to deliver the ultimate result of any quantum calculation immediately as a Dirac -function therefore accomplishing the transition of the sequence of increasingly narrow probability density distributions to their limit. The GOOGLE and XPRIZE problem’s solution needs (...) the initial understanding that the result of any quantum calculation is a wave function, or respectively, a probability (density or not) distribution unlike the Turing machine one, and only a “calculating ray” is able to transform the former into the later without any “curving” disturbances. Thus, the unique capability of the quantum computer due to its inherent quantum parallelism can be conserved for all Gödel unresolvable problems, only on the fast “NP” track of which the quantum computer “Achilles” is able practically to overrun the Turing machine “Tortoise” since the latter can “sprint” only by any “P” calculating speed even on it and unlike “Achilles” himself able for “NP” velocities as well. The way for any material body to “calculate” the certain trajectory of least action also resolves the “traveling salesman problem” in fact, therefore illustrating furthermore what the “NP” output of a quantum computer by a “calculating ray” should mean. Another example is the problem of the number of all prime numbers less than “N”, which is suggested to visualize once again the quantum computer capability to resolve problems by a “NP” speed and thus qualitatively to overrun any competing Turing machine. The technically implemented idea of laser is now reinterpreted to “radiate a wave function” in order to explain the “calculating ray” option for a quantum computer “NP” output. The generalization of an entanglement “trigger ray” described by any non-Hermitian operator (unlike a laser) is suggested as well as those “sci-fi” horizons which it reveals. One of them is meant for elucidating the practical meaning of the “Yang-Mills existence and mass gap problem”, one more of the CMI “Millennium Problems” after that of “P vs NP”. -/- . (shrink)

Autonomous Intentional Masking (AIM) is the SUPRA-CONSCIOUS PROCESSOR (the super-chip) that explains (and controls) everything in Nature (the relationship between mind and matter) (nuclear energy).What it achieves: Frameless frame of reference. Extended superposition of I/O and memory. Infinite number of transistors, sensors, gates. XYX is XY is XX is X, reproducing the fundamental algorithm in Nature, if zero, then, one, completely integrated with, if one, then, zero. Contact to license.

Understanding the Frameless Frame of Reference.

Utilizing Conservation of a Circle to Rethink Quantum Mechanics (AI, Processors, Memory) (Bits and Bytes).

Achieving the Supra-Conscious Processor that is Beneath Reality.

Zero and One (modern) is Yin and Yang (ancient). What's next in AI? Advanced Autonomous Intelligence. This article introduces The Circular Theory (Autonomous Intentional Masking) as the New Thought Dynamic required for Advanced Autonomous Intelligence. It is supported by the Constant Variable (A Unified Unitized Field) which self-actualizes via Fifteen Sustainable Society Projects organized into a Health, Stealth, Wealth configuration. This self-actualizes into a Wealth-not-War Mentality (supported by the required Circular-Linear Financial Co-Dependence Between Liabilities and Assets which is not possible (...) without an Automatically-Conserved-Unified-Unitized-Circular-Linear Field) (The Constant-Variable) (One Circumference and One Diameter). Focus is on Service-Based-Sustainability and the (US) Dollar Value of an Hour (the Physical Representation (Universal Tokenization) of Mind). (shrink)

Zero and One (modern) is Yin and Yang (ancient). What's next in AI? Advanced Autonomous Intelligence. This article introduces The Circular Theory (Autonomous Intentional Masking) as the New Thought Dynamic required for Advanced Autonomous Intelligence. It explains the Constant Variable (a Unified Unitized Field) which self-actualizes via Fifteen Sustainable Society Projects organized into a Health, Stealth, Wealth configuration. This self-actualizes into a Wealth-not-War Mentality automatically supported by the required Circular-Linear Financial Co-Dependence Between Liabilities and Assets which is not possible without (...) an Automatically-Conserved-Unified-Unitized-Circular-Linear Field (The Constant-Variable) (One Circumference and One Diameter). Focus is on Service-Based-Sustainability and the (US) Dollar Value of an Hour (the Physical Representation (Universal Tokenization) of Mind). (shrink)

A decimal system always begins with one and ends with zero, despite the number of zeros, two remains the highest and lowest number (one and zero from-form a circle). Thus complementary opposites are embedded within any unit. That is, one is embedded in (an alternate articulation for) two, two is embedded in (an alternate articulation for) three, and three is embedded in (an alternate articulation for) one. This makes a nice, neat, circle. That is, any two is three, in the (...) same way any one is two, and, eventually it is easy to notice, any zero is one, and vice versa, and one and infinity, then, are, also joined, and separated, by pi. (shrink)

Combining physics, mathematics and computer science, quantum computing and its sister discipline of quantum information have developed in the past few decades from visionary ideas to two of the most fascinating areas of quantum theory. General interest and excitement in quantum computing was initially triggered by P. W. Shor (1994) who showed how a quantum algorithm apparently can factor large numbers into primes far more efficiently than any known classical algorithm. Shor’s algorithm was soon followed by several other algorithms for (...) solving combinatorial and algebraic problems, and in the years since the theoretical study of quantum computational systems has achieved tremendous progress. Although no proof exists yet for the general superiority of quantum computers over classical computers, the implementation of Shor’s algorithm on a large scale quantum computer would render ineffective currently widely used cryptosystems that rely on the premise that no efficient algorithm for factoring exists. Consequently, experimentalists around the world are engaged in attempts to tackle the technological difficulties that prevent the realisation of a large scale quantum computer. From a foundational point of view, reflecting on features of the design and implementation of efficient quantum algorithms may help us to better understand just what it is that makes quantum systems quantum, and it may illuminate fundamental concepts such as measurement and causality. Further, the idea that abstract mathematical concepts such as computability and complexity may not only be translated into physics, but also re-written by physics bears directly on the autonomous character of computer science and the status of its theoretical entities—the so-called “computational kinds”. As such it is also relevant to the long-standing philosophical debate on the relationship between mathematics and the physical world. (shrink)

The ecology of fear has become a common rhetoric in efforts to support climate mitigation. The thesis of the collapse is an extreme version, asserting the inevitable collapse of the world. Fear, then, becomes the ultimate emotion for spurring action. In this article, drawing on the work of the pragmatist John Dewey, we show that fear is an ambiguous emotion. Dewey stressed the quality of an emotion. Following his reasoning, this article draws a distinction between intense and moderate fear. Intense (...) fear annihilates action, while moderate fear fulfils the conditions for an emotion of quality (in the Deweyan sense), which enables action. For this reason, the thesis of the collapse must be rejected, while an ecology of fear, drawing on moderate fear, may be maintained. (shrink)

We describe a joint cohomological framework for measurement-based quantum computation (MBQC) and the corresponding contextuality proofs. The central object in this framework is an element [βΨ]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[\beta _\Psi ]$$\end{document} in the second cohomology group of the chain complex describing a given MBQC. [βΨ]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[\beta _\Psi ]$$\end{document} contains the function computed therein up to gauge equivalence, and at the same time is a contextuality witness. The (...) present cohomological description only applies to temporally flat MBQCs, and we outline an approach for extending it to the temporally ordered case. (shrink)

As quantum technologies (QT) advance, their potential impact on and relation with society has been developing into an important issue for exploration. In this paper, we investigate the topic of democratization in the context of QT, particularly quantum computing. The paper contains three main sections. First, we briefly introduce different theories of democracy (participatory, representative, and deliberative) and how the concept of democratization can be formulated with respect to whether democracy is taken as an intrinsic or instrumental value. Second, we (...) give an overview of how the concept of democratization is used in the QT field. Democratization is mainly adopted by companies working on quantum computing and used in a very narrow understanding of the concept. Third, we explore various narratives and counter-narratives concerning democratization in QT. Finally, we explore the general efforts of democratization in QT such as different forms of access, formation of grassroot communities and special interest groups, the emerging culture of manifesto writing, and how these can be located within the different theories of democracy. In conclusion, we argue that although the ongoing efforts in the democratization of QT are necessary steps towards the democratization of this set of emerging technologies, they should not be accepted as sufficient to argue that QT is a democratized field. We argue that more reflexivity and responsiveness regarding the narratives and actions adopted by the actors in the QT field and making the underlying assumptions of ongoing efforts on democratization of QT explicit, can result in a better technology for society. (shrink)

Why you don’t need quantum physics to understand the Universe (and everything in it).

From the philosopher’s perspective, the interest in quantum computation stems primarily from the way that it combines fundamental concepts from two distinct sciences: Physics, in particular Quantum Mechanics, and Computer Science, each long a subject of philosophical speculation and analysis in its own right. Quantum computing combines both of these more traditional areas of inquiry into one wholly new, if not quite independent, science. Over the course of this chapter we will be discussing some of the most important philosophical questions (...) that arise from this merger and philosophical lessons to be learned. (shrink)

We introduce this special issue on Thinking about Climate Change by reflecting on the role of psychology in responding adaptively to catastrophic global threats. By way of illustration we compare the threat posed by climate change with the extinction-level threat considered in the recent film Don’t Look Up [McKay, A. (Director). (2021). Don’t Look Up [Film]. Hyperobject Industries]. Human psychology is a critical element in both scenarios. The papers in this special issue discuss the importance of clear communication of scientific (...) information, the dangers of misinformation and the possible role played by motivated reasoning, all themes that are taken up in the film. Ultimately, though, it is not enough to consider psychological factors in isolation: we must also acknowledge that cognitive flaws and psychological motivations are exploited by vested interests that profit from delaying climate action. A global response to a global crisis requires us to ‘look up’ to recognise the threat and to ‘look around’ to go beyond specialist disciplines and national boundaries. (shrink)

Climate change threatens humanity more than anything else. If we talk of nationalism, we ought therefore consider its pros and cons in light of the climate emergency. Anatol Lieven believes that civic nationalism along the lines of Chaim Gans, David Miller, and Yuli Tamir helps combat global warming. He thinks that when nationalists recognize that climate change is just as threatening to the survival of their nation-state as wars, they will make the sacrifices necessary to avert the threat. In this (...) view, the military has an important role, and migration will have to be restricted. In this paper, I show that this solution is at best highly risky, and more probably unsound. However difficult it will be to realize, addressing climate change must be based on international cooperation, normatively grounded in human rights. I show how international law rather than civic nationalism gives us examples of how to go forward. (shrink)

This article is intended mainly to develop an expository outline of an inherently inconsistent reasoning in the development of quantum mechanics during 1920s, which set up the background of proposing different variants of quantum logic a bit later. We will discuss here two of the quantum logical variants with reference to Hilbert space formulation, based on the proposals of Bohr and Schrödinger as a result of addressing the same kernel of difficulties and will give a relative comparison. Our presentation is (...) fairly informal, as our goal here is to simply sketch the central ideas leaving further details for other occasions. -/- Quanta 2022; 11: 28–41. (shrink)

Assisted migration (AM) is a translocation of the representatives of species to areas outside their natural habitats as a response to climate change. This article seeks to identify how customary norms and general principles of international environmental law could guide the development of regulation of AM maximizing the benefits of using AM and minimizing AM-related risks. Among the customary norms and principles of international environmental law discussed in the article and relevant to the regulation of AM are the permanent sovereignty (...) over natural resources, the principle of cooperation, the no-harm rule, the precautionary principle, the principles of prevention, due diligence, and obligation to conduct environmental impact assessment (EIA), the principles of integration and intergenerational equity, common but differentiated responsibilities, and the polluter pays principle, the principles of non-regression, progression, resilience, in dubio pro natura, the principle of ecological proportionality, and the principle of access to information, public participation, and access to justice in environmental matters (principle of good governance, environmental democracy). (shrink)

There is a growing movement in online social networks and within some governments to deny the long-established scientific consensus regarding climate change. Scientific research has shown that a series of climatic events in Latin America, and especially in Brazil, are being exacerbated by global warming. These events have had a profound impact on populations. Disruptions to Brazilian rainfall patterns with their devastating environmental and economic effects on agriculture have been directly linked with Amazonian deforestation. Furthermore, the Bolsonaro government, with its (...) erratic environmental policies and ardent followers, has promoted misinformation about climate change and conservation of the Amazon. It is necessary to simultaneously inform society about scientific misunderstandings regarding the environment and the way these misunderstandings are amplified via the internet and social networks. (shrink)

One is occasionally reminded of Foucault's proclamation in a 1970 interview that "perhaps, one day this century will be known as Deleuzian." Less often is one compelled to update and restart with a supplementary counter-proclamation of the mathematician, David Lindley: "the twenty-first century would be a Bayesian era..." The verb tenses of both are conspicuous. // To critically attend to what is today often feared and demonized, but also revered, deployed, and commonly referred to as algorithm(s), one cannot avoid the (...) mathematical and philosophical legacies of probability. // But attending to these probabilistic or Bayesian legacies must include an undeniable theological legacy in which they remain entangled. // We are not, today, discovering quirky theological metaphors in contemporary technics. It's the other way around. The technologies are mere metaphors of past theologies. (shrink)

This is an extended essay review of Tanya and Jeffrey Bub’s Totally Random: Why Nobody Understands Quantum Mechanics: A serious comic on entanglement. We review the philosophical aspects of the book, provide suggestions for instructors on how to use the book in a class setting, and evaluate the authors’ artistic choices in the context of comics theory. Although Totally Random does not defend any particular interpretation of quantum mechanics, we find that, in its mode of presentation, Totally Random is a (...) beautiful expression and illustration of the information-theoretic interpretation and its value. (shrink)

Quantum computing is of high interest because it promises to perform at least some kinds of computations much faster than classical computers. Arute et al. 2019 (informally, “the Google Quantum Team”) report the results of experiments that purport to demonstrate “quantum supremacy” – the claim that the performance of some quantum computers is better than that of classical computers on some problems. Do these results close the debate over quantum supremacy? We argue that they do not. In the following, we (...) provide an overview of the Google Quantum Team’s experiments, then identify some open questions in the quest to demonstrate quantum supremacy. (shrink)

The superposition of magical thinking, quantum entanglement, and self-referential recursion explains the relationship between human and machine intelligence (universal intelligence).

Any computer can create a model of reality. The hypothesis that quantum computer can generate such a model designated as quantum, which coincides with the modeled reality, is discussed. Its reasons are the theorems about the absence of “hidden variables” in quantum mechanics. The quantum modeling requires the axiom of choice. The following conclusions are deduced from the hypothesis. A quantum model unlike a classical model can coincide with reality. Reality can be interpreted as a quantum computer. The physical processes (...) represent computations of the quantum computer. Quantum information is the real fundament of the world. The conception of quantum computer unifies physics and mathematics and thus the material and the ideal world. Quantum computer is a non-Turing machine in principle. Any quantum computing can be interpreted as an infinite classical computational process of a Turing machine. Quantum computer introduces the notion of “actually infinite computational process”. The discussed hypothesis is consistent with all quantum mechanics. The conclusions address a form of neo-Pythagoreanism: Unifying the mathematical and physical, quantum computer is situated in an intermediate domain of their mutual transformation. (shrink)

Natural argument is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary natural arguments in any data. That ability of natural argument is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite (...) different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number. -/- . (shrink)

Pattern recognition is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary patterns in any data. That ability of universal pattern recognition is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite (...) different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number. (shrink)

Any logic is represented as a certain collection of well-orderings admitting or not some algebraic structure such as a generalized lattice. Then universal logic should refer to the class of all subclasses of all well-orderings. One can construct a mapping between Hilbert space and the class of all logics. Thus there exists a correspondence between universal logic and the world if the latter is considered a collection of wave functions, as which the points in Hilbert space can be interpreted. The (...) correspondence can be further extended to the foundation of mathematics by set theory and arithmetic, and thus to all mathematics. (shrink)

Two strategies to infinity are equally relevant for it is as universal and thus complete as open and thus incomplete. Quantum mechanics is forced to introduce infinity implicitly by Hilbert space, on which is founded its formalism. One can demonstrate that essential properties of quantum information, entanglement, and quantum computer originate directly from infinity once it is involved in quantum mechanics. Thus, thеse phenomena can be elucidated as both complete and incomplete, after which choice is the border between them. A (...) special kind of invariance to the axiom of choice shared by quantum mechanics is discussed to be involved that border between the completeness and incompleteness of infinity in a consistent way. The so-called paradox of Albert Einstein, Boris Podolsky, and Nathan Rosen is interpreted entirely in the same terms only of set theory. Quantum computer can demonstrate especially clearly the privilege of the internal position, or “observer”, or “user” to infinity implied by Henkin’s proposition as the only consistent ones as to infinity. (shrink)

This article analyzes current attitudes toward artificial intelligence (AI) and quantum computing and argues that they represent a modern‐day form of magical thinking. It proposes that AI and quantum computing are thus excellent examples of the ways that traditional distinctions between religion, science, and magic fail to account for the vibrancy and energy that surround modern technologies.

In the past four decades, the notion of quantum polynomial-time computability has been mathematically modeled by quantum Turing machines as well as quantum circuits. This paper seeks the third model, which is a quantum analogue of the schematic definition of recursive functions. For quantum functions mapping finite-dimensional Hilbert spaces to themselves, we present such a schematic definition, composed of a small set of initial quantum functions and a few construction rules that dictate how to build a new quantum function from (...) the existing ones. We prove that our schematic definition precisely characterizes all functions that can be computable with high success probabilities on well-formed quantum Turing machines in polynomial time, or equivalently uniform families of polynomial-size quantum circuits. Our new, schematic definition is quite simple and intuitive and, more importantly, it avoids the cumbersome introduction of the well-formedness condition imposed on a quantum Turing machine model as well as of the uniformity condition necessary for a quantum circuit model. Our new approach can further open a door to the descriptional complexity of quantum functions, to the theory of higher-type quantum functionals, to the development of new first-order theories for quantum computing, and to the designing of programming languages for real-life quantum computer. (shrink)

A recent paper from Brun et al. has argued that access to a closed timelike curve would allow for the possibility of perfectly distinguishing nonorthogonal quantum states. This result can be used to develop a protocol for instantaneous nonlocal signaling. Several commenters have argued that nonlocal signaling must fail in this and in similar cases, often citing consistency with relativity as the justification. I argue that this objection fails to rule out nonlocal signaling in the presence of a CTC. I (...) argue that the reason these authors are motivated to exclude the prediction of nonlocal signaling is because the No Signaling principle is considered to a fundamental part of the formulation of the quantum information approach. I draw out the relationship between nonlocal signaling, quantum information, and relativity, and argue that the principle theory formulation of quantum mechanics, which is at the foundation of the quantum information approach, is in tension with foundational assumptions of Deutsch’s D-CTC model, on which this protocol is based. (shrink)

Combining physics, mathematics and computer science, quantum computing and its sister discipline of quantum information have developed in the past few decades from visionary ideas to two of the most fascinating areas of quantum theory. General interest and excitement in quantum computing was initially triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially “speed-up” classical computation and factor large numbers into primes far more efficiently than any (known) classical algorithm. Shor’s algorithm was soon followed by several (...) other algorithms that aimed to solve combinatorial and algebraic problems, and in the years since theoretical study of quantum systems serving as computational devices has achieved tremendous progress. Common belief has it that the implementation of Shor’s algorithm on a large scale quantum computer would have devastating consequences for current cryptography protocols which rely on the premise that all known classical worst-case algorithms for factoring take time exponential in the length of their input (see, e.g., Preskill 2005). Consequently, experimentalists around the world are engaged in attempts to tackle the technological difficulties that prevent the realisation of a large scale quantum computer. But regardless whether these technological problems can be overcome (Unruh 1995; Ekert and Jozsa 1996; Haroche and Raimond 1996), it is noteworthy that no proof exists yet for the general superiority of quantum computers over their classical counterparts. -/- The philosophical interest in quantum computing is manifold. From a social-historical perspective, quantum computing is a domain where experimentalists find themselves ahead of their fellow theorists. Indeed, quantum mysteries such as entanglement and nonlocality were historically considered a philosophical quibble, until physicists discovered that these mysteries might be harnessed to devise new efficient algorithms. But while the technology for harnessing the power of 50–100 qubits (the basic unit of information in the quantum computer) is now within reach (Preskill 2018), only a handful of quantum algorithms exist, and the question of whether these can truly outperform any conceivable classical alternative is still open. From a more philosophical perspective, advances in quantum computing may yield foundational benefits. For example, it may turn out that the technological capabilities that allow us to isolate quantum systems by shielding them from the effects of decoherence for a period of time long enough to manipulate them will also allow us to make progress in some fundamental problems in the foundations of quantum theory itself. Indeed, the development and the implementation of efficient quantum algorithms may help us understand better the border between classical and quantum physics (Cuffaro 2017, 2018a; cf. Pitowsky 1994, 100), and perhaps even illuminate fundamental concepts such as measurement and causality. Finally, the idea that abstract mathematical concepts such as computability and complexity may not only be translated into physics, but also re-written by physics bears directly on the autonomous character of computer science and the status of its theoretical entities—the so-called “computational kinds”. As such it is also relevant to the long-standing philosophical debate on the relationship between mathematics and the physical world. (shrink)

Computing, today more than ever before, is a multi-faceted discipline which collates several methodologies, areas of interest, and approaches: mathematics, engineering, programming, and applications. Given its enormous impact on everyday life, it is essential that its debated origins are understood, and that its different foundations are explained. On the Foundations of Computing offers a comprehensive and critical overview of the birth and evolution of computing, and it presents some of the most important technical results and philosophical problems of the discipline, (...) combining both historical and systematic analyses. -/- The debates this text surveys are among the latest and most urgent ones: the crisis of foundations in mathematics and the birth of the decision problem, the nature of algorithms, the debates on computational artefacts and malfunctioning, and the analysis of computational experiments. By covering these topics, On the Foundations of Computing provides a much-needed resource to contextualize these foundational issues. -/- For practitioners, researchers, and students alike, a historical and philosophical approach such as what this volume offers becomes essential to understand the past of the discipline and to figure out the challenges of its future. (shrink)