A technique relates to reducing qubits required on a quantum computer. A Fermionic system is characterized in terms of a Hamiltonian. The Fermionic system includes Fermions and Fermionic modes with a total number of 2M Fermionic modes. The Hamiltonian has a parity symmetry encoded by spin up and spin down parity operators. Fermionic modes are sorted such that the first half of 2M modes corresponds to spin up and the second half of 2M modes corresponds to spin down. The Hamiltonian and the parity operators are transformed utilizing a Fermion to qubit mapping that transforms parity operators to a first single qubit Pauli operator on a qubit M and a second single qubit Pauli operator on a qubit 2M. The qubit M having been operated on by the first single qubit Pauli operator and the qubit 2M having been operated on by the second single qubit Pauli operator are removed.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A computer-implemented method of reducing a number of qubits required on a quantum computer, the method comprising: characterizing a Fermionic system in terms of a Hamiltonian, the Fermionic system including Fermions and Fermionic modes with a total number of 2M Fermionic modes, wherein the Hamiltonian has a parity symmetry encoded by spin up and spin down parity operators; sorting the Fermionic modes on the Hamiltonian, such that the first half of the 2M modes corresponds to spin up and the second half of the 2M modes corresponds to spin down; transforming the Hamiltonian and the parity operators utilizing a Fermion to qubit mapping, wherein the Fermion to qubit mapping transforms the parity operators to a first single qubit Pauli operator on a qubit M and a second single qubit Pauli operator on a qubit 2M; and removing the qubit M having been operated on by the first single qubit Pauli operator and the qubit 2M having been operated on by the second single qubit Pauli operator. 2. The method of claim 1, wherein the Fermion to qubit mapping is a generalized Jordan-Wigner transformation. 3. The method of claim 1, wherein the first single qubit Pauli operator on the qubit M is a Pauli Z-matrix on the qubit M. 4. The method of claim 3, wherein the second single qubit Pauli operator on the qubit 2M is a product of two Pauli Z-matrices at sites of the qubit M and the qubit 2M. 5. The method of claim 1, wherein removing the qubit M having been operated on by the first single qubit Pauli operator comprises replacing the qubit M with an eigenvalues of +1 or −1 according to a parity of the qubit M. 6. The method of claim 5, wherein removing the qubit 2M having been operated on by the second single qubit Pauli operator comprises replacing the qubit 2M with an eigenvalues of +1 or −1 according to a parity of the qubit 2M. 7. The method of claim 6, wherein the qubit M encodes the parity of qubit M and the qubit 2M encode the parity of qubit 2M. 8. The method of claim 7, wherein the parities of the qubit M and the qubit 2M are known in advance. 9. The method claim 1 further comprising executing the Hamiltonian having reduced qubits on the quantum computer. 10. A computer-implemented method of reducing a number of qubits required on a quantum computer, the method comprising: characterizing a Fermionic system in terms of a Hamiltonian, the Fermionic system including Fermions and Fermionic modes; transforming the Hamiltonian utilizing a Fermion to qubit mapping; finding Pauli symmetry operators of the Hamiltonian; transforming the Pauli symmetry operators into single qubit Pauli operators; and removing every qubit that the single qubit Pauli operators are acting upon. 11. The method of claim 10, wherein the Fermion to qubit mapping is a generalized Jordan-Wigner transformation or a standard Jordan-Wigner transformation. 12. The method of claim 10, wherein finding Pauli symmetry operators of the Hamiltonian comprises: performing a parity check matrix on the Hamiltonian to determine the Pauli symmetry operators; if no Pauli symmetry operators are found, determining that no further reduction can be performed; and if the Pauli symmetry operators are found, determining a commuting set of the Pauli symmetry operators. 13. The method of claim 12, wherein transforming the Pauli symmetry operators into the single qubit Pauli operators comprises constructing a Clifford transformation for the commuting set of the Pauli symmetry operators to map to the commuting set of the Pauli symmetry operators to the single qubit Pauli operators. 14. A computer-implemented method of reducing a number of qubits required on a quantum computer, the method comprising: characterizing a Fermionic system in terms of a Hamiltonian, the Fermionic system including Fermions and Fermionic modes with a total number of M Fermionic modes, wherein the Hamiltonian has particle number symmetry and N particles; transforming the Hamiltonian utilizing a Fermion to qubit mapping that transforms from M Fermionic modes to M qubits, wherein the M qubits are represented by M-bit strings in a computational basis; and applying a compression map to the Hamiltonian such that the Hamiltonian having the M qubits is mapped to a transformed Hamiltonian with Q qubits where Q<M, wherein the compression map maps the M-bit strings labeling the M qubits in the computational basis with Hamming weight N to Q-bit strings. 15. The method of claim 14, wherein the computational basis is a 0 and 1 for each of the M qubits. 16. The method of claim 14 further comprising: in response to the quantum computer measuring an energy of the transformed Hamiltonian with the Q qubits, receiving measured energy for each compressed term of the transformed Hamiltonian, the quantum computer including a quantum measurement circuit on Q+1 qubits; performing a decoding on the measured energy to obtain measured results of each uncompressed term in the Hamiltonian; and combining the measured results to obtain the energy of the Hamiltonian prior to applying the compression map. 17. The method of claim 16, wherein: the transformed Hamiltonian comprises compressed terms; and the Hamiltonian prior to applying the compression map comprises uncompressed terms. 18. A system comprising: memory including computer-executable instructions for reducing a number of qubits required on a quantum computer; and a processor executing the computer-executable instructions, the computer-executable instructions causing the processor to perform operations comprising: characterizing a Fermionic system in terms of a Hamiltonian, the Fermionic system including Fermions and Fermionic modes with a total number of 2M Fermionic modes, wherein the Hamiltonian has a parity symmetry encoded by spin up and spin down parity operators; sorting the Fermionic modes on the Hamiltonian, such that the first half of the 2M modes corresponds to spin up and the second half of the 2M modes corresponds to spin down; transforming the Hamiltonian and the parity operators utilizing a Fermion to qubit mapping, wherein the Fermion to qubit mapping transforms the parity operators to a first single qubit Pauli operator on a qubit M and a second single qubit Pauli operator on a qubit 2M; and removing the qubit M having been operated on by the first single qubit Pauli operator and the qubit 2M having been operated on by the second single qubit Pauli operator. 19. The system of claim 18, wherein the Fermion to qubit mapping is a generalized Jordan-Wigner transformation. 20. The system of claim 19, wherein the first single qubit Pauli operator on the qubit M is a Pauli Z-matrix on the qubit M. 21. The system of claim 20, wherein the second single qubit Pauli operator on the qubit 2M is a product of two Pauli Z-matrices at sites of the qubit M and the qubit 2M. 22. The system of claim 18, wherein removing the qubit M having been operated on by the first single qubit Pauli operator comprises replacing the qubit M with an eigenvalues of +1 or −1 according to a parity the qubit M. 23. The system of claim 22, wherein removing the qubit 2M having been operated on by the second single qubit Pauli operator comprises replacing the qubit 2M with an eigenvalues of +1 or −1 according to a parity the qubit 2M. 24. The system of claim 23, wherein: the qubit M encodes the parity of the qubit M and the qubit 2M encodes the parity of qubit 2M; and the parities of the qubit M and the qubit 2M are known in advance. 25. A system comprising: memory including computer-executable instructions for reducing a number of qubits required on a quantum computer; and a processor executing the computer-executable instructions, the computer-executable instructions causing the processor to perform operations comprising: characterizing a Fermionic system in terms of a Hamiltonian, the Fermionic system including Fermions and Fermionic modes; transforming the Hamiltonian utilizing a Fermion to qubit mapping; finding Pauli symmetry operators of the Hamiltonian; transforming the Pauli symmetry operators into single qubit Pauli operators; and removing every qubit that the single qubit Pauli operators are acting upon.