Simulating Special but Natural Quantum Circuits

Details Simulating Special but Natural Quantum Circuits Simulating Special but Natural Quantum Circuits

2012-01-16

arxiv.org/abs/1201.3306v1

Computer Science

Computational Complexity

Scientific paper

We identify a sub-class of BQP that captures certain structural commonalities among many quantum algorithms including Shor's algorithms. This class does not contain all of BQP (e.g. Grover's algorithm does not fall into this class). Our main result is that any algorithm in this class that measures at most O(log n) qubits can be simulated by classical randomized polynomial time algorithms. This does not dequantize Shor's algorithm (as the latter measures n qubits) but our work also highlights a new potentially hard function for cryptographic applications. Our main technical contribution is (to the best of our knowledge) a new exact characterization of certain sums of Fourier-type coefficients (with exponentially many summands).

Affiliated with

Also associated with

No associations

Rating

Simulating Special but Natural Quantum Circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simulating Special but Natural Quantum Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simulating Special but Natural Quantum Circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-410454