Related categories
Siblings:
20 found
Search inside:
(import / add options)   Sort by:
  1. Jeffrey Bub (2008). Quantum Computation and Pseudotelepathic Games. Philosophy of Science 75 (4):458-472.
    A quantum algorithm succeeds not because the superposition principle allows ‘the computation of all values of a function at once’ via ‘quantum parallelism’, but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information‐processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Jean-Michel Delhôtel (2001). On Bits and Quanta. Studies in History and Philosophy of Science Part B 32 (1):143-150.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Michael Dickson (2007). Is Measurement a Black Box? On the Importance of Understanding Measurement Even in Quantum Information and Computation. Philosophy of Science 74 (5):1019–1032.
    It has been argued, partly from the lack of any widely accepted solution to the measurement problem, and partly from recent results from quantum information theory, that measurement in quantum theory is best treated as a black box. However, there is a crucial difference between ‘having no account of measurement' and ‘having no solution to the measurement problem'. We know a lot about measurements. Taking into account this knowledge sheds light on quantum theory as a theory of information and computation. (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  4. A. Duwell (2003). The Physics of Quantum Information: Quantum Cryptography, Quantum Teleportation, Quantum Computation - D. Bouwmeester, A. Ekert and A. Zeilinger (Eds.); Germany, 2000, 314pp, US$ 54, ISBN 3-540-66778-. [REVIEW] Studies in History and Philosophy of Science Part B 34 (2):331-334.
    Remove from this list | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  5. Armond Duwell (2007). The Many-Worlds Interpretation and Quantum Computation. Philosophy of Science 74 (5):1007-1018.
    David Deutsch and others have suggested that the Many-Worlds Interpretation of quantum mechanics is the only interpretation capable of explaining the special efficiency quantum computers seem to enjoy over classical ones. I argue that this view is not tenable. Using a toy algorithm I show that the Many-Worlds Interpretation must crucially use the ontological status of the universal state vector to explain quantum computational efficiency, as opposed to the particular ontology of the MWI, that is, the computational histories of worlds. (...)
    Remove from this list | Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  6. Eliseo Fernández (2008). A Triadic Theory of Elementary Particle Interactions and Quantum Computation (Review). Transactions of the Charles S. Peirce Society 44 (2):pp. 384-389.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  7. Amit Hagar, To Balance a Pencil on its Tip: On the Passive Approach to Quantum Error Correction.
    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 (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  8. Amit Hagar (2011). The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction. Morgan & Claypool Publishers.
    In quantum computing, where algorithms exist that can solve computational problems more efficiently than any known classical algorithms, the elimination of errors that result from external disturbances or from imperfect gates has become the ...
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  9. Amit Hagar, Quantum Computing. Stanford Encyclopedia of Philosophy.
    Combining physics, mathematics and computer science, quantum computing has developed in the past two decades from a visionary idea to one of the most fascinating areas of quantum mechanics. The recent excitement in this lively and speculative domain of research was triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially "speed up" classical computation and factor large numbers into primes much more rapidly (at least in terms of the number of computational steps involved) than any known (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  10. Amit Hagar (2007). Quantum Algorithms: Philosophical Lessons. Minds and Machines 17 (2).
    I discuss the philosophical implications that the rising new science of quantum computing may have on the philosophy of computer science. While quantum algorithms leave the notion of Turing-Computability intact, they may re-describe the abstract space of computational complexity theory hence militate against the autonomous character of some of the concepts and categories of computer science.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  11. Amit Hagar & Alex Korolev (2007). Quantum Hypercomputation—Hype or Computation? Philosophy of Science 74 (3):347-363.
    A recent attempt to compute a (recursion‐theoretic) noncomputable function using the quantum adiabatic algorithm is criticized and found wanting. Quantum algorithms may outperform classical algorithms in some cases, but so far they retain the classical (recursion‐theoretic) notion of computability. A speculation is then offered as to where the putative power of quantum computers may come from.
    Remove from this list | Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  12. Amit Hagar & Alexandre Korolev (2006). Quantum Hypercomputability? Minds and Machines 16 (1).
    A recent proposal to solve the halting problem with the quantum adiabatic algorithm is criticized and found wanting. Contrary to other physical hypercomputers, where one believes that a physical process “computes” a (recursive-theoretic) non-computable function simply because one believes the physical theory that presumably governs or describes such process, believing the theory (i.e., quantum mechanics) in the case of the quantum adiabatic “hypercomputer” is tantamount to acknowledging that the hypercomputer cannot perform its task.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  13. Amit Hagar & Giuseppe Sergioli, Counting Steps: A New Interpretation of Objective Probability in Physics.
    We propose a new interpretation of objective deterministic chances in statistical physics based on physical computational complexity. This notion applies to a single physical system (be it an experimental set--up in the lab, or a subsystem of the universe), and quantifies (1) the difficulty to realize a physical state given another, (2) the 'distance' (in terms of physical resources) from a physical state to another, and (3) the size of the set of time--complexity functions that are compatible with the physical (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  14. Stuart R. Hameroff, Consciousness, Whitehead and Quantum Computation in the Brain: Panprotopsychism Meets the Physics of Fundamental Spacetime Geometry.
    _dualism_ (consciousness lies outside knowable science), _emergence_ (consciousness arises as a novel property from complex computational dynamics in the brain), and some form of _panpsychism_, _pan-protopsychism, or pan-experientialism_ (essential features or precursors of consciousness are fundamental components of reality which are accessed by brain processes). In addition to 1) the problem of subjective experience, other related enigmatic features of consciousness persist, defying technological and philosophical inroads. These include 2) the “binding problem”—how disparate brain activities give rise to a unified sense (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  15. Stuart R. Hameroff (2002). Quantum Computation in Brain Microtubules. Physical Review E 65 (6).
    Proposals for quantum computation rely on superposed states implementing multiple computations simultaneously, in parallel, according to quantum linear superposition (e.g., Benioff, 1982; Feynman, 1986; Deutsch, 1985, Deutsch and Josza, 1992). In principle, quantum computation is capable of specific applications beyond the reach of classical computing (e.g., Shor, 1994). A number of technological systems aimed at realizing these proposals have been suggested and are being evaluated as possible substrates for quantum computers (e.g. trapped ions, electron spins, quantum dots, nuclear spins, etc., (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  16. M. J. (2001). On Bits and Quanta - Hoi-Kwong Lo, Sandu Popescu and Tim Spiller (Eds), Introduction to Quantum Computation and Information (Singapore: World Scientific, 1998), XI+348 Pp., ISBN 981-02-3399-X, £35, US$52. [REVIEW] Studies in History and Philosophy of Science Part B 32 (1):143-150.
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  17. Antonio Ledda, Martinvaldo Konig, Francesco Paoli & Roberto Giuntini (2006). MV-Algebras and Quantum Computation. Studia Logica 82 (2):245 - 270.
    We introduce a generalization of MV algebras motivated by the investigations into the structure of quantum logical gates. After laying down the foundations of the structure theory for such quasi-MV algebras, we show that every quasi-MV algebra is embeddable into the direct product of an MV algebra and a “flat” quasi-MV algebra, and prove a completeness result w.r.t. a standard quasi-MV algebra over the complex numbers.
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. Ignazio Licata & Ammar Sakaji (eds.) (2008). Physics of Emergence and Organization. World Scientific.
    This book is a state-of-the-art review on the Physics of Emergence. Foreword v Gregory J. Chaitin Preface vii Ignazio Licata Emergence and Computation at the Edge of Classical and Quantum Systems 1 Ignazio Licata Gauge Generalized Principle for Complex Systems 27 Germano Resconi Undoing Quantum Measurement: Novel Twists to the Physical Account of Time 61 Avshalom C. Elitzur and Shahar Dolev Process Physics: Quantum Theories as Models of Complexity 77 Kirsty Kitto A Cross-disciplinary Framework for the Description of Contextually Mediated (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation  
  19. Jacques Mallah, The Many Computations Interpretation (MCI) of Quantum Mechanics.
    Computationalism provides a framework for understanding how a mathematically describable physical world could give rise to conscious observations without the need for dualism. A criterion is proposed for the implementation of computations by physical systems, which has been a problem for computationalism. Together with an independence criterion for implementations this would allow, in principle, prediction of probabilities for various observations based on counting implementations. Applied to quantum mechanics, this results in a Many Computations Interpretation (MCI), which is an explicit form (...)
    Remove from this list | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  20. Stephen Pink & Stanley Martens, Schroedinger's Register: Foundational Issues and Physical Realization.
    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 (...)
    Remove from this list | Direct download  
     
    My bibliography  
     
    Export citation