 # Deutsch's Algorithm on a Quantum Computer

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

In 1985, David Deutsch  proposed a highly contrived but simple algorithm to explore the potentially greater computational power of a quantum computer as compared to a classical computer. Consider four possible functions of a single-bit (or basis qubit) or , which produce a single-bit result or , as follows: , , , . The first two functions are classified as "constant" (with ), while the latter two are described as "balanced" (with ). Suppose now that a classical computer, idealized as a "black box", can perform the computation .

[more]

To determine whether is constant or balanced on a classical computer, it is necessary to run the program twice, with inputs and , respectively. For example, with the input , suppose we find . Then can be either or . We need a second run with to determine which alternative is correct. By contrast, a 2-qubit quantum computer can find the result in a single operation—one shot instead of two.

As shown in the graphic, a black box performing one of the four functions is built into the quantum computer circuit. Our objective is to determine whether this function is constant or balanced. The two qubits and (which can be abbreviated as the quantum state are input, and the program is executed. The first exit qubit is measured, which collapses it to a classical bit 0 or 1. Very directly, 0 indicates that is constant while 1 indicates that it is balanced. The second exit qubit can be discarded.

You can select one of the four possible functions and run the quantum-computer program. The quantum state of the two-qubit system at each stage of the computation is exhibited, colored in red.

[less]

Contributed by: S. M. Blinder (May 2017)
Open content licensed under CC BY-NC-SA

## Snapshots   ## Details

The Hadamard gate transforms the basis qubits into superpositions as follows: , )/ . The Deutsch gate carries out the following action, showing the incoming and outgoing qubits:

Here represents the exclusive or (XOR) Boolean operation on the bits and . The above would be a CNOT gate if .

In a generalization to qubits, known as the Deutsch–Jozsa algorithm, a single query on a quantum computer can find a result that would require up to the of order queries on a classical computer. Similar fragmentary results show promise of possible exponential gains in computational power using a quantum machine.

References

 D. Deutsch, "Quantum Theory, the Church–Turing Principle and the Universal Quantum Computer," Proceedings of the Royal Society of London A, 400, 1985 pp. 97–117.

 G. Fano and S. M. Blinder, Twenty-First Century Quantum Mechanics: Hilbert Space to Quantum Computers, Berlin: Springer, 2017, Sect. 6.5.

 "Deutsch's Algorithm." (Apr 28, 2017) www.cs.xu.edu/~kinne/quantum/deutche.html.

 M. A. Nielson and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge: Cambridge University Press, 2010. doi:10.1017/CBO9780511976667.

## Permanent Citation

S. M. Blinder

 Feedback (field required) Email (field required) Name Occupation Organization Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback. Send