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

Conference on Lasers and Electro-Optics

Quantum mechanical computers

Richard P. Feynman

Published Jan 1, 1984• 71 citations
Publisher

Abstract

A computer is imagined in which all the parts are simple two-state objects obeying quantum mechanical laws. A time-independent Hamiltonian for such a system is written and analyzed. The computation is done in logically reversible steps. It is used to study possible limitations on computers due to fundamental physical laws. The ideal machine can run ballistically, coasting through the calculation in a short time TB. If there are imperfections due to irregularities in construction or finite temperatures the forward moving calculation is often reversed or scattered. External work must be done to drag the computer forward. The free energy lost in doing a calculation is kT In2 per logical step divided by turn factors. One is the mean free number of steps per scattering, measuring how perfectly the machine is built. The other is the mean time (divided by TB) that the calculation actually takes, which measures how gently you urge it forward.

DOI
10.1364/cleo.1984.tuaa2

Related papers

Quantum Mechanical Computers

Richard P. Feynman

In this chapter, the authors discuss the part in an effort to analyze the physical limitations of computers due to the laws of physics. It is a result of computer science that a universal computer can be made by a suitably complex network of interconnected primitive elements. A more elaborate circuit is a full adder which takes a carry, c , and adds it to the two lines a and b and has an additional line, d, with a 0 input. Calculations can be done with reversible machines containing only reversible primitives. There are many sources of imperfections in the machine, but the first one people would like to consider is the possibility that the coefficients in the couplings, along the program line, are not exactly equal. The switches are represented by diagonal lines, and in boxes put the other matrices that operate on registers such as the NOT b .

CRC Press eBooks•Jul 3, 2018•1 citation

Quantum Mechanical Computers

Richard P. Feynman, Tony Hey

In this chapter, the authors discuss a part in an effort to analyze the physical limitations of computers due to the laws of physics. It is a result of computer science that a universal computer can be made by a suitably complex network of interconnected primitive elements. There are, however, a number of questions that the people would like to discuss in more detail such as the question of imperfections. It is analogous to the use of transistors in conventional machines where the people don't properly use all the analog continuum of the behavior of transistors, but just try to run them as saturated on or off digital devices so the logical analysis of the system behavior is easier. Of course the large system obeys quantum mechanics, but it is in interaction with the heat baths and other things that could make it effectively irreversible.

CRC Press eBooks•Mar 15, 2023•38 citations

Quantum computing in Fortran

Adriaan Albert Markus

Quantum computing is the delicate art of using a quantum-mechanical system to perform some kind of computation. Such a system differs in a number of significant ways from ordinary computers:• A quantum computer actually does a lot of computations at the same time, each solution is represented by a particular possible state. This is inherent to the physical properties of such a system.• Unless you are sure that you have reached the final (unique) solution, you can not "look" at the "values" of the variables in the computer program that is being run: since all solutions are possible at the same time, observing the values will influence the system and put it into one particular, but otherwise arbitrary, state.• All computations must be reversible, that is, a statement like "a = 5" can only appear in the initialization phase of a program, because the previous value will be lost. On the other hand, a statement like "a = a + 5" is reversible, since you can retrieve the original value.The properties of such a quantum computer make it possible to devise very efficient algorithms. One such algorithm, described by L. Grover (see the references), is searching in an unsorted array of items. With ordinary computers this can not be done more efficiently than in O (N) steps (an exhaustive search: each item is examined in the worst case), with this quantum algorithm, however, the number of steps needed is O (N 1/2 ).Devising quantum algorithms requires a thorough understanding of quantum mechanics, there is no doubt about that. Another question is: do we need quantum computers and special programming languages to program (or perhaps emulate) these algorithms? This article tries to show that, at least for the quantum search algorithm, a classical programming language like Fortran is quite fit (yes, the pun is fortunate).

ACM SIGPLAN Fortran Forum•Aug 1, 2004•2 citations

Introduction and Background

