Quantum computing promises a paradigm shift in computational capabilities, but its realization demands problem representations fundamentally different from classical methods. To harness quantum advantages, problems must be encoded in forms native to quantum systems—commonly via the Pauli basis, which maps operations to rotations on the Bloch sphere. This dissertation investigates the bottlenecks limiting the implementation of such encodings across quantum, hybrid, and classical contexts.
Quantum computing promises a paradigm shift in computational capabilities, but its realization demands problem representations fundamentally different from classical methods. To harness quantum advantages, problems must be encoded in forms native to quantum systems—commonly via the Pauli basis, which maps operations to rotations on the Bloch sphere. This dissertation investigates the bottlenecks limiting the implementation of such encodings across quantum, hybrid, and classical contexts.
Quantum computing exhibits the unique capability to natively and efficiently encode various natural phenomena, promising theoretical speedups of several orders of magnitude. However, not all computational tasks can be efficiently executed on quantum machines, giving rise to hybrid systems, where some portions of an application run on classical machines, while others utilize quantum resources. However, existing methods often to identify candidates to quantum execution (quantum candidates) involve a trial-and-error approach, relying on the intuition and expertise of computer scientists, resulting in varying identification durations ranging from minutes to days for a single application.
The complexity of simulating the out-of-equilibrium evolution of local operators in the Heisenberg picture is governed by the operator entanglement, which grows linearly in time for generic nonintegrable systems, leading to an exponential increase in computational resources. A promising approach to simplify this challenge involves discarding parts of the operator and focusing on a subspace formed by ``light'' Pauli strings---strings with few Pauli matrices---as proposed by Rakovszki et al. [Phys. Rev. B 105, 075131 (2022)]. In this work, we investigate whether this strategy can be applied to quenches starting from homogeneous product states. For ergodic dynamics, these initial states grant access to a wide range of equilibration temperatures. By concentrating on the desired matrix elements and retaining only the portion of the operator that contains Pauli strings parallel to the initial state, we uncover a complex scenario. In some cases, the light Pauli strings suffice to describe the dynamics, enabling efficient simulation with current algorithms. However, in other cases, heavier strings become necessary, pushing computational demands beyond our current capabilities. We analyze this behavior by introducing a measure of complexity, the operator weight entropy, which we compute for different operators across most points on the Bloch sphere.
Quantum chemistry and materials science are among the most promising areas for demonstrating algorithmic quantum advantage and quantum utility due to their inherent quantum mechanical nature. Still, large-scale simulations of quantum circuits are essential for determining the problem size at which quantum solutions outperform classical methods. In this work, we present a novel hybrid simulation approach, forming a hybrid of a fullstate and a Clifford simulator, specifically designed to address the computational challenges associated with the time evolution of quantum chemistry Hamiltonians. Our method focuses on the efficient emulation of multi-qubit rotations, a critical component of Trotterized Hamiltonian evolution. By optimizing the representation and execution of multi-qubit operations leveraging the Pauli frame, our approach significantly reduces the computational cost of simulating quantum circuits, enabling more efficient simulations. Beyond its impact on chemistry applications, our emulation strategy has broad implications for any computational workload that relies heavily on multi-qubit rotations. By increasing the efficiency of quantum simulations, our method facilitates more accurate and cost-effective studies of complex quantum systems. We quantify the performance improvements and computational savings for this emulation strategy, and we obtain a speedup of a factor ≈18 (≈22 with MPI) for our evaluated chemistry Hamiltonians with 24 qubits. Thus, we evaluate our integration of this emulation strategy into the Intel Quantum SDK, further bridging the gap between theoretical algorithm development and practical quantum software implementations.
As quantum computers are based on the laws of quantum mechanics, they are capable of solving certain problems faster than their classical counterparts. However, often algorithms which a theoretical speed-up assume that data can be loaded efficiently. In general, the runtime complexity of the loading routine depends on (i) the data encoding that defines how the data is represented and (ii) the data itself. In some cases, loading the data requires at least exponential time which destroys a potential speed-up. And especially for the first generation of devices that are currently available, the resources (qubits and operations) needed to encode the data are limited. Therefore, understanding the consequences of a particular data encoding is crucial. To capture knowledge about different encodings, we present two data encoding patterns that extend our previous collection of encoding patterns [1].
Quantum computing represents a fundamentally new paradigm in information processing, in which information is encoded and manipulated using two-level quantum systems known as qubits, whose evolution is governed by the principles of quantum mechanics. This chapter presents a structured introduction to the theoretical foundations of quantum computation, beginning with the limitations of classical computation and the physical constraints that motivate the need for a quantum model of computation. We develop the mathematical framework required to describe quantum information, introducing qubits as state vectors in Hilbert space and examining the roles of superposition, measurement, and unitary evolution. Single-qubit operations are presented through the Pauli and Hadamard gates, along with their geometric interpretation on the Bloch sphere. Building on this formalism, the discussion is extended to multi-qubit systems using tensor products, and quantum entanglement is introduced as a non-classical correlation fundamental to quantum information processing. The chapter then explores quantum algorithms, focusing on Grover’s unstructured search algorithm, to demonstrate how superposition, interference, and entanglement can be harnessed to achieve computational advantages over classical approaches. Finally, the chapter discusses applications of quantum computation, including quantum simulation, cryptography, search and optimization problems, and near-term hybrid quantum algorithms such as the Variational Quantum Eigensolver (VQE)and the Quantum Approximate Optimization (QAO) Algorithm, highlighting their relevance in the noisy intermediate-scale quantum (NISQ) era.
Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only k=poly(n) Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in n. We present a randomized classical algorithm that does take advantage of this sparsity and recovers the exact Pauli decomposition with success probability at least 1−δ, for any δ. Under the stated access model, the algorithm executes with query and runtime complexity that is polynomial in n, k, and log(1/δ). These results show that, even though finding the Pauli decomposition is exponentially hard for general matrices, it becomes efficiently solvable for matrices that are known to be sparse in the Pauli basis, a regime that is relevant to near-term quantum algorithms operating on structured classical input.