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

CRC Press eBooks

Quantum Computing

F. J. Duarte

Published Apr 10, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1201/9781003649434-15

Related papers

Towards a Quantum Computer?

In everyday life, practically all the information which is processed, exchanged or stored is coded in the form of discrete entities called bits , which take two values only, by convention 0 and 1. With the present technology for computers and optical fibers, bits are carried by electrical currents and electromagnetic waves corresponding to macroscopic fluxes of electrons and photons, and they are stored in memories of various kinds, for example, magnetic memories. Although quantum physics is the basic physics which underlies the operation of a transistor (Chapter 6) or of a laser (Chapter 4), each exchanged or processed bit corresponds to a large number of elementary quantum systems, and its behavior can be described classically due to the strong interaction with the environment (Chapter 9). For about thirty years, physicists have learned to manipulate with great accuracy individual quantum systems: photons, electrons, neutrons, atoms, and so forth, which opens the way to using two-state quantum systems, such as the polarization states of a photon (Chapter 2) or the two energy levels of an atom or an ion (Chapter 4) in order to process, exchange or store information. In § 2.3.2, we used the two polarization states of a photon, vertical ( V ) and horizontal ( H ), to represent the values 0 and 1 of a bit and to exchange information. In what follows, it will be convenient to use Dirac’s notation (see Appendix A.2.2 for more details), where a vertical polarization state is denoted by | V 〉 or |0〉 and a horizontal one by | H 〉 or |1〉, while a state with arbitrary polarization will be denoted by |ψ〉. The polarization states of a photon give one possible realization of a quantum bit , or for short a qubit . Thanks to the properties of quantum physics, quantum computers using qubits, if they ever exist, would outperform classical computers for some specific, but very important, problems. In Sections 8.1 and 8.2, we describe some typical quantum algorithms and, in order to do so, we shall not be able to avoid some technical developments. However, these two sections may be skipped in a first reading, as they are not necessary for understanding the more general considerations of Sections 8.3 and 8.4.

WORLD SCIENTIFIC eBooks•Nov 20, 2013•0 citations

Born's Rule and Quantum Probabilities

F. J. Duarte

In quantum mechanics, the physics of probability amplitudes, that exists in the imaginary and complex mathematical realm, is brought to the measurable realm by the iconic Born rule https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 | ψ 〉 ∗ = | | ψ 〉 | 2 that convert the superposition probability amplitude https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 into a measurable interferometric probability distribution. When Born first introduced his rule, in 1926, he did so in the absence of a physical derivation. In fact, Born never offered a derivation for his most crucial rule. In this chapter a transparent interferometric derivation of Born's rule is given. Furthermore, it is indicated that far from a ‘collapse’ the https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 → | ψ 〉 | ψ 〉 ∗ transition, for interferometric configurations, clearly involves a mathematical expansion . The https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 → | ψ 〉 | ψ 〉 ∗ transition for quantum entanglement is also discussed.

CRC Press eBooks•Apr 10, 2026•0 citations

A REPORT ON QUANTUM COMPUTING

Achintya A. Paradkar

Today's computers work on bits that exist as either 0 or 1. Quantum computers aren't limited to two states; they encode information as quantum bits, or qubits, which can exist in superposition. Qubits represent atoms, ions, photons or electrons and their respective control devices that are working together to act as computer memory and a processor. Because a quantum computer can contain these multiple states simultaneously, it has the potential to be millions of times more powerful than today's most powerful supercomputers. A processor that can use registers of qubits will be able to perform calculations using all the possible values of the input registers simultaneously. This superposition causes a phenomenon called quantum parallelism, and is the motivating force behind the research being carried out in quantum computing. Due to technical obstacles, till date, a quantum computer has not yet been realized. But the concepts and ideas of quantum computing has been demonstrated using various methods like NMR, Ion Trap, Quantum Dot, Optical Methods, etc. A quantum computer manipulates qubits by executing a series of quantum gates, each a unitary transformation acting on a single qubit or pair of qubits. In applying these gates in succession, a quantum computer can perform a complicated unitary transformation to a set of qubits in some initial state. The qubits can then be measured, with this measurement serving as the final computational result. Research must devise a way to maintain decoherence and other potential sources of error at an acceptable level. Probably the most important idea in this field is the application of error correction in phase coherence as a means to extract information and reduce error in a quantum system without actually measuring that system. Thereby, quantum computers will emerge as the superior computational devices and perhaps one day make today's modern computer obsolete.

