Chapman & Hall/CRC eBooks

Quantum information processing 1: the quantum emulation of familiar invertible digital gates

Helmut Bez, Tony Croft

Published Jan 6, 2023• 0 citations

Abstract

This chapter aims to define quantum equivalents of a number of familiar digital gates. It argues that the quantum gates, with appropriately restricted state vector inputs, produce exactly the same numerical outputs as their digital counterparts. Hence, although current digital technology is not based on invertible Boolean functions, in order to emulate digital computation quantum mechanically, it is necessary to first construct invertible representations of Boolean functions. The chapter considers only some of the more familiar examples – up to and including the Peres half-adder. In the graphical representation of quantum gates and circuits, the horizontal lines indicate the time-ordered application of the unitary gates to the input qubits.

DOI: 10.1201/9781003264569-15

Related papers

Invertible digital circuits and their quantum emulations

Helmut Bez, Tony Croft

Black box representations of functions, by definition, do not provide information on how a function, so represented, is computed. By a ‘circuit’ for the computation of a function we mean a sequence of ‘basic’ gates that implement the function. It can be shown that, given a classical circuit for the Boolean function https://www.w3.org/1998/Math/MathML" display="inline"> f ^ https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math18_1.tif "/> , there is a quantum circuit of equal ‘efficiency’ for the implementation of the unitary operator https://www.w3.org/1998/Math/MathML" display="inline"> U f ^ https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math18_2.tif "/> and hence the quantum computation of f . In this chapter we consider examples of invertible digital functions and their evaluation using basic invertible Boolean gates; specifically the Toffoli and Feynman gates T D and F D . We recall that the Toffoli gate is complete for invertible digital computation, however, the inclusion of the Feynman gate, F D , simplifies the circuits. We proceed by example to demonstrate the process and consequential side-effects of such implementations and their quantum emulations. It is seen that the cost of using only Toffoli gates is that additional input bits/qubits may be required, and the computation of intermediate results (usually referred to as garbage or junk) may be necessary. We also consider a general circuit for re-setting registers containing ‘junk’, this is helpful to avoid problems with downstream computation.

Chapman & Hall/CRC eBooksJan 6, 20230 citations

Quantum information processing 2: the quantum emulation of arbitrary Boolean functions

Helmut Bez, Tony Croft

Chapters 15 and 16 relate to the quantum emulation, and unitary extension, of a number of special invertible Boolean functions. In this chapter, we turn our attention to the quantum emulation of arbitrary Boolean functions. This extends the work of Chapters 15 and 16 in two respects: to arbitrary invertible Boolean functions, and to arbitrary non-invertible Boolean functions.

Chapman & Hall/CRC eBooksJan 6, 20230 citations

Unitary extensions of the gates n o t Q , F Q , T Q and P Q : more general quantum inputs

Helmut Bez, Tony Croft

In Chapter 15 , quantum emulations of some familiar invertible digital gates were discussed; specifically the not , cnot , Toffoli and Peres gates, each of which is significant in quantum computation, were considered. The emulations were defined on basis elements only – i.e., on https://www.w3.org/1998/Math/MathML" display="inline"> B ℂ 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math16_3.tif "/> or https://www.w3.org/1998/Math/MathML" display="inline"> B ℂ 2 ⊗ ℂ 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math16_4.tif "/> or https://www.w3.org/1998/Math/MathML" display="inline"> B ℂ 2 ⊗ ℂ 2 ⊗ ℂ 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math16_5.tif "/> etc. On these restricted inputs the quantum emulations were seen to produce outputs identical to their digital equivalents. Unlike the digital gates the quantum emulations may be extended beyond the basis sets to the entire tensor product spaces so defined – i.e., to https://www.w3.org/1998/Math/MathML" display="inline"> ℂ 2 , ℂ 2 ⊗ ℂ 2 , ℂ 2 ⊗ ℂ 2 ⊗ ℂ 2 https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math16_6.tif "/> etc. Such generalised inputs to the quantum gates lead to more general quantum outputs to which the simple deterministic quantum measurement processes of Chapter 15 are not applicable. The quantum gates defined on the extended domains are shown to be unitary, and are denoted in the same way as their restrictions to the basis vectors. We first consider a sufficient condition for an operator to be unitary; it has applications in our discussions below and in Chapter 17 .

