## Quantum communication (1995)

Citations: | 63 - 0 self |

### BibTeX

@TECHREPORT{Nisan95quantumcommunication,

author = {Prof Noam Nisan},

title = {Quantum communication},

institution = {},

year = {1995}

}

### Years of Citing Articles

### OpenURL

### Abstract

1 First, I would like to thank my advisor Noam Nisan. During the two years I have been working with Noam, he has been a most costructive in uence on me, teaching me how to think and write in a clear way. Iwould also liketothankmymyfellow students, who during this time had to su er hearing me lecturing my ideas � this goes especially to Amnon Tashma who hasn't recovered yet. My parents deserve a special thank, not only for getting me up to this point, but also for the help they have given me with the di cult task of writing this thesis in English. Finally I would like tothankmy wife Ruthie for working around my short \mental going to work " periods, unlike the others she will have tocontinue living with me. 2

### Citations

808 | Algorithms for quantum computation: Discrete logarithms and factoring
- Shor
- 1994
(Show Context)
Citation Context ...omputer has capabilities beyond that of the classical Turing machine. This question has attracted great interest (see [3][18][14]). The most remarkable result in this field was obtained by Peter Shor =-=[13]-=- who has shown that using Deutsch's model one can solve the problem of factorization, i.e. finding the prime factors of a natural number. This problem has a long history in the field of mathematics, i... |

479 | Quantum complexity theory
- Bernstein, Vazirani
- 1997
(Show Context)
Citation Context ...putational model, QTM (Quantum Turing Machine), and wondered whether the quantum computer has capabilities beyond that of the classical Turing machine. This question has attracted great interest (see =-=[3]-=-[18][14]). The most remarkable result in this field was obtained by Peter Shor [13] who has shown that using Deutsch's model one can solve the problem of factorization, i.e. finding the prime factors ... |

393 | Simulating physics with computers
- Feynman
(Show Context)
Citation Context ...ics. This fact led to the conviction that computers based on quantum principles belong to the real world, and we should alter our way of thinking and adapt it to the rules of quantum physics. Feymann =-=[7]-=- was the first to ask what effect the behavior of quantum systems would have on computation. He claimed that it is intrinsically expensive to simulate quantum systems using classical computational met... |

385 |
Some complexity questions related to distributive computing
- Yao
- 1979
(Show Context)
Citation Context ...tum coded information have already been realized (see [2][4][8]). 1.3 Quantum communication The quantum communication model is based on the communication model of Yao which was presented in his paper =-=[17]-=-. This model (the classical one) deals with the issue of communication by considering a situation in which two players A; B wish to evaluate a function f(x; y). The input x is known only to A, and y i... |

356 | On the power of quantum computation
- Simon
- 1994
(Show Context)
Citation Context ...nal model, QTM (Quantum Turing Machine), and wondered whether the quantum computer has capabilities beyond that of the classical Turing machine. This question has attracted great interest (see [3][18]=-=[14]-=-). The most remarkable result in this field was obtained by Peter Shor [13] who has shown that using Deutsch's model one can solve the problem of factorization, i.e. finding the prime factors of a nat... |

278 | Quantum circuit complexity
- Yao
- 1997
(Show Context)
Citation Context ...ational model, QTM (Quantum Turing Machine), and wondered whether the quantum computer has capabilities beyond that of the classical Turing machine. This question has attracted great interest (see [3]=-=[18]-=-[14]). The most remarkable result in this field was obtained by Peter Shor [13] who has shown that using Deutsch's model one can solve the problem of factorization, i.e. finding the prime factors of a... |

111 |
Complexity classes in communication complexity theory, 27th FOCS
- Babai, Frankl, et al.
- 1986
(Show Context)
Citation Context ...functions whose 1-round probabilistic communication complexity is polylog(n). First we need to define completeness in this context. This is done using rectangular reductions, which were introduced in =-=[1]-=-. ffl In subsection 2 we shall use the definitions of subsection 1 for the quantum case and define a complete problem for the class of boolean functions whose 1-round quantum communication complexity ... |