International Journal of Students Research in Technology & Management•Sep 26, 2015•1 citation

Quantum Bits and Quantum Computation

Yorick Hardy, Willi-Hans Steeb

Digital computers are based on devices that can take on only two states, one of which is denoted by 0 and the other by 1. By concatenating several 0s and is together, 0-1 combinations can be formed to represent as many different entities as desired. A combination containing a single 0 or 1 is called a bit. In general, n bits can be used to distinguish among 2 n distinct entities and each addition of a bit doubles the number of possible combinations. Computers use strings of bits to represent numbers, letters, punctuation marks, and any other useful pieces of information. In a classical computer, the processing of information is done by logic gate. A logic gate maps the state of its input bits into another state according to a truth table. Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counterpart. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Birkhäuser Basel eBooks•Jan 1, 2001•0 citations

The Feynman Path Integral

N. Cabibbo, Luciano Maiani, Omar Benhar A

This Chapter introduces the Feynman Path Integral description of quantum transition amplitudes, considering the simplest case of a quantum system described by one quantum variable q and its conjugate momentum p . The transition amplitude from time https://www.w3.org/1998/Math/MathML" display="inline"> t 1 to time https://www.w3.org/1998/Math/MathML" display="inline"> t 2 = t 1 + T is obtained by discretising the time axis in N time steps of amplitude https://www.w3.org/1998/Math/MathML" display="inline"> ϵ , implying T=N https://www.w3.org/1998/Math/MathML" display="inline"> ϵ . For https://www.w3.org/1998/Math/MathML" display="inline"> ϵ → 0 , the Feynman Path Integral formula is derived: https://www.w3.org/1998/Math/MathML" display="inline"> < q N | e - i T H / ℏ | q 0 > = ∫ d [ q ( t ) ] e i S q ( t ) , q ' ( t ) / ℏ , where integration is over all trajectories https://www.w3.org/1998/Math/MathML" display="inline"> q ( t ) which satisfy the boundary conditions at https://www.w3.org/1998/Math/MathML" display="inline"> t 1 and t 2 . https://www.w3.org/1998/Math/MathML" display="inline"> S ( q , q ' ) is the classical Action, a function of https://www.w3.org/1998/Math/MathML" display="inline"> q and of its time derivative. The classical limit, corresponding to https://www.w3.org/1998/Math/MathML" display="inline"> ℏ → 0 , is considered, whereby the solution of the Feynman Path Integral reduces to the classical trajectory, https://www.w3.org/1998/Math/MathML" display="inline"> q c ( t ) , which minimises the classical Action. The lattice approximation , i.e. small, non vanishing https://www.w3.org/1998/Math/MathML" display="inline"> ϵ , with evaluation of the Feynman integral by numerical integration, provides a useful approximation in the case of the fundamental theory of the strong interactions (Quantum Chromodynamics, or QCD), to be considered later; Chapters 17 to19. This chapter is completed by consideration of the extension of gthe formalism to imaginary time, where the Feynman Path Integral becomes the Partition Function of Statistical Mechanics, and by the definition of the Green's functions, ground-state expectation values of products of quantum operators q(t) taken at different times, https://www.w3.org/1998/Math/MathML" display="inline"> t 1 , t 2 … t N .

CRC Press eBooks•Oct 22, 2025•0 citations

Quantum Ensembles

Francesco Caravelli, Juan Zanella Béguelin, Alioscia Hamma +1 more

