#### Supplemental Presentations

#### 79 Citations

The energy requirement of quantum processors.

- Mathematics
- 2019

We establish a general bound on the amount of energy required to implement quantum circuits and prove its achievability within a constant factor. The energy requirement for quantum circuits is… Expand

Non-Signaling Parallel Repetition Using de Finetti Reductions

- Physics, Computer Science
- IEEE Transactions on Information Theory
- 2016

A threshold theorem is proved stating that the probability that non-signaling players win more than a fraction 1-α+β of the n games is exponentially small in nβ2 for every 0 ≤ β ≤ α. Expand

Chapter 3 : Quantum Computing

- 2007

Quantum Computation (QC) is a type of computation where unitary and measurement operations are executed on linear superpositions of basis states. This paper provides a brief introduction to QC. We… Expand

Quantum Information Processing : Algorithms , Technologies and Challenges

- 2007

Quantum Computation (QC) is a type of computation where unitary and measurement operations are executed on linear superpositions of basis states. This paper provides a brief introduction to QC. We… Expand

Read-only-memory-based quantum computation: Experimental explorations using nuclear magnetic resonance and future prospects

- Physics
- 2002

Read-only-memory-based (ROM-based) quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less "magical," and being more suited to implementing space-efficient… Expand

Continuous-variable and hybrid quantum gates

- Physics
- 2001

We provide several schemes to construct the continuous-variable SWAP gate and present a Hermitian generalized many-body continuous controlled n -NOT gate. We introduce and study the hybrid… Expand

Logic over Words on Denumerable Ordinals

- Computer Science, Mathematics
- J. Comput. Syst. Sci.
- 2001

The main result is the extension of the theorem of Schutzenberger, McNaughton, and Papert on star-free sets of finite words to languages of words of countable length and another proof of the equivalence between automata and monadic second-order sentences is given. Expand

Periodic binary harmonic functions

- Physics, Mathematics
- 2006

A function on a (generally infinite) graph $\G$ with values in a field $K$ of characteristic 2 will be called {\it harmonic} if its value at every vertex of $\G$ is the sum of its values over all… Expand

- Automata and Chebyshev-PolynomialsKlaus

- 1996

A-automaton is a simple additive, binary cellular automaton on a graph. For product graphs such as a grids and cylinders, reversibility and periodicity properties of the corresponding automaton can… Expand

Reversible bootstrap percolation: Fake news and fact checking.

- Medicine, Physics
- Physical review. E
- 2020

A reversible bootstrap percolation process is constructed, which converges to extra solutions displaying a hysteresis typical of discontinuous phase transitions and provides a reasonable model for fake news spreading and the effectiveness of fact checking. Expand