32 |
The dawn of a new era for quantum cryptography: The experimental prototype is working
- Bennett, Brassard
- 1989
(Show Context)
Citation Context ... has a more solid theoretical foundation. Because the quantum devices involved are relatively simple, several models based on the transfer of quantum coded information have already been realized (see =-=[2]-=-[4][8]). 1.3 Quantum communication The quantum communication model is based on the communication model of Yao which was presented in his paper [17]. This model (the classical one) deals with the issue... |

6 |
Experimental quantum cryptography
- Smolin
- 1990
(Show Context)
Citation Context ...s a more solid theoretical foundation. Because the quantum devices involved are relatively simple, several models based on the transfer of quantum coded information have already been realized (see [2]=-=[4]-=-[8]). 1.3 Quantum communication The quantum communication model is based on the communication model of Yao which was presented in his paper [17]. This model (the classical one) deals with the issue of... |

4 |
Computational Complexity
- Papadimitriu
- 1994
(Show Context)
Citation Context ...These differ in several aspects from those used in other areas of mathematics. In the following, we shall describe some of their essential features. For a more detailed discussion in this subject see =-=[12]-=-. In order to investigate the difficulties of computing some function f we have to specify some computational model which is a mathematical model (e.g. Turing machines, boolean circuits). Having defin... |

3 |
Quantum theory, the Church-Turing principle, and the universal quantum computer
- Deutch
- 1985
(Show Context)
Citation Context ...claimed that it is intrinsically expensive to simulate quantum systems using classical computational methods, and that by using "quantum computers" this problem could be overcome. Subsequent=-=ly Deutsch[6]-=- formulated a quantum computational model, QTM (Quantum Turing Machine), and wondered whether the quantum computer has capabilities beyond that of the classical Turing machine. This question has attra... |

1 |
An unsolvable problem of elemantry number theory
- Church
- 1936
(Show Context)
Citation Context ...o defined the so called "Turing Machine" which is not a machine but the basic computational model in Computers Science [16]. A subsequent development was the formulation of the "Church-=-=Turing thesis" [5] which established t-=-he general application of the "Turing Machine". This thesis claims that any "computational process" can be simulated by a Turing machine. It should be remarked that the concept of ... |

1 |
Quantum bit commitment and coin tossing protocols
- Joza, Langlois
- 1993
(Show Context)
Citation Context ... more solid theoretical foundation. Because the quantum devices involved are relatively simple, several models based on the transfer of quantum coded information have already been realized (see [2][4]=-=[8]-=-). 1.3 Quantum communication The quantum communication model is based on the communication model of Yao which was presented in his paper [17]. This model (the classical one) deals with the issue of co... |

1 |
On one-round randomized communication complexity
- Nissan, Ron
- 1995
(Show Context)
Citation Context ...left open. In section 6 we concentrate on the relation between one-round quantum communication and one-way probabilistic communication (the issue of one-round randomized communication is discussed in =-=[11]-=-). We follow the technique of complete problems: ffl We define a complete problem for the class of functions whose one-way randomized communication is polylog. ffl We define a complete problem for the... |

1 |
Quantum Mechanics
- Tanudji
- 1984
(Show Context)
Citation Context ...l try to give a brief description of the the way Quantum Mechanics Theory views a "simple" system. This section is not intended to "teach" Quantum Physics, for this purpose the rea=-=der should refer to [15]-=-. In the first subsection we give the postulates on which the mathematical description of a quantum system is based. These postulates should be treated as axioms. They are the foundations of Quantum M... |

1 |
On computable numbers with an apllication to the entscheid- ungsproblem
- Turing
- 1936
(Show Context)
Citation Context ...nsiderably. A land-mark development in this field was the work of Allan Turing who defined the so called "Turing Machine" which is not a machine but the basic computational model in Computer=-=s Science [16]. A subsequent development was-=- the formulation of the "Church-Turing thesis" [5] which established the general application of the "Turing Machine". This thesis claims that any "computational process" ... |

1 |
Quantum theory, thechurch-turing principle and the universal quantum computer
- Deutch
- 1985
(Show Context)
Citation Context ... claimed that it is intrinsically expensive tosimulate quantum systems using classical computational methods, and that by using \quantum computers" this problem could be overcome. Subsequently Deutsch=-=[6]-=- formulated a quantum computational model, QTM (Quantum Turing Machine), and wondered whether the quantum computer has capabilities beyond that of the classical Turing machine. This question has attra... |