A quantum particle is confined to a cubic box of side length https://www.w3.org/1998/Math/MathML" display="inline"> L and volume https://www.w3.org/1998/Math/MathML" display="inline"> V . Its Hamiltonian is https://www.w3.org/1998/Math/MathML" display="inline"> H = p 2 / ( 2 m ) . Assume periodic boundary conditions on the wave function. Find the energy eigenvalues and a complete set of eigenstates. Show that the computation of the canonical partition function, https://www.w3.org/1998/Math/MathML" display="inline"> Z 1 , can be reduced to the evaluation of the sum 5.1 https://www.w3.org/1998/Math/MathML" display="block"> f ( θ ) = ∑ n = − ∞ ∞ e − θ n 2 . Write https://www.w3.org/1998/Math/MathML" display="inline"> θ in terms of https://www.w3.org/1998/Math/MathML" display="inline"> L and the thermal wavelength https://www.w3.org/1998/Math/MathML" display="inline"> λ . Show that if https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) is approximated as 5.2 https://www.w3.org/1998/Math/MathML" display="block"> f ( θ ) ≃ ∫ − ∞ ∞ d n e − θ n 2 ≡ I ( θ ) , then one recovers the classical partition function. For https://www.w3.org/1998/Math/MathML" display="inline"> θ = 0.1 , 1 , and https://www.w3.org/1998/Math/MathML" display="inline"> 2 , plot the Gaussian https://www.w3.org/1998/Math/MathML" display="inline"> e − θ n 2 together with the corresponding centered step function. In light of these plots, what would appear to be a reasonable criterion for approximating https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) by https://www.w3.org/1998/Math/MathML" display="inline"> I ( θ ) ? Compute https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) and https://www.w3.org/1998/Math/MathML" display="inline"> I ( θ ) numerically, and determine the relative error incurred in approximating https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) by https://www.w3.org/1998/Math/MathML" display="inline"> I ( θ ) for each value of https://www.w3.org/1998/Math/MathML" display="inline"> θ in part (b). Determine the bounds on https://www.w3.org/1998/Math/MathML" display="inline"> θ for which the relative error in approximating https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) by https://www.w3.org/1998/Math/MathML" display="inline"> I ( θ ) is less than https://www.w3.org/1998/Math/MathML" display="inline"> 1 % , https://www.w3.org/1998/Math/MathML" display="inline"> 0.01 % , and https://www.w3.org/1998/Math/MathML" display="inline"> 10 − 6 % . With these results in hand, what would be a more precise criterion for approximating https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) by https://www.w3.org/1998/Math/MathML" display="inline"> I ( θ ) ? Using the Poisson summation formula, Eq. (15.12), show that 5.3 https://www.w3.org/1998/Math/MathML" display="block"> Z 1 = V λ 3 ( 1 + 2 ∑ ν = 1 ∞ e − ν 2 π L 2 / λ 2 ) 3 = V λ 3 ( 1 + 6 e − π L 2 / λ 2 + 18 e − 4 π L 2 / λ 2 + ⋯ ) . This identity should explain the somewhat unexpected results from parts (c) and (d). But does it make it any less surprising that two functions whose graphs differ so markedly should have nearly identical integrals? Consider an H 2 molecule at https://www.w3.org/1998/Math/MathML" display="inline"> 300 K in a https://www.w3.org/1998/Math/MathML" display="inline"> 10 nm 3 box. Find the relative error when https://www.w3.org/1998/Math/MathML" display="inline"> Z 1 is computed using https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) ≃ I ( θ ) . At what temperature does the approximation break down? Show that there is a practical lower bound on the number of particles for which the following two conditions are simultaneously satisfied: (i) quantum statistics become relevant, and (ii) the approximation https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) ≃ I ( θ ) remains valid.

