Boolean Functions, Quantum Bits, and Feasibility

Richard J. Lipton, Kenneth W. Regan

Published Jan 1, 2014• 0 citations

Abstract

This chapter contains sections titled: 4.1 Feasible Boolean Functions, 4.2 An Example, 4.3 Quantum Representation of Boolean Arguments, 4.4 Quantum Feasibility, 4.5 Problems, 4.6 Summary and Notes

Related papers

Quantum information processing 2: the quantum emulation of arbitrary Boolean functions

Helmut Bez, Tony Croft

Chapters 15 and 16 relate to the quantum emulation, and unitary extension, of a number of special invertible Boolean functions. In this chapter, we turn our attention to the quantum emulation of arbitrary Boolean functions. This extends the work of Chapters 15 and 16 in two respects: to arbitrary invertible Boolean functions, and to arbitrary non-invertible Boolean functions.

Chapman & Hall/CRC eBooksJan 6, 20230 citations

Phil's Algorithm

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 7.1 The Algorithm, 7.2 The Analysis, 7.3 An Example, 7.4 A Two-Qubit Example, 7.5 Phil Measures Up, 7.6 Quantum Mazes versus Circuits versus Matrices, 7.7 Problems, 7.8 Summary and Notes

Jan 1, 20140 citations

A note on quantum black-box complexity of almost all Boolean functions

Andris Ambainis

arXiv:quant-ph/9811080Information Processing LettersJul 1, 199923 citations

Classical Bits and Classical Gates

Binayak Samadder Choudhury, Soumen Samanta

In this chapter, a review of concepts of classical bits and gates. It is required for a correlation with the corresponding quantum concepts given in later chapters. References [ 54 , 55 , 147 , 155 ] are useful for an in-depth study on the subjects of the chapter.

Chapman & Hall/CRC eBooksDec 10, 20250 citations

The Deutsch-Jozsa Algorithm

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 9.1 The Algorithm, 9.2 The Analysis, 9.3 Problems, 9.4 Summary and Notes

Jan 1, 20140 citations

Deutsch's Algorithm

Richard J. Lipton, Kenneth W. Regan

This chapter contains sections titled: 8.1 The Algorithm, 8.2 The Analysis, 8.3 Superdense Coding and Teleportation, 8.4 Problems, 8.5 Summary and Notes

Jan 1, 20140 citations