We develop theoretical methods for the implementation of creation and destruction operators in separate registers of a quantum computer, allowing for a transparent and dynamical creation and destruction of particle modes in second quantization in problems with variable particle number. We establish theorems for the commutation (anticommutation) relations on a finite memory bank and provide the needed symmetrizing and antisymmetrizing operators. Finally, we provide formulas in terms of these operators for unitary evolution under conventional two- and four-body Hamiltonian terms, as well as terms varying the particle number. In this formalism, the number of qubits needed to codify n particles with N p modes each is of order O ( n log 2 N p ) . Such scaling is more efficient than the Jordan-Wigner transformation which requires O ( N p ) qubits, whenever there are a modest number of particles with a large number of states available to each (and less advantageous for a large number of particles with few states available to each). Published by the American Physical Society 2024
We develop theoretical methods for the implementation of creation and destruction operators in separate registers of a quantum computer, allowing for a transparent and dynamical creation and destruction of particle modes in second quantization in problems with variable particle number. We establish theorems for the commutation (anticommutation) relations on a finite memory bank and provide the needed symmetrizing and antisymmetrizing operators. Finally, we provide formulas in terms of these operators for unitary evolution under conventional two- and four-body Hamiltonian terms, as well as terms varying the particle number. In this formalism, the number of qubits needed to codify n particles with N p modes each is of order O ( n log 2 N p ) . Such scaling is more efficient than the Jordan-Wigner transformation which requires O ( N p ) qubits, whenever there are a modest number of particles with a large number of states available to each (and less advantageous for a large number of particles with few states available to each). Published by the American Physical Society 2024
Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic creation-annihilation operators, and the space depends on the number of qubits used. While standard fermion encodings like Jordan-Wigner are space optimal for arbitrary fermionic systems, physical symmetries like particle conservation can reduce the number of physical configurations, allowing improved space complexity. Such space saving is only feasible if the gate overhead is small, suggesting a (quantum) data structures problem, wherein one would like to minimize space used to represent a fermionic state, while still enabling efficient rotations. We define a structure which naturally captures mappings from fermions to systems of qubits. We then instantiate it in two ways, giving rise to two new second-quantized fermion encodings of F fermions in M modes. An information theoretic minimum of I: = ⌈log₂ binom(M,F)⌉ qubits is required for such systems, a bound we nearly match over the entire parameter regime. 1) Our first construction uses I + o(I) qubits when F = o(M), and allows rotations generated by creation-annihilation operators in O(I) gates and O(log M log log M) depth. 2) Our second construction uses I + O(1) qubits when F = Θ(M), and allows rotations generated by creation-annihilation operators in O(I³) gates. In relation to comparable prior work, the first represents a polynomial improvement in both space and gate complexity (against Kirby et al. 2022), and the second represents an exponential improvement in gate complexity at the cost of only a constant number of additional qubits (against Harrison et al. or Shee et al. 2022), in the described parameter regimes.
These lecture notes originate from a one-semester course on the mathematical foundations of second quantization, first given at the Department of Physics of the Friedrich-Alexander-Universität Erlangen-Nürnberg in the Winter Semester 2025/26 to a mixed audience of physics and mathematics students. Their guiding thread is a class of physical models: spin-boson models, describing a two-level system coupled to a boson field. After summarizing the necessary background on unbounded operators, up to the Kato-Rellich and KLMN theorems, and developing direct sums and tensor products of Hilbert spaces and of unbounded operators, we treat single-mode boson fields, constructing the ladder and number operators and characterizing their domains, before moving to Fock spaces, second quantization, bosonic and fermionic annihilation and creation operators, and the canonical (anti)commutation relations. Throughout, spin-boson models provide both the motivation and the test bench for the formalism: we rigorously establish their self-adjointness, solve the pure dephasing and Jaynes-Cummings models explicitly, deriving their spectra and the qubit channels they induce, show how their multimode counterparts display irreversible decoherence and decay, and, in an appendix, prove the rotating-wave approximation for the quantum Rabi model with an explicit error bound. Finally, we use the KLMN theorem to construct spin-boson models with non-normalizable form factors, and briefly discuss stronger ultraviolet divergences and the need for renormalization. Exercises with full solutions are included.
Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic creation-annihilation operators, and the space depends on the number of qubits used. While standard fermion encodings like Jordan-Wigner are space optimal for arbitrary fermionic systems, physical symmetries like particle conservation can reduce the number of physical configurations, allowing improved space complexity. Such space saving is only feasible if the gate overhead is small, suggesting a (quantum) data structures problem, wherein one would like to minimize space used to represent a fermionic state, while still enabling efficient rotations. We define a structure which naturally captures mappings from fermions to systems of qubits. We then instantiate it in two ways, giving rise to two new second-quantized fermion encodings of F fermions in M modes. An information theoretic minimum of I:=⌈log(FM)⌉ qubits is required for such systems, a bound we nearly match over the entire parameter regime. (1) Our first construction uses I+o(I) qubits when F=o(M), and allows rotations generated by creation-annihilation operators in O(I) gates and O(logMloglogM) depth. (2) Our second construction uses I+O(1) qubits when F=Θ(M), and allows rotations generated by creation-annihilation operators in O(I3) gates. In relation to comparable prior work, the first represents a polynomial improvement in both space and gate complexity (against Kirby et al. 2022), and the second represents an exponential improvement in gate complexity at the cost of only a constant number of additional qubits (against Harrison et al. or Shee et al. 2022), in the described parameter regimes.
In this chapter we describe a technique to deal with identical particles that is called second quantization . Despite being a technique, second quantization helps a lot in understanding physics. One can learn and endlessly repeat newspaper-style statements particles are fields , fields are particles without grasping their meaning. Second quantization brings these concepts to an operational level. Since the procedure of second quantization is slightly different for fermions and bosons, we have to treat the two cases separately. We start with considering a system of identical bosons, and introduce creation and annihilation operators (CAPs) that change the number of particles in a given many-particle state, thereby connecting different states in Fock space. We show how to express occupation numbers in terms of CAPs, and then get to the heart of the second quantization: the commutation relations for the bosonic CAPs. As a next step, we construct field operators out of the CAPs and spend quite some time (and energy) presenting the physics of the particles in terms of these field operators. Only afterward, do we explain why all this activity has been called second quantization. In Section 3.4 we then present the same procedure for fermions, and we mainly focus on what is different as compared to bosons. The formalism of second quantization is summarized in Table 3.1.
A quantum computer is similar to an ordinary computer, except that instead of bits it uses two-level quantum systems (qubits), and the usual logical operations on bits are replaced with noiseless quantum dynamics in the form of unitary gates or Hamiltonian interactions. Many sets of resources that are universal for quantum computation (that is, capable of implementing any quantum computation) have been found, but general conditions for universality are still only partially understood. Improving our understanding of these conditions contributes to two broad goals. On the one hand, understanding what class of physical systems is suitable for quantum computation allows us choose the systems that are most easily controlled or built in the laboratory. On the other hand, identifying the unifying characteristics of such a class provides insight into the fundamental physics responsible for the much greater computational power of quantum computers. The original results presented in this thesis are a contribution to our understanding of the physical requirements for universal quantum computation. These results lead to the identification of a new, large class of universal dynamics. More specifically, the main problem that is addressed is the following: consider a physical system that is made up of a finite number of qubits that are subject to a natural, fixed interaction described by a two-body Hamiltonian. Suppose we have the ability to control the system only by applying fast one-qubit operations. Under what conditions is this system capable of universal quantum computation? The first original result of the thesis is to prove that universal quantum computation is possible under these conditions given the single extra constraint that the Hamiltonian must entangle, or connect, all of the qubits. In other words, since a two-body Hamiltonian is expressible as a sum of coupling terms each of which acts nontrivially on a pair of qubits, consider the graph whose vertices correspond to qubits and whose edges connect qubits that are coupled by a term in the Hamiltonian. Then this Hamiltonian, together with fast one-qubit unitaries, is universal for quantum computation precisely when the corresponding graph is connected. This result suggests many potential generalizations, three of which are explored in this thesis. The first generalization is to show that the same result holds for a two-body Hamiltonian that acts on D-dimensional quantum systems (qudits), given fast one-qudit unitaries. A second extension is to the case of a many-body Hamiltonian, that is, a Hamiltonian that has coupling terms that act on more than two qubits. Again, we find that under mild restrictions, such Hamiltonians are universal provided they are connected and that arbitrary one-qubit unitaries are available. We also discover and explore some surprising structure in many-body Hamiltonians that is associated with the parity of the couplings. A third related problem that is addressed is the question of what two-qubit unitaries are universal for quantum computation. This problem was originally solved by J.-L. and R. Brylinski [BB02], who gave a technical proof of the universality of any two-qudit gate that is not the swap gate or a product of one-qudit unitaries, given one-qudit unitaries as a free resource. We develop an elementary and constructive proof for the case of qubits, and prove that our construction is very close to optimal in the number of uses of the two-qubit gate. Given a qualitative understanding of what dynamical resources are universal for quantum computation, it is natural to consider developing a quantitative measure of the usefulness of quantum dynamics for quantum information processing. This is done in the final chapter of the thesis, in which the beginnings of a quantitative theory of quantum dynamics are developed.
The formalism of the second quantization is developed entirely within the framework of the Dirac-Jordan representation theory. The equivalence of this formalism and the methods of ordinary coordinate-spin space is shown, and the equations of "connection" are fully developed. It is shown that the "creation" and "annihilation" operators, and indeed all operators which do not commute with the quantized Hamiltonian and hence whose representatives cannot be explicitly given in a configuration space of a fixed number of dimensions are easily treated in terms of the general representation theory and arise quite naturally. Both types of statistics are considered, and the Fock-Dirac density matrix and self-consistent field are treated as a simple illustration.