Michael E Cuffaro
Biographic Data
| ID | 1002107 |
|---|---|
| NAME | Michael E Cuffaro |
| GIVEN NAMES | Michael E |
| FAMILY NAME | Cuffaro |
| SIGNATURE | CUFFARO M E |
| AFFILIATIONS | Western University |
| ORCID | 0000-0003-4477-5601 |
| VERIFIED | Yes |
| TOTAL WORKS | 8 |
| TOTAL CITATIONS | 14 |
| WORKS AS AUTHOR | 8 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2010 |
| LATEST PUBLICATION YEAR | 2020 |
| H-INDEX | 3 |
Information causality, the Tsirelson bound, and the ‘being-thus’ of things
Reconsidering No-Go Theorems from a Practical Perspective
I argue that our judgements regarding the locally causal models that are compatible with a given constraint implicitly depend, in part, on the context of inquiry. It follows from this that certain quantum no-go theorems, which are particularly striking in the traditional foundational context, have no force when the context switches to a discussion of the physical systems we are capable of building with the aim of classically reproducing quantum s…
On the Significance of the Gottesman–Knill Theorem
According to the Gottesman–Knill theorem, quantum algorithms that utilize only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states, it is commonly concluded that entanglement is insufficient to enable quantum computers to outperform classical computers. I argue in this article that this conclusion is misleading. First, the statement of the t…
How-Possibly Explanations in (Quantum) Computer Science
A primary goal of quantum computer science is to find an explanation for the fact that quantum computers are more powerful than classical computers. In this paper I argue that to answer this question is to compare algorithmic processes of various kinds and to describe the possibility spaces associated with these processes. By doing this, we explain how it is possible for one process to outperform its rival. Further, in this and similar examples l…
On the Debate Concerning the Proper Characterization of Quantum Dynamical Evolution
There has been a long-standing and sometimes passionate debate between physicists over whether a dynamical framework for quantum systems should incorporate not completely positive (NCP) maps in addition to completely positive (CP) maps. Despite the reasonableness of the arguments for complete positivity, we argue that NCP maps should be allowed, with a qualification: these should be understood, not as reflecting ‘not completely positive’ evolutio…
Many worlds, the cluster-state quantum computer, and the problem of the preferred basis
The conditions of tolerance
The philosophical tradition of liberal political thought has come to see tolerance as a crucial element of a liberal political order. However, while much has been made of the value of toleration, little work has been done on individual-level motivations for tolerant behavior. In this article, we seek to develop an account of the rational motivations for toleration and of where the limits of toleration lie. We first present a very simple model of …
The Kantian framework of complementarity
The conditions of tolerance
The philosophical tradition of liberal political thought has come to see tolerance as a crucial element of a liberal political order. However, while much has been made of the value of toleration, little work has been done on individual-level motivations for tolerant behavior. In this article, we seek to develop an account of the rational motivations for toleration and of where the limits of toleration lie. We first present a very simple model of …
On the Significance of the Gottesman–Knill Theorem
According to the Gottesman–Knill theorem, quantum algorithms that utilize only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states, it is commonly concluded that entanglement is insufficient to enable quantum computers to outperform classical computers. I argue in this article that this conclusion is misleading. First, the statement of the t…
How-Possibly Explanations in (Quantum) Computer Science
A primary goal of quantum computer science is to find an explanation for the fact that quantum computers are more powerful than classical computers. In this paper I argue that to answer this question is to compare algorithmic processes of various kinds and to describe the possibility spaces associated with these processes. By doing this, we explain how it is possible for one process to outperform its rival. Further, in this and similar examples l…
Reconsidering No-Go Theorems from a Practical Perspective
I argue that our judgements regarding the locally causal models that are compatible with a given constraint implicitly depend, in part, on the context of inquiry. It follows from this that certain quantum no-go theorems, which are particularly striking in the traditional foundational context, have no force when the context switches to a discussion of the physical systems we are capable of building with the aim of classically reproducing quantum s…
The Kantian framework of complementarity
The conditions of tolerance
The philosophical tradition of liberal political thought has come to see tolerance as a crucial element of a liberal political order. However, while much has been made of the value of toleration, little work has been done on individual-level motivations for tolerant behavior. In this article, we seek to develop an account of the rational motivations for toleration and of where the limits of toleration lie. We first present a very simple model of …
Many worlds, the cluster-state quantum computer, and the problem of the preferred basis
On the Debate Concerning the Proper Characterization of Quantum Dynamical Evolution
There has been a long-standing and sometimes passionate debate between physicists over whether a dynamical framework for quantum systems should incorporate not completely positive (NCP) maps in addition to completely positive (CP) maps. Despite the reasonableness of the arguments for complete positivity, we argue that NCP maps should be allowed, with a qualification: these should be understood, not as reflecting ‘not completely positive’ evolutio…
How-Possibly Explanations in (Quantum) Computer Science
A primary goal of quantum computer science is to find an explanation for the fact that quantum computers are more powerful than classical computers. In this paper I argue that to answer this question is to compare algorithmic processes of various kinds and to describe the possibility spaces associated with these processes. By doing this, we explain how it is possible for one process to outperform its rival. Further, in this and similar examples l…
On the Significance of the Gottesman–Knill Theorem
According to the Gottesman–Knill theorem, quantum algorithms that utilize only the operations belonging to a certain restricted set are efficiently simulable classically. Since some of the operations in this set generate entangled states, it is commonly concluded that entanglement is insufficient to enable quantum computers to outperform classical computers. I argue in this article that this conclusion is misleading. First, the statement of the t…
Reconsidering No-Go Theorems from a Practical Perspective
I argue that our judgements regarding the locally causal models that are compatible with a given constraint implicitly depend, in part, on the context of inquiry. It follows from this that certain quantum no-go theorems, which are particularly striking in the traditional foundational context, have no force when the context switches to a discussion of the physical systems we are capable of building with the aim of classically reproducing quantum s…
Information causality, the Tsirelson bound, and the ‘being-thus’ of things
Quantum (7 works) · Quantum Mechanics and Applications (7 works) · Physics (5 works) · Quantum mechanics (5 works) · Epistemology (4 works) · Philosophy (4 works) · Computer Science (3 works) · Quantum computer (3 works) · Quantum Computing Algorithms and Architecture (3 works) · Quantum Information and Cryptography (3 works)