

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Exam; Class: Classical Electrodynamics I; Subject: Computational Sci& Informatics; University: George Mason University; Term: Unknown 1989;
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!


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.”
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.