The ability to simulate a fermionic system on a quantum computer is expected to revolutionize chemical engineering, materials design, nuclear physics, to name a few. Thus, optimizing the simulation circuits is of significance in harnessing the power of quantum computers. Here, we address this problem in two aspects. In the fault-tolerant regime, we optimize the Rz and T gate counts along with the ancilla qubit counts required, assuming the use of a product-formula algorithm for implementation. We obtain a savings ratio of two in the gate counts and a savings ratio of eleven in the number of ancilla qubits required over the state of the art. In the pre-fault tolerant regime, we optimize the two-qubit gate counts, assuming the use of the variational quantum eigensolver (VQE) approach. Specific to the latter, we present a framework that enables bootstrapping the VQE progression towards the convergence of the ground-state energy of the fermionic system. This framework, based on perturbation theory, is capable of improving the energy estimate at each cycle of the VQE progression, by about a factor of three closer to the known ground-state energy compared to the standard VQE approach in the test-bed, classically-accessible system of the water molecule. The improved energy estimate in turn results in a commensurate level of savings of quantum resources, such as the number of qubits and quantum gates, required to be within a pre-specified tolerance from the known ground-state energy. We also explore a suite of generalized transformations of fermion to qubit operators and show that resource-requirement savings of up to more than 20% , in small instances, is possible.
Accurate determination of ground-state energies for molecules remains a challenge in quantum chemistry and a cornerstone for progress in fields such as drug discovery and materials design. The Variational Quantum Eigensolver (VQE) represents a leading hybrid quantum-classical paradigm for addressing this challenge; however, its widespread realization is limited by noise and the restricted scalability of current quantum hardware. Achieving efficient simulations on Noisy Intermediate-Scale Quantum (NISQ) devices and forthcoming Fault-Tolerant Application-Scalable Quantum (FASQ) systems demands a detailed understanding of how computational resources scale with molecular complexity and fermion-to-qubit encodings. In this study, resource requirements for VQE implementations employing the Unitary Coupled Cluster Singles and Doubles (UCCSD) ansatz are systematically analyzed. The molecular Hamiltonian is formulated in second quantization and mapped to qubit operators through the Jordan-Wigner (JW), Bravyi-Kitaev (BK), and Parity (Pa) transformations. Hamiltonian reduction strategies, including
Z2 tapering and frozen-core approximations, are examined to assess their effect on quantum resource scaling. The analysis reveals that appropriate transformations, when combined with symmetry-based reductions, can substantially reduce qubit counts by up to
≈50% and quantum gate counts by up to
≈27.5× and Hamiltonian Pauli string counts by up to
≈2.75×, relative to the corresponding unreduced Hamiltonian representations within the same active-space configuration for the representative set of molecular systems under study. These findings provide practical circuit-level insights for executing chemically relevant simulations on NISQ hardware, while establishing physical-resource baselines that may inform future logical-level analyses targeting FASQ systems.
With quantum computers on the horizon, it is essential to understand what problems they can be used to solve. One potential application is simulating quantum systems, in particular, systems with many interacting electrons. However, there is a disparity between the computational resources required to study these problems and the capabilities of modern experimental quantum devices. In this thesis, we make progress toward closing this gap by reducing the cost of quantum simulation of quantum chemistry on a number of fronts. In the first half, we develop three improved quantum simulation algorithms by approximating time evolution under the Hamiltonian using a truncated Taylor series rather than the Trotter-Suzuki decomposition. We do this first for the molecular electronic structure Hamiltonian in two representations, obtaining asymptotic improvements in terms of both the number of orbitals and the required precision. We also apply the truncated Taylor series paradigm to quantum simulation in real space, where we consider simulation of general wave functions discretized on a uniform grid. In the second half, by working with Hamiltonians tailored specifically to quantum algorithms, we demonstrate that Trotter steps of the electronic structure Hamiltonian can be simulated in exactly N depth and with only linear connectivity, where N is the number of spin-orbitals. This resolves the problem of non-locality in fermion-to-qubit mappings, and has wide-ranging applications for variational and phase estimation-based quantum simulation of quantum chemistry. We further study this algorithm on an error-corrected quantum computer using the surface code. Benchmarking it alongside other product formula approaches, we show that quantum simulation of scientifically important instances of the electronic structure problem that are classically intractable can be performed with only a few hundred thousand physical qubits and fewer than one billion costly fault-tolerant gates. Finally, we study the effect of using randomized Hamiltonians in iterative phase estimation, and how this allows us to reduce the costs of simulation as well as to exploit knowledge of the ground state in how we design our simulation algorithm.
One of the first practical applications of quantum computers is expected to be molecular modelling. Performing this task would profoundly affect areas such as chemistry, materials science and drug synthesis. Modelling of molecules, which are classically intractable, can be achieved with just over
30 qubits, whereas state of the art quantum computers already have more than
50 qubits. The Variational Quantum Eigensolver (VQE) algorithm and VQE based protocols, are promising candidates to enable this task on emerging Noisy Intermediate-Scale Quantum (NISQ) computers. These protocols require short quantum circuits and short coherence times, and are particularly resilient to quantum errors. Nevertheless, there is still a significant gap between the accuracy and the coherence times of current NISQ computers, and the hardware requirements of VQE protocols to simulate practically interesting molecules. In this thesis, I present my contribution to narrowing this gap by developing VQE protocols for molecular modelling that are less demanding on quantum hardware. The VQE relies on the Rayleigh-Ritz variational principle to estimate the eigenvalues of a Hamiltonian operator, by minimizing its expectation value with respect to a trial quantum state, prepared by an ansatz. A major challenge for the practical realisation of VQE protocols on NISQ computers is to construct an ansatz that: (1) can accurately approximate the eigenstates of the Hamiltonian; (2) is easy to optimize; and (3) can be implemented by a shallow circuit, within the capabilities of a NISQ computer. The most widely used, unitary coupled cluster (UCC), type of ans\"atze mathematically correspond to a product of unitary evolutions of fermionic excitation operators. Owing to their fermionic structure, UCC ans\"atze preserve the symmetries of electronic wavefunctions, and thus are accurate and easy to optimize. Nevertheless, UCC ans\"atze are implemented by high depth circuits, which severely limit the size of the molecules that can be reliably simulated on NISQ computers. In this thesis, I begin by constructing efficient quantum circuits to perform evolutions of fermionic excitation operators. The circuits are optimized in the number of two-qubit entangling gates, which are the current bottleneck of NISQ computers. Compared to the standard circuits used to implement evolutions of fermionic excitation operators, the circuits derived in this thesis reduce the number of two-qubit entangling gates by more than
70% on average. As an intermediate result, I also derive efficient circuits to perform evolutions of qubit excitation operators (excitation operators that account for qubit, rather than fermionic commutation relations). Even with the fermionic-excitation-evolution circuits derived here, UCC ans\"atze still require very long circuits, with a particularly large number of two-qubit entangling gates. In this thesis, I consider the use of alternative VQE ans\"atze, based on evolutions of qubit excitation operators. Due to not accounting for fermionic anticommutation, evolutions of qubit excitation operators can be performed by circuits that require asymptotically fewer two-qubit entangling gates. Furthermore, qubit excitation operators preserve many of the physical properties of fermionic excitation operators. Performing a number of classical numerical VQE simulations for small molecules, I show that qubit-excitation-based ans\"atze can approximate molecular electronic wavefunctions almost as accurately as fermionic-excitation-based ans\"atze. Hence, I argue that evolutions of qubit excitation operators are more suitable to construct molecular ans\"atze than evolutions of fermionic excitation operators, especially in the era of NISQ computers. Motivated by the advantage of qubit-excitation-based ans\"atze, I introduce the qubit-excitation-based adaptive variational quantum eigensolver (QEB-ADAPT-VQE). The QEB-ADAPT-VQE belongs to a family of ADAPT-VQE protocols for molecular modelling that grow a problem-tailored ansatz by iteratively appending unitary operators sampled from a predefined finite-size pool of operators. The operator at each iteration is sampled based on an ansatz-growing strategy, which aims to achieve the lowest estimate for the Hamiltonian expectation value at each iteration. In this way, ADAPT-VQE protocols construct shallow-circuit, few-parameter ans\"atze tailored specifically to the molecular systems of interest. In the case of the QEB-ADAPT-VQE, the operator pool is defined by a set of evolutions of single and double qubit excitation operators. I benchmark the performance of the QEB-ADAPT-VQE, by performing classical numerical simulations. I demonstrate that it can construct ans\"atze that are several orders of magnitude more accurate, and require significantly shallower circuits, than standard UCC ans\"atze. I also compare the QEB-ADAPT-VQE against the original fermionic-ADAPT-VQE, which utilizes a pool of fermionic excitation evolutions, and the qubit-ADAPT-VQE, which utilizes a pool of Pauli-string evolutions. I demonstrate that, in terms of circuit efficiency and convergence speed, the QEB-ADAPT-VQE systematically outperforms the qubit-ADAPT-VQE, which to my knowledge was the previous most circuit-efficient, scalable VQE protocol for molecular modeling. The QEB-ADAPT-VQE protocol, therefore represents a significant improvement in the field of VQE protocols for molecular modelling and brings us closer to achieving practical quantum advantage. Lastly, I outline a modified version of the QEB-ADAPT-VQE, the excited-QEB-ADAPT-VQE, designed to estimate energies of excited molecular states. The excited-QEB-ADAPT-VQE is more robust to initial simulation conditions, at the expense of increased computational complexity.
Simulating the dynamics of electrons and other fermionic particles in quantum chemistry, materials science, and high-energy physics is one of the most promising applications of fault-tolerant quantum computers. However, the overhead in mapping time evolution under fermionic Hamiltonians to qubit gates renders this endeavor challenging. We introduce fermionic fault-tolerant quantum computing, a framework which removes this overhead altogether. Using native fermionic operations we first construct a repetition code which corrects phase errors only. Within a fermionic color code, which corrects for both phase and loss errors, we then realize a universal fermionic gate set, including transversal fermionic Clifford gates. Interfacing with qubit color codes we introduce qubit-fermion fault-tolerant computation, which allows for qubit-controlled fermionic time evolution, a crucial subroutine in state-of-the-art quantum algorithms. As an application, we consider simulating crystalline materials, finding an exponential improvement in circuit depth for a single time step from
O(N) to
O(log(N)) with respect to lattice site number
N while retaining a site count of
O~(N), implying a linear-in-
N end-to-end gate depth for simulating materials, as opposed to quadratic in previous approaches. We also introduce a fermion-inspired qubit algorithm with
O(log(N) depth, but a prohibitive number of additional ancilla qubits. We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates. Our work opens the door to fermion-qubit fault-tolerant quantum computation in platforms with native fermions such as neutral atoms, quantum dots and donors in silicon, with applications in quantum chemistry, material science, and high-energy physics.
Abstract Quantum computing leverages the quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical computers. Examples include calculating molecular and nuclear structure, simulating strongly interacting electron systems, and modeling aspects of material function. While substantial theoretical advances have been made in mapping these problems to quantum algorithms, there remains a large gap between the resource requirements for solving such problems and the capabilities of currently available quantum hardware. Bridging this gap will require a co-design approach, where the expression of algorithms is developed in conjunction with the hardware itself to optimize execution. Here we describe an extensible co-design framework for solving chemistry problems on a trapped-ion quantum computer and apply it to estimating the ground-state energy of the water molecule using the variational quantum eigensolver (VQE) method. The controllability of the trapped-ion quantum computer enables robust energy estimates using the prepared VQE ansatz states. The systematic and statistical errors are comparable to the chemical accuracy, which is the target threshold necessary for predicting the rates of chemical reaction dynamics, without resorting to any error mitigation techniques based on Richardson extrapolation.
We conducted a thorough evaluation of various state-of-the-art strategies to prepare the ground state wavefunction of a system on a quantum computer, specifically within the framework of variational quantum eigensolver (VQE). Despite the advantages of VQE and its variants, the current quantum computational chemistry calculations often provide inaccurate results for larger molecules, mainly due to the polynomial growth in the depth of quantum circuits and the number of two-qubit gates, such as CNOT gates. To alleviate this problem, we aim to design efficient quantum circuits that would outperform the existing ones on the current noisy quantum devices. In this study, we designed a novel quantum circuit that reduces the required circuit depth and number of two-qubit entangling gates by about 60%, while retaining the accuracy of the ground state energies close to the chemical accuracy. Moreover, even in the presence of device noise, these novel shallower circuits yielded substantially low error rates than the existing approaches for predicting the ground state energies of molecules. By considering the umbrella inversion process in ammonia molecule as an example, we demonstrated the advantages of this new approach and estimated the energy barrier for the inversion process.