Birkhäuser Basel eBooks

Boolean Algebra

Yorick Hardy, Willi-Hans Steeb

Published Jan 1, 2001• 0 citations

Abstract

Boolean algebra forms the theoretical basis for classical computing. It can be used to describe the circuits which are used as building blocks for classical computing. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

DOI: 10.1007/978-3-0348-8366-5_2

Related papers

Quantum Bits and Quantum Computation

Yorick Hardy, Willi-Hans Steeb

Digital computers are based on devices that can take on only two states, one of which is denoted by 0 and the other by 1. By concatenating several 0s and is together, 0-1 combinations can be formed to represent as many different entities as desired. A combination containing a single 0 or 1 is called a bit. In general, n bits can be used to distinguish among 2 n distinct entities and each addition of a bit doubles the number of possible combinations. Computers use strings of bits to represent numbers, letters, punctuation marks, and any other useful pieces of information. In a classical computer, the processing of information is done by logic gate. A logic gate maps the state of its input bits into another state according to a truth table. Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counterpart. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Basel eBooksJan 1, 20010 citations

Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing

Ivan Damgård, Sarah Zakarias

We present a protocol for securely computing a Boolean circuit C in presence of a dishonest and malicious majority. The protocol is unconditionally secure, assuming a preprocessing functionality that is not given the inputs. For a large number of players the work for each player is the same as computing the circuit in the clear, up to a constant factor. Our protocol is the first to obtain these properties for Boolean circuits. On the technical side, we develop new homomorphic authentication schemes based on asymptotically good codes with an additional multiplication property. We also show a new algorithm for verifying the product of Boolean matrices in quadratic time with exponentially small error probability, where previous methods only achieved constant error. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Lecture notes in computer scienceJan 1, 201396 citations

Traditional Computing

Alice Flarend, Bob Hilborn

Abstract Alice and Bob explain the difference between classical (traditional) computing and quantum computing, deploying a gentle introduction to classical binary digits (bits) beginning with a brief history of the development of quantum mechanics and computer architecture. The abstract backbone of classical computing is logic gates, which represent changes to input bits under specific rules. These rules, governed by Boolean, logic can be summarized in truth tables, giving the output values for specific input values. The most common classical gates—NOT, AND, NAND, and XOR gates—are introduced. The vocabulary of classical computing provides the basis for understanding quantum computing.

Apr 15, 20220 citations

Learning Spectral Properties of Boolean Functions: A Unifying Theme in Quantum Algorithms

Mohsen Heidari, Amr Sabry

Quantum computing algorithms are often presented with a notation and perspective inspired by physics. We instead relate a family of quantum algorithms to the classical problem of learning spectral properties of boolean functions.

International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)Sep 16, 20240 citations

Coherent State Path Integrals

John R. Klauder

The usual, irreducible Heisenberg operators Q and P are the basic building blocks of the operators in quantum mechanics. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Applied and numerical harmonic analysisOct 28, 20101 citation

Logical Structures Arising in Quantum Theory

Simon Kochen, Ernst P. Specker

The logical structures studied in this paper are generalizations of the propositional calculus. The classical propositional calculus is essentially Boolean algebra or, alternatively, the theory of functions on an arbitrary set S with values in a two-element set. The generalization consists in allowing partial functions on the set S , i.e., functions defined on certain subsets of S , and defining an equivalence relation among these functions such that any two constant functions with the same constant value belong to the same equivalence class. The generalization is equally natural for functions with values in the field of real numbers and we shall consider this case first. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Basel eBooksJan 1, 199082 citations