Midterm Exam for Quantum Complexity | CSI 789, Exams of Computer Science

Material Type: Exam; Class: Classical Electrodynamics I; Subject: Computational Sci& Informatics; University: George Mason University; Term: Unknown 1989;

Typology: Exams

Pre 2010

Uploaded on 02/10/2009

koofers-user-5od-1
koofers-user-5od-1 🇺🇸

5

(1)

10 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSI 789-004/PHYS 780-002: Quantum Complexity
Fall Semester 2004 Take-Home Mid-Term Exam
Issued 19th October and Due by Class Day 2nd November 2004
Answer any 5 out of the 6 questions. If you answer all 6 questions you get extra credit.
Question #1
a. Using the diagonalization technique show that the halting problem is Turing undecidable.
b. On the question of what can be measured in quantum mechanics? - we know the
“Traditional” approach to quantum measurements as:
“A quantum measurement is described by an observable, M, that is, a Hermitian operator
acting on the state space of the system. Measuring a system prepared in an eigenstate of
M gives the corresponding eigenvalue of M as the measurement outcome.”
- (For quoted text see reading reference for Question#1(b).)
“The question now presents itself – Can every observable be measured? The answer
theoretically is yes. In practice it may be very awkward, or perhaps even beyond the
ingenuity of the experimenter, to devise an apparatus which could measure some
particular observable, but the theory always allows one to imagine that the measurement
could be made.” - Paul A. M. Dirac
“The halting observable: Can we build a measuring device capable of measuring the
halting observable?
Yes: Would give us a procedure to solve the halting problem.
No: There is an interesting class of “superselection” rules controlling what observables
may, in fact, be measured.
Research Problem: Is the halting observable really measurable? If so, how? If not, why
not?”
- (For quoted text see reading reference for Question#1(b).)
Write your own solution of the Research Problem discussing both the ‘yes’ and ‘no’
answers.
Question#2
a. Define the following classical and quantum complexity classes and describe as many
relationships as you know among all the classes.
P, PSPACE, NP, NP-Complete, IP, ZPP, BPP, ZQP, BQP
pf3

Partial preview of the text

Download Midterm Exam for Quantum Complexity | CSI 789 and more Exams Computer Science in PDF only on Docsity!

CSI 789-004/PHYS 780-002: Quantum Complexity Fall Semester 2004 Take-Home Mid-Term Exam Issued 19th^ October and Due by Class Day 2nd^ November 2004 Answer any 5 out of the 6 questions. If you answer all 6 questions you get extra credit. Question # a. Using the diagonalization technique show that the halting problem is Turing undecidable. b. On the question of what can be measured in quantum mechanics? - we know the “Traditional” approach to quantum measurements as: “A quantum measurement is described by an observable, M, that is, a Hermitian operator acting on the state space of the system. Measuring a system prepared in an eigenstate of M gives the corresponding eigenvalue of M as the measurement outcome.”

  • (For quoted text see reading reference for Question#1(b).) “The question now presents itself – Can every observable be measured? The answer theoretically is yes. In practice it may be very awkward, or perhaps even beyond the ingenuity of the experimenter, to devise an apparatus which could measure some particular observable, but the theory always allows one to imagine that the measurement could be made.” - Paul A. M. Dirac “The halting observable: Can we build a measuring device capable of measuring the halting observable? Yes: Would give us a procedure to solve the halting problem. No: There is an interesting class of “superselection” rules controlling what observables may, in fact, be measured. Research Problem: Is the halting observable really measurable? If so, how? If not, why not?”
  • (For quoted text see reading reference for Question#1(b).) Write your own solution of the Research Problem discussing both the ‘yes’ and ‘no’ answers. Question# a. Define the following classical and quantum complexity classes and describe as many relationships as you know among all the classes. P, PSPACE, NP, NP-Complete, IP, ZPP, BPP, ZQP, BQP

b. Consider the 0 -1 knapsack NP-complete problem below: Given: {(a 1 , a 2 , …, aN, b) | N ≥1 and a 1 ,... , aN, b are natural numbers} Are there x 1 , x 2 ….. xN in {0, 1} such that a 1 x 1 + a 2 x 2 + ….. + aN xN = b for the given instance (a 1 ,... , aN, b)? What is the instance of the 0 - 1 knapsack problem that corresponds to the instance (x 1 ¬x 2 x 4 ) (¬x 1 x 2 x 3 ) (¬x 2 ¬x 3 ¬x 4 ) of the 3-satisfiability problem? Question# a. Consider the problem of deciding the inequality AB C for matrices A, B and C. Now consider the following algorithm. (1) Randomly choose an entry (i, j) in matrix C for the given instance (A, B, C) of the problem, and let d 1 denotes the element at this entry. (2) Use the Ith row of A and the jth column of B to compute the value d 2 at entry (i, j) of AB. (3) Declare that the inequality AB C holds if d 1 d 2. Otherwise, declare that AB = C. What are the time complexity and the error probability of the algorithm? b. Explain the results of each step of Miller-Rabin probabilistic algorithm of primality test with a prime and a composite number of your choice. Question# a. Construct an algorithm that determines whether a given set of Boolean Functions A constitutes a complete basis. (Functions are represented by tables.) b. Let Cn be the maximum complexity c(f) for Boolean functions f in n variables. Prove that 1.99n^ < Cn < 2.01n^ for sufficiently large n. Question# a. Discuss briefly the essential points of the paper “Quantum Circuit Complexity” by Andrew Chi-Chih Yao. b. State and discuss briefly the four theorems of quantum computational complexity theory stated in the paper “Introduction to Quantum Complexity Theory” by Richard Cleve.