CRC Press eBooks•Nov 6, 2026•0 citations
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 everyday life, practically all the information which is processed, exchanged or stored is coded in the form of discrete entities called bits , which take two values only, by convention 0 and 1. With the present technology for computers and optical fibers, bits are carried by electrical currents and electromagnetic waves corresponding to macroscopic fluxes of electrons and photons, and they are stored in memories of various kinds, for example, magnetic memories. Although quantum physics is the basic physics which underlies the operation of a transistor (Chapter 6) or of a laser (Chapter 4), each exchanged or processed bit corresponds to a large number of elementary quantum systems, and its behavior can be described classically due to the strong interaction with the environment (Chapter 9). For about thirty years, physicists have learned to manipulate with great accuracy individual quantum systems: photons, electrons, neutrons, atoms, and so forth, which opens the way to using two-state quantum systems, such as the polarization states of a photon (Chapter 2) or the two energy levels of an atom or an ion (Chapter 4) in order to process, exchange or store information. In § 2.3.2, we used the two polarization states of a photon, vertical ( V ) and horizontal ( H ), to represent the values 0 and 1 of a bit and to exchange information. In what follows, it will be convenient to use Dirac’s notation (see Appendix A.2.2 for more details), where a vertical polarization state is denoted by | V 〉 or |0〉 and a horizontal one by | H 〉 or |1〉, while a state with arbitrary polarization will be denoted by |ψ〉. The polarization states of a photon give one possible realization of a quantum bit , or for short a qubit . Thanks to the properties of quantum physics, quantum computers using qubits, if they ever exist, would outperform classical computers for some specific, but very important, problems. In Sections 8.1 and 8.2, we describe some typical quantum algorithms and, in order to do so, we shall not be able to avoid some technical developments. However, these two sections may be skipped in a first reading, as they are not necessary for understanding the more general considerations of Sections 8.3 and 8.4.
In quantum mechanics, the physics of probability amplitudes, that exists in the imaginary and complex mathematical realm, is brought to the measurable realm by the iconic Born rule https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 | ψ 〉 ∗ = | | ψ 〉 | 2 that convert the superposition probability amplitude https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 into a measurable interferometric probability distribution. When Born first introduced his rule, in 1926, he did so in the absence of a physical derivation. In fact, Born never offered a derivation for his most crucial rule. In this chapter a transparent interferometric derivation of Born's rule is given. Furthermore, it is indicated that far from a ‘collapse’ the https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 → | ψ 〉 | ψ 〉 ∗ transition, for interferometric configurations, clearly involves a mathematical expansion . The https://www.w3.org/1998/Math/MathML" display="inline"> | ψ 〉 → | ψ 〉 | ψ 〉 ∗ transition for quantum entanglement is also discussed.
Today's computers work on bits that exist as either 0 or 1. Quantum computers aren't limited to two states; they encode information as quantum bits, or qubits, which can exist in superposition. Qubits represent atoms, ions, photons or electrons and their respective control devices that are working together to act as computer memory and a processor. Because a quantum computer can contain these multiple states simultaneously, it has the potential to be millions of times more powerful than today's most powerful supercomputers. A processor that can use registers of qubits will be able to perform calculations using all the possible values of the input registers simultaneously. This superposition causes a phenomenon called quantum parallelism, and is the motivating force behind the research being carried out in quantum computing. Due to technical obstacles, till date, a quantum computer has not yet been realized. But the concepts and ideas of quantum computing has been demonstrated using various methods like NMR, Ion Trap, Quantum Dot, Optical Methods, etc. A quantum computer manipulates qubits by executing a series of quantum gates, each a unitary transformation acting on a single qubit or pair of qubits. In applying these gates in succession, a quantum computer can perform a complicated unitary transformation to a set of qubits in some initial state. The qubits can then be measured, with this measurement serving as the final computational result. Research must devise a way to maintain decoherence and other potential sources of error at an acceptable level. Probably the most important idea in this field is the application of error correction in phase coherence as a means to extract information and reduce error in a quantum system without actually measuring that system. Thereby, quantum computers will emerge as the superior computational devices and perhaps one day make today's modern computer obsolete.
Digital computers are based on devices that can take on only two states, one of which is denoted by 0 and the other by 1. By concatenating several 0s and is together, 0-1 combinations can be formed to represent as many different entities as desired. A combination containing a single 0 or 1 is called a bit. In general, n bits can be used to distinguish among 2 n distinct entities and each addition of a bit doubles the number of possible combinations. Computers use strings of bits to represent numbers, letters, punctuation marks, and any other useful pieces of information. In a classical computer, the processing of information is done by logic gate. A logic gate maps the state of its input bits into another state according to a truth table. Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counterpart. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This Chapter introduces the Feynman Path Integral description of quantum transition amplitudes, considering the simplest case of a quantum system described by one quantum variable q and its conjugate momentum p . The transition amplitude from time https://www.w3.org/1998/Math/MathML" display="inline"> t 1 to time https://www.w3.org/1998/Math/MathML" display="inline"> t 2 = t 1 + T is obtained by discretising the time axis in N time steps of amplitude https://www.w3.org/1998/Math/MathML" display="inline"> ϵ , implying T=N https://www.w3.org/1998/Math/MathML" display="inline"> ϵ . For https://www.w3.org/1998/Math/MathML" display="inline"> ϵ → 0 , the Feynman Path Integral formula is derived: https://www.w3.org/1998/Math/MathML" display="inline"> < q N | e - i T H / ℏ | q 0 > = ∫ d [ q ( t ) ] e i S q ( t ) , q ' ( t ) / ℏ , where integration is over all trajectories https://www.w3.org/1998/Math/MathML" display="inline"> q ( t ) which satisfy the boundary conditions at https://www.w3.org/1998/Math/MathML" display="inline"> t 1 and t 2 . https://www.w3.org/1998/Math/MathML" display="inline"> S ( q , q ' ) is the classical Action, a function of https://www.w3.org/1998/Math/MathML" display="inline"> q and of its time derivative. The classical limit, corresponding to https://www.w3.org/1998/Math/MathML" display="inline"> ℏ → 0 , is considered, whereby the solution of the Feynman Path Integral reduces to the classical trajectory, https://www.w3.org/1998/Math/MathML" display="inline"> q c ( t ) , which minimises the classical Action. The lattice approximation , i.e. small, non vanishing https://www.w3.org/1998/Math/MathML" display="inline"> ϵ , with evaluation of the Feynman integral by numerical integration, provides a useful approximation in the case of the fundamental theory of the strong interactions (Quantum Chromodynamics, or QCD), to be considered later; Chapters 17 to19. This chapter is completed by consideration of the extension of gthe formalism to imaginary time, where the Feynman Path Integral becomes the Partition Function of Statistical Mechanics, and by the definition of the Green's functions, ground-state expectation values of products of quantum operators q(t) taken at different times, https://www.w3.org/1998/Math/MathML" display="inline"> t 1 , t 2 … t N .
A quantum particle is confined to a cubic box of side length https://www.w3.org/1998/Math/MathML" display="inline"> L and volume https://www.w3.org/1998/Math/MathML" display="inline"> V . Its Hamiltonian is https://www.w3.org/1998/Math/MathML" display="inline"> H = p 2 / ( 2 m ) . Assume periodic boundary conditions on the wave function. Find the energy eigenvalues and a complete set of eigenstates. Show that the computation of the canonical partition function, https://www.w3.org/1998/Math/MathML" display="inline"> Z 1 , can be reduced to the evaluation of the sum 5.1 https://www.w3.org/1998/Math/MathML" display="block"> f ( θ ) = ∑ n = − ∞ ∞ e − θ n 2 . Write https://www.w3.org/1998/Math/MathML" display="inline"> θ in terms of https://www.w3.org/1998/Math/MathML" display="inline"> L and the thermal wavelength https://www.w3.org/1998/Math/MathML" display="inline"> λ . Show that if https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) is approximated as 5.2 https://www.w3.org/1998/Math/MathML" display="block"> f ( θ ) ≃ ∫ − ∞ ∞ d n e − θ n 2 ≡ I ( θ ) , then one recovers the classical partition function. For https://www.w3.org/1998/Math/MathML" display="inline"> θ = 0.1 , 1 , and https://www.w3.org/1998/Math/MathML" display="inline"> 2 , plot the Gaussian https://www.w3.org/1998/Math/MathML" display="inline"> e − θ n 2 together with the corresponding centered step function. In light of these plots, what would appear to be a reasonable criterion for approximating https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) by https://www.w3.org/1998/Math/MathML" display="inline"> I ( θ ) ? Compute https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) and https://www.w3.org/1998/Math/MathML" display="inline"> I ( θ ) numerically, and determine the relative error incurred in approximating https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) by https://www.w3.org/1998/Math/MathML" display="inline"> I ( θ ) for each value of https://www.w3.org/1998/Math/MathML" display="inline"> θ in part (b). Determine the bounds on https://www.w3.org/1998/Math/MathML" display="inline"> θ for which the relative error in approximating https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) by https://www.w3.org/1998/Math/MathML" display="inline"> I ( θ ) is less than https://www.w3.org/1998/Math/MathML" display="inline"> 1 % , https://www.w3.org/1998/Math/MathML" display="inline"> 0.01 % , and https://www.w3.org/1998/Math/MathML" display="inline"> 10 − 6 % . With these results in hand, what would be a more precise criterion for approximating https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) by https://www.w3.org/1998/Math/MathML" display="inline"> I ( θ ) ? Using the Poisson summation formula, Eq. (15.12), show that 5.3 https://www.w3.org/1998/Math/MathML" display="block"> Z 1 = V λ 3 ( 1 + 2 ∑ ν = 1 ∞ e − ν 2 π L 2 / λ 2 ) 3 = V λ 3 ( 1 + 6 e − π L 2 / λ 2 + 18 e − 4 π L 2 / λ 2 + ⋯ ) . This identity should explain the somewhat unexpected results from parts (c) and (d). But does it make it any less surprising that two functions whose graphs differ so markedly should have nearly identical integrals? Consider an H 2 molecule at https://www.w3.org/1998/Math/MathML" display="inline"> 300 K in a https://www.w3.org/1998/Math/MathML" display="inline"> 10 nm 3 box. Find the relative error when https://www.w3.org/1998/Math/MathML" display="inline"> Z 1 is computed using https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) ≃ I ( θ ) . At what temperature does the approximation break down? Show that there is a practical lower bound on the number of particles for which the following two conditions are simultaneously satisfied: (i) quantum statistics become relevant, and (ii) the approximation https://www.w3.org/1998/Math/MathML" display="inline"> f ( θ ) ≃ I ( θ ) remains valid.