Quantum Computation with Coherent Spin States and the Close Hadamard Problem

Details Quantum Computation with Coherent Spin States and the Close Hadamard Problem Quantum Computation with Coherent Spin States and the Close Hadamard Problem

2011-12-06

arxiv.org/abs/1112.1446v1

Physics

Quantum Physics

RevTeX4, 13 pages with 8 figures

Scientific paper

We study quantum algorithms inspired by the continuously-parameterized yet finite-dimensional Hilbert space of a coherent spin system. We show that the highest-squeezed spin state possible can be approximated by a superposition of two states thus transcending the usual model of using a single basis state as algorithm input. As a particular example, we show that the close Hadamard oracle-decision problem, which is related to the Hadamard codewords of digital communications theory, can be solved quantitatively more efficiently using this computational model than by any known classical algorithm.

Affiliated with

Also associated with

No associations

Rating

Quantum Computation with Coherent Spin States and the Close Hadamard Problem 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 Quantum Computation with Coherent Spin States and the Close Hadamard Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Computation with Coherent Spin States and the Close Hadamard Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-593935