Jasmine 2.0's new done() method replaces the runs() and waitsFor() methods of earlier versions to make it more similar to other testing frameworks. Rob Gravelle shows how to use Jasmine 2.0's done() method to test DOM events without polluting the test subject page with test code.

In an earlier article we looked at setting up the Genesis framework and the Genesis sample. In this article we delve deeper into the process by using the Generate theme.

PhD Dissertation Defense

Amplified Quantum Transforms

David J. Cornwell

10:00am-12:00pm, 26 March 2014, ITE346

In this work we investigate a new quantum algorithm called the Amplified Quantum Fourier Transform (Amplified-QFT) to solve the Local Period Problem where there is an Oracle with a periodic subset and we wish to recover its period. This algorithm uses parts of the famous Grover’s quantum search algorithm to amplify the amplitudes on the subset, followed by the equally famous Shor’s quantum algorithm for recovering the period. We compare the Amplified-QFT algorithm against the Quantum Fourier Transform (QFT) and Quantum Hidden Subgroup (QHS) algorithms and calculate the probabilities of success for all three algorithms. We show that the Amplified-QFT algorithm is on average, quadratically faster than either the QFT or QHS algorithms. We also investigate two more general settings: a) where the QFT is replaced by a general unitary operator U in the Amplified-QFT algorithm and b) where Grover’s algorithm is replaced by a general amplification procedure in the Amplified-QFT algorithm.

We also investigate this algorithm when a random Error Stream affects the Oracle, which involves calculating expectations and variances over a random set. We calculate the probabilities of success in this case. Further, we find an Uncertainty Principle for the Amplified-QFT algorithm. We also identify a decision problem, the Constant or Balanced Signal Decision Problem, which can be solved by using the one dimensional Amplified Haar Wavelet Transform. This decision problem is a generalization of the Deutsch-Josza problem.

Committee: Drs. S. Lomonaco (CSEE), Chair and advisor; T. Armstrong (Math), Co-advisor and Reader; Dr. Y. Shih (Physics), Reader; Dr. F. Potra (Math) and Dr. M. Gowda (Math)

PhD Dissertation Defense

Amplified Quantum Transforms

David J. Cornwell

10:00am-12:00pm, 26 March 2014, ITE346

In this work we investigate a new quantum algorithm called the Amplified Quantum Fourier Transform (Amplified-QFT) to solve the Local Period Problem where there is an Oracle with a periodic subset and we wish to recover its period. This algorithm uses parts of the famous Grover’s quantum search algorithm to amplify the amplitudes on the subset, followed by the equally famous Shor’s quantum algorithm for recovering the period. We compare the Amplified-QFT algorithm against the Quantum Fourier Transform (QFT) and Quantum Hidden Subgroup (QHS) algorithms and calculate the probabilities of success for all three algorithms. We show that the Amplified-QFT algorithm is on average, quadratically faster than either the QFT or QHS algorithms. We also investigate two more general settings: a) where the QFT is replaced by a general unitary operator U in the Amplified-QFT algorithm and b) where Grover’s algorithm is replaced by a general amplification procedure in the Amplified-QFT algorithm.

We also investigate this algorithm when a random Error Stream affects the Oracle, which involves calculating expectations and variances over a random set. We calculate the probabilities of success in this case. Further, we find an Uncertainty Principle for the Amplified-QFT algorithm. We also identify a decision problem, the Constant or Balanced Signal Decision Problem, which can be solved by using the one dimensional Amplified Haar Wavelet Transform. This decision problem is a generalization of the Deutsch-Josza problem.

Committee: Drs. S. Lomonaco (CSEE), Chair and advisor; T. Armstrong (Math), Co-advisor and Reader; Dr. Y. Shih (Physics), Reader; Dr. F. Potra (Math) and Dr. M. Gowda (Math)

Providing developers with a new tool to build apps using the familiar HTML5 language and tools such as C#, VB.net, and Visual Studio, Kinvey announces a partnership with Gizmox.

(Photo by bradleypjohnson/Flickr)

We’ve all had that “ah, ha!” moment.

That moment when we learn something new and important, when we finally grasp that elusive tidbit of knowledge, or when our brains just click.

And it feels great being a little bit smarter, doesn’t it?

So tell us: What did you learn at Treehouse this week?

It could be something really simple or something you’ve wanted to understand for a long time. It could be tackling a new programming language, finishing a Treehouse course, or just finding more confidence in yourself.

Sounds like fun! What are you looking for?

We’re looking for funny, creative and upbeat items. Just be detailed yet reasonably brief.

Besides telling us what you learned, consider touching on these questions: Why was learning this important to you? What will you do with your newfound knowledge? What’s next on your plate at Treehouse?

We’ll publish the best submissions in an upcoming Treehouse blog post.

Got it! How do I participate?

• Tweet us @treehouse with #whatilearned
• Share your thoughts on this Facebook post
• Comment on this blog post

The post What Did You Learn at Treehouse This Week? appeared first on Treehouse Blog.