Phillip Kaye, Raymond Laflamme, Michele Mosca

A computer is a physical device that helps us process information by executing algorithms. An algorithm is a well-defined procedure, with finite description, for realizing an information-processing task. An information-processing task can always be translated into a physical task. When designing complex algorithms and protocols for various information-processing tasks, it is very helpful, perhaps essential, to work with some idealized computing model. However, when studying the true limitations of a computing device, especially for some practical reason, it is important not to forget the relationship between computing and physics. Real computing devices are embodied in a larger and often richer physical reality than is represented by the idealized computing model. Quantum information processing is the result of using the physical reality that quantum theory tells us about for the purposes of performing tasks that were previously thought impossible or infeasible. Devices that perform quantum information processing are known as quantum computers. In this book we examine how quantum computers can be used to solve certain problems more efficiently than can be done with classical computers, and also how this can be done reliably even when there is a possibility for errors to occur. In this first chapter we present some fundamental notions of computation theory and quantum physics that will form the basis for much of what follows. After this brief introduction, we will review the necessary tools from linear algebra in Chapter 2, and detail the framework of quantum mechanics, as relevant to our model of quantum computation, in Chapter 3. In the remainder of the book we examine quantum teleportation, quantum algorithms and quantum error correction in detail. We are often interested in the amount of resources used by a computer to solve a problem, and we refer to this as the complexity of the computation. An important resource for a computer is time. Another resource is space, which refers to the amount of memory used by the computer in performing the computation. We measure the amount of a resource used in a computation for solving a given problem as a function of the length of the input of an instance of that problem.

Oxford University Press eBooks•Nov 16, 2006•0 citations

Is what we see a projection? Objects as the common part of two points of view, tested on a quantum-Darwinism model

Ugo Lanciano

