Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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
Publisher

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 eBooks•Jan 6, 2023•0 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 eBooks•Jan 6, 2023•0 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 eBooks•Jan 6, 2023•0 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 eBooks•Jan 6, 2023•0 citations

Quantum Gates and Circuits

Kolla Bhanu Prakash

Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.

Wiley eBooks•Aug 17, 2026•0 citations

Qubits, Gates, and Circuits

Daniel D. Stancil, Gregory T. Byrd

Digital systems that are most familiar are based on binary digits, or “bits.” Quantum computing is different from classical computing in a number of significant ways. The fundamental unit of information in quantum computing is the qubit (pronounced “KEW-bit”), short for quantum bit. The capabilities and behavior of qubits are quite different than bits, and the authors begin by pointing out and discussing the key differences as a launching point for their study of quantum computing. It is also possible to have gates with multiple qubits as inputs. However, unlike classical multi-bit gates, the fact that quantum gates are reversible requires that there must be the same number of output qubits as input qubits. The authors explore some common two-qubit gates. With a better understanding of quantum states and operations, they are now ready to construct a proof of the no-cloning theorem.

Wiley eBooks•Apr 5, 2022•0 citations
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.
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.
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 .
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.
Quantum Gates and Circuits IntroductionQuantum gates and quantum circuits form the operational core of quantum computation.While earlier chapters focused on the mathematical structure of quantum states and the physical realization of qubits, this chapter addresses how quantum information is manipulated.In classical computing, logic gates such as AND, OR, and NOT operate on bits to implement algorithms.In quantum computing, quantum gates perform analogous roles, but they act on qubits and obey the laws of quantum mechanics [101].Quantum gates differ fundamentally from classical logic gates in several ways.First, quantum gates must be reversible, because the evolution of closed quantum systems is governed by unitary transformations.Second, quantum gates operate on probability amplitudes, not deterministic bit values.Third, quantum gates can generate superposition and entanglement, which have no classical counterparts.These properties allow quantum circuits to exploit interference effects to achieve computational advantages [102].This chapter presents a detailed theoretical discussion of quantum gates and circuits, including both single-qubit and multi-qubit gates.Mathematical representations using unitary matrices are provided, followed by practical implementation using Julia.The chapter concludes with the construction of simple quantum circuits and interpretation of their outputs. Quantum Gates as Unitary OperatorsA quantum gate is mathematically represented by a unitary matrix U acting on a quantum-state vector | : 10.
Digital systems that are most familiar are based on binary digits, or “bits.” Quantum computing is different from classical computing in a number of significant ways. The fundamental unit of information in quantum computing is the qubit (pronounced “KEW-bit”), short for quantum bit. The capabilities and behavior of qubits are quite different than bits, and the authors begin by pointing out and discussing the key differences as a launching point for their study of quantum computing. It is also possible to have gates with multiple qubits as inputs. However, unlike classical multi-bit gates, the fact that quantum gates are reversible requires that there must be the same number of output qubits as input qubits. The authors explore some common two-qubit gates. With a better understanding of quantum states and operations, they are now ready to construct a proof of the no-cloning theorem.