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

Invertible digital circuits and their quantum emulations

Helmut Bez, Tony Croft

Published Jan 6, 2023• 0 citations
Publisher

Abstract

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.

DOI
10.1201/9781003264569-18

Related papers

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 information processing 1: the quantum emulation of familiar invertible digital gates

Helmut Bez, Tony Croft

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.

Chapman & Hall/CRC eBooks•Jan 6, 2023•0 citations

Quantum computation

This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.

WORLD SCIENTIFIC eBooks•Dec 1, 2018•0 citations

Quantum Computing

F. J. Duarte

All computers are quantum computers but some are more quantum than others. Universal classical computers rely on the transistor, a quantum semiconductor, for their operation but use simple binary digital logic based on bits, 1 and 0. Quantum computers, those we are interested in here, utilize the qbits https://www.w3.org/1998/Math/MathML" display="inline"> | 1 〉 and https://www.w3.org/1998/Math/MathML" display="inline"> | 0 〉 , which are quantum states, to realize their quantum logic. These qbits are used in conjunction with superposition probability amplitudes, such as https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 + , https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 − , https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 + , and https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 − , to interact with optical components such as beam splitters, interferometers, and polarization rotators to perform quantum logical operations. In this chapter, a basic description of quantum logic, and quantum optical configurations, utilized in workable quantum computers is given.

CRC Press eBooks•Apr 10, 2026•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

Quantum measurement 1

Helmut Bez, Tony Croft

In this chapter, the simplest quantum measurement situation, i.e., where the state is an eigenvector of the observable to be measured, is considered. The states are therefore non-superimposed and measurement Axiom 3.2 of Section 13.7 in the previous chapter is applicable. We consider states in https://www.w3.org/1998/Math/MathML" display="inline"> ℂ 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/math14_1.tif "/> and https://www.w3.org/1998/Math/MathML" display="inline"> ℂ 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/math14_2.tif "/> . The generalisation to https://www.w3.org/1998/Math/MathML" display="inline"> ⊗ n ℂ 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/math14_3.tif "/> is then clear.

Chapman & Hall/CRC eBooks•Jan 6, 2023•0 citations
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.
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.
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.
This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.
All computers are quantum computers but some are more quantum than others. Universal classical computers rely on the transistor, a quantum semiconductor, for their operation but use simple binary digital logic based on bits, 1 and 0. Quantum computers, those we are interested in here, utilize the qbits https://www.w3.org/1998/Math/MathML" display="inline"> | 1 〉 and https://www.w3.org/1998/Math/MathML" display="inline"> | 0 〉 , which are quantum states, to realize their quantum logic. These qbits are used in conjunction with superposition probability amplitudes, such as https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 + , https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 − , https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 + , and https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 − , to interact with optical components such as beam splitters, interferometers, and polarization rotators to perform quantum logical operations. In this chapter, a basic description of quantum logic, and quantum optical configurations, utilized in workable quantum computers is given.
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 .
In this chapter, the simplest quantum measurement situation, i.e., where the state is an eigenvector of the observable to be measured, is considered. The states are therefore non-superimposed and measurement Axiom 3.2 of Section 13.7 in the previous chapter is applicable. We consider states in https://www.w3.org/1998/Math/MathML" display="inline"> ℂ 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/math14_1.tif "/> and https://www.w3.org/1998/Math/MathML" display="inline"> ℂ 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/math14_2.tif "/> . The generalisation to https://www.w3.org/1998/Math/MathML" display="inline"> ⊗ n ℂ 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/math14_3.tif "/> is then clear.