Common introduction to all the records of this series. Already read it? Skip to the content of this record ↓ Mathematical Materiality (MM) in brief. Why are the laws of physics the same everywhere and at every instant, even though nothing forces matter to obey them? MM proposes an answer: the laws are not rules imposed on matter from the outside; rather, matter itself is made of mathematical relations. And mathematics cannot change: a relation binds two distinct terms everywhere and always. In logic, nothing exists on its own: to exist means to be in relation to another logical entity, and outside this web of relations nothing can exist, not even other universes. This reading is already compared with experimental measurements at two points. First, the ratio of dark to ordinary matter is read as 3√3 = 5.196; when left free in the fits, Planck and DESI DR2 data give 5.21–5.22 (as registered in record 2.44, https://doi.org/10.5281/zenodo.23329080). Second, the acceleration scale of galaxies is read as a₀ = cH₀/6, the same scale that appears in Verlinde's emergent gravity: the computed value is 1.09–1.18 × 10⁻¹⁰ m/s² against the measured value of 1.20 × 10⁻¹⁰ m/s² (record 2.46.1, https://doi.org/10.5281/zenodo.23506655). Both readings were formulated with the measurements already known; the tests to check them against future data are registered in the same records. MM also changes the picture of the world. Reality is not made of separate objects, each complete in itself, in empty space: it is a material structure whose nature is a logical description. The observer does not look at it from outside: it is inside it, and always finds the logical mirror of its own position in front of itself. The objects it sees are, necessarily, diffractions of its point of view: the parts into which its description divides, like a unit into fractions. But each object in turn exists in its own logical mirror, exactly like its observer. This is why things do not exist only when someone looks at them, and yet none exists on its own: every property of a thing is a link with its observer. For MM, this is the only rational answer to the opening question: if everything is made of the relations that the laws describe, nothing can escape the laws and no one has to enforce them. For this reason the universe behaves like a simulation without really being one. It follows exact rules, made of counts, everywhere and at every instant, but no machine runs them and no programmer wrote them: a structure of mathematical relations does not need to be computed in order to exist. Tegmark (2008) had already noted that such a simulation need not be run, while Vazza (2025) estimated that running it physically on a machine would require resources that the very laws of the universe do not allow. In the first logical nexus between space and time — which relativity describes together as a single spacetime — there is a non-local phase, made only of a pure logical distinction: space is not time. In this phase, between space and time there is no relation of quantitative calculation, only the logical entity they have in common, which is needed to make them exist with respect to each other: we shall call this entity their greatest common divisor (GCD), just as the numbers 3 and 5 have only 1 in common. "Non-local" here does not mean that something is confined far away or acts at a distance: it means that the non-local phase is in no place and at no instant, while being present in every phase of reality, in every place and at every instant (MM 2.72). This non-local phase manifests itself in entanglement: two distant systems, without anything physically travelling from one to the other, remain correlated more strongly than any explanation based on separate properties and on the absence of faster-than-light influences allows: this is the violation of Bell's inequalities. The local world arises when a relation is counted through this GCD: its multiples and its fractions form a matrix. Seen by an observer inside the system like us, the multiples, which follow one another in a chain that never reverses, appear as time; the fractions, which stand side by side, appear as space. When that same multiple is directly contained in the matrix of the point of observation, it turns into mass — that is, into concrete matter as we usually understand it. There is therefore a close link between time and mass, which physics also recognizes: every mass has its own rhythm, its Compton frequency mc²/h (MM 2.64.1). The observed objects, while being logically autonomous entities in their local relations, enter into relation with the observer through the logical diffraction of the observer's matrix. Where space and objects come from can be shown with a simple fraction. The whole is the GCD of the point of observation, the 1 from which every description starts. The denominator tells how many equal parts this 1 is divided into: they are the fractions side by side that appear as space, the grain with which the observer tells things apart. The numerator tells how many of those parts an object occupies: it is its size as seen from that point. The parts that no object occupies appear as empty space: not a container that was there before, but divisions of the observer's 1. Full or empty, all the parts are fractions of the same 1: what makes them a single description is the non-local phase, which lies in no single part yet is present in all of them. And just as 3/8 and 6/16 have the same value, if the 1 is divided into parts half as large, the object occupies twice as many: its size is the ratio, which does not change. Mass, by contrast, does not lie in the fraction but in the multiple contained in the matrix of the point of observation: it is the count that repeats, the rhythm mentioned above. This reading also gives a reason for the limit of the speed of light, which in Einstein's relativity is instead taken as a starting principle. The speed of light is the fixed exchange rate between the multiples and the fractions of the same GCD, meaning how much space a single step of time is worth: exceeding it would mean, for some observer, covering space without counting time, and thus leaving the local world. Logic always starts from a logical relative, and this exchange rate has nothing absolute in itself either: it is a necessary relative which, inside the system, becomes an absolute hypothesis, the same for everyone and impossible to exceed. Outside the system, by contrast, it has no justification at all, because outside there is only non-existence: justifying something requires another term to relate it to, and out there there is none. Asking for a reason from outside is like asking what lies north of the North Pole. The same theoretical framework that reads space, time, mass and the observed objects also admits quantum mechanics. The non-local phase and the mirror-like logical reciprocity between the two ends of the nexus give a reason for the probabilistic behaviour of matter. When the mass of the observed object is large enough compared with that of the point of observation, it fixes the object in the matrix of the latter: for this reason we see it in one precise place and at one precise instant. When instead this ratio falls below a certain threshold, the principal GCD (that of the point of observation) and the GCD of the diffraction that generates the object are forced to become equal, and they reflect each other as in a mirror. At that point the object no longer occupies a single point of the spacetime generated by the observer, but spreads over several possible positions, and we observe it as probability. It is like having to describe the number 10 using only the number 1: the only way is to distribute the 1 into ten copies, one for each unit of the 10. The probability here is not that of a die: these copies add up like waves and can also cancel each other out. This adding up and cancelling out is called interference. It can be seen in the double-slit experiment: where the waves arrive in step the screen lights up, and where they arrive out of step they cancel each other and leave dark stripes, the "dark fringes". This is what separates quantum probability from the probability of someone who simply does not know: the possibilities of a hidden die only add up, they never cancel. In quantum mechanics the probability of finding the object at a point is given by the Born rule: it is the squared modulus of the amplitude of the wave at that point, and the larger the amplitude there, the more likely it is to find the object there. In MM this rule follows from counting the copies, under three stated hypotheses (MM 2.48.2). And the cancellations appear only if the copies carry a wave phase, that is, if, like waves, they can be at a crest or a trough and so cancel each other out. In MM, if what is observed at each place follows the Born rule, entanglement too has a ceiling, the same as in quantum mechanics. The correlations between two distant systems exceed those that any classical explanation allows, but not by as much as one likes: in the quantity measured in these experiments (CHSH), classical explanations reach at most 2, quantum mechanics 2√2, about 2.83 (Tsirelson's bound). Measurements so far are compatible with this ceiling (MM 2.48.2). It remains to be understood how far all this goes. Today we know that even objects made of thousands of atoms spread over several positions, and no experiment has yet found a mass beyond which an object stops doing so and returns to a single place. That the transition depends on mass is an idea close to that of the physicists Roger Penrose and Lajos Diósi, for whom, however, the time within which an object stops being in several positions depends only on the object itself, on its mass and on how that mass is distributed. In MM, by contrast, probabilistic behaviour arises from a ratio. The threshold is the point at which the two GCDs, the principal one

•Oct 24, 2026•3 citations

Quantum computing

Jens Eisert, Michael M. Wolf

Quantum mechanics is one of the cornerstones of modern physics. It governs the behavior and the properties of matter in a fundamental way, in particular on the microscopic scale of atoms and molecules. Hence, what we may call a classical computer, i.e., those machines on or under the desktops in our offices together with all their potential descendants, are themselves following the rules of quantum mechanics. However, they are no quantum computers in the sense that all the inside information processing can perfectly be described within classical information theory. In fact, we do not need quantum mechanics in order to explain how the zeros and ones – the bits – inside a classical computer evolve. The reason for this is that the architecture of classical computers does not make use of one of the most fundamental features of quantum mechanics, namely the possibility of superpositions. Throughout the entire processing of any program on a classical computer, each of the involved bits takes on either the value zero or one. Quantum mechanics, however, would in addition allow superpositions of zeros one ones, that is bits – now called qubits (quantum-bits) – which are somehow in the state zero and one at the

•Jan 5, 2004•15 citations
A computer is imagined in which all the parts are simple two-state objects obeying quantum mechanical laws. A time-independent Hamiltonian for such a system is written and analyzed. The computation is done in logically reversible steps. It is used to study possible limitations on computers due to fundamental physical laws. The ideal machine can run ballistically, coasting through the calculation in a short time TB. If there are imperfections due to irregularities in construction or finite temperatures the forward moving calculation is often reversed or scattered. External work must be done to drag the computer forward. The free energy lost in doing a calculation is kT In2 per logical step divided by turn factors. One is the mean free number of steps per scattering, measuring how perfectly the machine is built. The other is the mean time (divided by TB) that the calculation actually takes, which measures how gently you urge it forward.
In this chapter, the authors discuss the part in an effort to analyze the physical limitations of computers due to the laws of physics. It is a result of computer science that a universal computer can be made by a suitably complex network of interconnected primitive elements. A more elaborate circuit is a full adder which takes a carry, c , and adds it to the two lines a and b and has an additional line, d, with a 0 input. Calculations can be done with reversible machines containing only reversible primitives. There are many sources of imperfections in the machine, but the first one people would like to consider is the possibility that the coefficients in the couplings, along the program line, are not exactly equal. The switches are represented by diagonal lines, and in boxes put the other matrices that operate on registers such as the NOT b .
In this chapter, the authors discuss a part in an effort to analyze the physical limitations of computers due to the laws of physics. It is a result of computer science that a universal computer can be made by a suitably complex network of interconnected primitive elements. There are, however, a number of questions that the people would like to discuss in more detail such as the question of imperfections. It is analogous to the use of transistors in conventional machines where the people don't properly use all the analog continuum of the behavior of transistors, but just try to run them as saturated on or off digital devices so the logical analysis of the system behavior is easier. Of course the large system obeys quantum mechanics, but it is in interaction with the heat baths and other things that could make it effectively irreversible.
Quantum computing is the delicate art of using a quantum-mechanical system to perform some kind of computation. Such a system differs in a number of significant ways from ordinary computers:• A quantum computer actually does a lot of computations at the same time, each solution is represented by a particular possible state. This is inherent to the physical properties of such a system.• Unless you are sure that you have reached the final (unique) solution, you can not "look" at the "values" of the variables in the computer program that is being run: since all solutions are possible at the same time, observing the values will influence the system and put it into one particular, but otherwise arbitrary, state.• All computations must be reversible, that is, a statement like "a = 5" can only appear in the initialization phase of a program, because the previous value will be lost. On the other hand, a statement like "a = a + 5" is reversible, since you can retrieve the original value.The properties of such a quantum computer make it possible to devise very efficient algorithms. One such algorithm, described by L. Grover (see the references), is searching in an unsorted array of items. With ordinary computers this can not be done more efficiently than in O (N) steps (an exhaustive search: each item is examined in the worst case), with this quantum algorithm, however, the number of steps needed is O (N 1/2 ).Devising quantum algorithms requires a thorough understanding of quantum mechanics, there is no doubt about that. Another question is: do we need quantum computers and special programming languages to program (or perhaps emulate) these algorithms? This article tries to show that, at least for the quantum search algorithm, a classical programming language like Fortran is quite fit (yes, the pun is fortunate).
A computer is a physical device that helps us process information by executing algorithms. An algorithm is a well-defined procedure, with finite description, for realizing an information-processing task. An information-processing task can always be translated into a physical task. When designing complex algorithms and protocols for various information-processing tasks, it is very helpful, perhaps essential, to work with some idealized computing model. However, when studying the true limitations of a computing device, especially for some practical reason, it is important not to forget the relationship between computing and physics. Real computing devices are embodied in a larger and often richer physical reality than is represented by the idealized computing model. Quantum information processing is the result of using the physical reality that quantum theory tells us about for the purposes of performing tasks that were previously thought impossible or infeasible. Devices that perform quantum information processing are known as quantum computers. In this book we examine how quantum computers can be used to solve certain problems more efficiently than can be done with classical computers, and also how this can be done reliably even when there is a possibility for errors to occur. In this first chapter we present some fundamental notions of computation theory and quantum physics that will form the basis for much of what follows. After this brief introduction, we will review the necessary tools from linear algebra in Chapter 2, and detail the framework of quantum mechanics, as relevant to our model of quantum computation, in Chapter 3. In the remainder of the book we examine quantum teleportation, quantum algorithms and quantum error correction in detail. We are often interested in the amount of resources used by a computer to solve a problem, and we refer to this as the complexity of the computation. An important resource for a computer is time. Another resource is space, which refers to the amount of memory used by the computer in performing the computation. We measure the amount of a resource used in a computation for solving a given problem as a function of the length of the input of an instance of that problem.
Common introduction to all the records of this series. Already read it? Skip to the content of this record ↓ Mathematical Materiality (MM) in brief. Why are the laws of physics the same everywhere and at every instant, even though nothing forces matter to obey them? MM proposes an answer: the laws are not rules imposed on matter from the outside; rather, matter itself is made of mathematical relations. And mathematics cannot change: a relation binds two distinct terms everywhere and always. In logic, nothing exists on its own: to exist means to be in relation to another logical entity, and outside this web of relations nothing can exist, not even other universes. This reading is already compared with experimental measurements at two points. First, the ratio of dark to ordinary matter is read as 3√3 = 5.196; when left free in the fits, Planck and DESI DR2 data give 5.21–5.22 (as registered in record 2.44, https://doi.org/10.5281/zenodo.23329080). Second, the acceleration scale of galaxies is read as a₀ = cH₀/6, the same scale that appears in Verlinde's emergent gravity: the computed value is 1.09–1.18 × 10⁻¹⁰ m/s² against the measured value of 1.20 × 10⁻¹⁰ m/s² (record 2.46.1, https://doi.org/10.5281/zenodo.23506655). Both readings were formulated with the measurements already known; the tests to check them against future data are registered in the same records. MM also changes the picture of the world. Reality is not made of separate objects, each complete in itself, in empty space: it is a material structure whose nature is a logical description. The observer does not look at it from outside: it is inside it, and always finds the logical mirror of its own position in front of itself. The objects it sees are, necessarily, diffractions of its point of view: the parts into which its description divides, like a unit into fractions. But each object in turn exists in its own logical mirror, exactly like its observer. This is why things do not exist only when someone looks at them, and yet none exists on its own: every property of a thing is a link with its observer. For MM, this is the only rational answer to the opening question: if everything is made of the relations that the laws describe, nothing can escape the laws and no one has to enforce them. For this reason the universe behaves like a simulation without really being one. It follows exact rules, made of counts, everywhere and at every instant, but no machine runs them and no programmer wrote them: a structure of mathematical relations does not need to be computed in order to exist. Tegmark (2008) had already noted that such a simulation need not be run, while Vazza (2025) estimated that running it physically on a machine would require resources that the very laws of the universe do not allow. In the first logical nexus between space and time — which relativity describes together as a single spacetime — there is a non-local phase, made only of a pure logical distinction: space is not time. In this phase, between space and time there is no relation of quantitative calculation, only the logical entity they have in common, which is needed to make them exist with respect to each other: we shall call this entity their greatest common divisor (GCD), just as the numbers 3 and 5 have only 1 in common. "Non-local" here does not mean that something is confined far away or acts at a distance: it means that the non-local phase is in no place and at no instant, while being present in every phase of reality, in every place and at every instant (MM 2.72). This non-local phase manifests itself in entanglement: two distant systems, without anything physically travelling from one to the other, remain correlated more strongly than any explanation based on separate properties and on the absence of faster-than-light influences allows: this is the violation of Bell's inequalities. The local world arises when a relation is counted through this GCD: its multiples and its fractions form a matrix. Seen by an observer inside the system like us, the multiples, which follow one another in a chain that never reverses, appear as time; the fractions, which stand side by side, appear as space. When that same multiple is directly contained in the matrix of the point of observation, it turns into mass — that is, into concrete matter as we usually understand it. There is therefore a close link between time and mass, which physics also recognizes: every mass has its own rhythm, its Compton frequency mc²/h (MM 2.64.1). The observed objects, while being logically autonomous entities in their local relations, enter into relation with the observer through the logical diffraction of the observer's matrix. Where space and objects come from can be shown with a simple fraction. The whole is the GCD of the point of observation, the 1 from which every description starts. The denominator tells how many equal parts this 1 is divided into: they are the fractions side by side that appear as space, the grain with which the observer tells things apart. The numerator tells how many of those parts an object occupies: it is its size as seen from that point. The parts that no object occupies appear as empty space: not a container that was there before, but divisions of the observer's 1. Full or empty, all the parts are fractions of the same 1: what makes them a single description is the non-local phase, which lies in no single part yet is present in all of them. And just as 3/8 and 6/16 have the same value, if the 1 is divided into parts half as large, the object occupies twice as many: its size is the ratio, which does not change. Mass, by contrast, does not lie in the fraction but in the multiple contained in the matrix of the point of observation: it is the count that repeats, the rhythm mentioned above. This reading also gives a reason for the limit of the speed of light, which in Einstein's relativity is instead taken as a starting principle. The speed of light is the fixed exchange rate between the multiples and the fractions of the same GCD, meaning how much space a single step of time is worth: exceeding it would mean, for some observer, covering space without counting time, and thus leaving the local world. Logic always starts from a logical relative, and this exchange rate has nothing absolute in itself either: it is a necessary relative which, inside the system, becomes an absolute hypothesis, the same for everyone and impossible to exceed. Outside the system, by contrast, it has no justification at all, because outside there is only non-existence: justifying something requires another term to relate it to, and out there there is none. Asking for a reason from outside is like asking what lies north of the North Pole. The same theoretical framework that reads space, time, mass and the observed objects also admits quantum mechanics. The non-local phase and the mirror-like logical reciprocity between the two ends of the nexus give a reason for the probabilistic behaviour of matter. When the mass of the observed object is large enough compared with that of the point of observation, it fixes the object in the matrix of the latter: for this reason we see it in one precise place and at one precise instant. When instead this ratio falls below a certain threshold, the principal GCD (that of the point of observation) and the GCD of the diffraction that generates the object are forced to become equal, and they reflect each other as in a mirror. At that point the object no longer occupies a single point of the spacetime generated by the observer, but spreads over several possible positions, and we observe it as probability. It is like having to describe the number 10 using only the number 1: the only way is to distribute the 1 into ten copies, one for each unit of the 10. The probability here is not that of a die: these copies add up like waves and can also cancel each other out. This adding up and cancelling out is called interference. It can be seen in the double-slit experiment: where the waves arrive in step the screen lights up, and where they arrive out of step they cancel each other and leave dark stripes, the "dark fringes". This is what separates quantum probability from the probability of someone who simply does not know: the possibilities of a hidden die only add up, they never cancel. In quantum mechanics the probability of finding the object at a point is given by the Born rule: it is the squared modulus of the amplitude of the wave at that point, and the larger the amplitude there, the more likely it is to find the object there. In MM this rule follows from counting the copies, under three stated hypotheses (MM 2.48.2). And the cancellations appear only if the copies carry a wave phase, that is, if, like waves, they can be at a crest or a trough and so cancel each other out. In MM, if what is observed at each place follows the Born rule, entanglement too has a ceiling, the same as in quantum mechanics. The correlations between two distant systems exceed those that any classical explanation allows, but not by as much as one likes: in the quantity measured in these experiments (CHSH), classical explanations reach at most 2, quantum mechanics 2√2, about 2.83 (Tsirelson's bound). Measurements so far are compatible with this ceiling (MM 2.48.2). It remains to be understood how far all this goes. Today we know that even objects made of thousands of atoms spread over several positions, and no experiment has yet found a mass beyond which an object stops doing so and returns to a single place. That the transition depends on mass is an idea close to that of the physicists Roger Penrose and Lajos Diósi, for whom, however, the time within which an object stops being in several positions depends only on the object itself, on its mass and on how that mass is distributed. In MM, by contrast, probabilistic behaviour arises from a ratio. The threshold is the point at which the two GCDs, the principal one
Quantum mechanics is one of the cornerstones of modern physics. It governs the behavior and the properties of matter in a fundamental way, in particular on the microscopic scale of atoms and molecules. Hence, what we may call a classical computer, i.e., those machines on or under the desktops in our offices together with all their potential descendants, are themselves following the rules of quantum mechanics. However, they are no quantum computers in the sense that all the inside information processing can perfectly be described within classical information theory. In fact, we do not need quantum mechanics in order to explain how the zeros and ones – the bits – inside a classical computer evolve. The reason for this is that the architecture of classical computers does not make use of one of the most fundamental features of quantum mechanics, namely the possibility of superpositions. Throughout the entire processing of any program on a classical computer, each of the involved bits takes on either the value zero or one. Quantum mechanics, however, would in addition allow superpositions of zeros one ones, that is bits – now called qubits (quantum-bits) – which are somehow in the state zero and one at the