Chapman & Hall/CRC eBooksJan 6, 20230 citations

More on quantum gates and circuits: those without digital equivalents

Helmut Bez, Tony Croft

To this point only quantum gates derived from invertible digital counterparts or general invertible Boolean functions have been considered. Here we introduce a number of quantum gates without digital equivalents. In particular, we consider the Pauli gates, the https://www.w3.org/1998/Math/MathML" display="inline"> n o t https://www.w3.org/1999/xlink" xlink:href=" https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003264569/7139ce19-0d58-4a0c-820f-b76fb033e438/content/math21_1.tif "/> gate, the phase-shift gate and the Hadamard gate, some of which occur in quantum algorithms introduced later. These gates impart additional power to quantum computation.

Chapman & Hall/CRC eBooksJan 6, 20230 citations

A Quantum Model of Computation

Phillip Kaye, Raymond Laflamme, Michele Mosca

In Section 1.3, we introduced the circuit model of (classical) computation. We restricted attention to reversible circuits since they can simulate any non-reversible circuit with modest overhead. This model can be generalized to a model of quantum circuits. In the quantum circuit model, we have logical qubits carried along ‘wires’, and quantum gates that act on the qubits. A quantum gate acting on n qubits has the input qubits carried to it by n wires, and n other wires carry the output qubits away from the gate. A quantum circuit is often illustrated schematically by a circuit diagram as shown in Figure 4.1. The wires are shown as horizontal lines, and we imagine the qubits propagating along the wires from left to right in time. The gates are shown as rectangular blocks. For convenience, we will restrict attention to unitary quantum gates (which are also reversible). Recall from Section 3.5.3 that non-unitary (non-reversible) quantum operations can be simulated by unitary (reversible) quantum gates if we allow the possibility of adding an ancilla and of discarding some output qubits. A circuit diagram describing a superoperator being implemented using a unitary operator is illustrated in Figure 4.2. In the example of Figure 4.1, the 4-qubit state |ψi⟩= |0⟩⊗ |0⟩⊗ |0⟩⊗ |0⟩ enters the circuit at the left (recall we often write this state as |ψi⟩ = |0⟩|0⟩|0⟩|0⟩ or |ψi⟩ = |0000⟩.) These qubits are processed by the gates U1, U2, U3, and U4. At the output of the circuit we have the collective (possibly entangled) 4-qubit state |ψf⟩. A measurement is then made of the resulting state. The measurement will often be a simple qubit-by-qubit measurement in the computational basis, but in some cases may be a more general measurement of the joint state. A measurement of a single qubit in the computational basis is denoted on a circuit diagram by a small triangle, as shown in Figure 4.1 (there are other symbols used in the literature, but we adopt this one). The triangle symbol will be modified for cases in which there is a need to indicate different types of measurements.R50

Oxford University Press eBooksNov 16, 20060 citations

Quantum measurement 2: general pure states, Bell states

Helmut Bez, Tony Croft

The relatively simple examples of quantum computation (emulating digital computation) discussed in Chapters 15 , 17 and 18 involved only the simplest quantum inputs and produced, deterministically, outputs identical to their digital counterparts. The simplified statement of the von Neumann-Lüders measurement postulate, discussed in Chapter 14 , was applicable to these computations. In this chapter we introduce the processing of more general, i.e., super-imposed, quantum states. This is divergent from the digital case and, as will be clear later, imparts quantum computation with extended power.

Chapman & Hall/CRC eBooksJan 6, 20230 citations