To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

From Wikipedia, the free encyclopedia

In quantum computation, the Hadamard test is a method used to create a random variable whose expected value is the expected real part , where is a quantum state and is a unitary gate acting on the space of .[1] The Hadamard test produces a random variable whose image is in and whose expected value is exactly . It is possible to modify the circuit to produce a random variable whose expected value is by applying an gate after the first Hadamard gate.[1]

Description of the circuit

To perform the Hadamard test we first calculate the state . We then apply the unitary operator on conditioned on the first qubit to obtain the state . We then apply the Hadamard gate to the first qubit, yielding .

Measuring the first qubit, the result is with probability , in which case we output . The result is with probability , in which case we output . The expected value of the output will then be the difference between the two probabilities, which is

To obtain a random variable whose expectation is follow exactly the same procedure but start with .[2]

The Hadamard test has many applications in quantum algorithms such as the Aharonov-Jones-Landau algorithm. Via a very simple modification it can be used to compute inner product between two states and :[3] instead of starting from a state it suffice to start from the ground state , and perform two controlled operations on the ancilla qubit. Controlled on the ancilla register being , we apply the unitary that produces in the second register, and controlled on the ancilla register being in the state , we create in the second register. The expected value of the measurements of the ancilla qubits leads to an estimate of . The number of samples needed to estimate the expected value with absolute error is , because of a Chernoff bound. This value can be improved to using amplitude estimation techniques.[3]

References

  1. ^ a b Dorit Aharonov Vaughan Jones, Zeph Landau (2009). "A Polynomial Quantum Algorithm for Approximating the Jones Polynomial". Algorithmica. 55 (3): 395–421. arXiv:quant-ph/0511096. doi:10.1007/s00453-008-9168-0. S2CID 7058660.
  2. ^ quantumalgorithms.org - Hadamard test. Open Publishing. Retrieved 27 February 2022.
  3. ^ a b quantumalgorithms.org - Modified hadamard test. Open Publishing. Retrieved 27 February 2022.

,

This page was last edited on 30 January 2024, at 15:28
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.