Search

The detailed guide's purpose is to assist educators and community leaders in designing and implementing educational programs to serve student and community needs, and to identify the goals and elements of cooperative vocational education. One chapter describes the necessary characteristics of the teacher-coordinator in such programs, and the advantages of cooperative vocational education to the community and to the students. Two other chapters suggest methods for determining employers' and students' needs for cooperative vocational education and suggest plans for meeting these needs. Three chapters deal with implementing plans for: public relations (including a suggested eight point plan and the use of media); instruction in the school (including five teaching methods and the use of youth organizations); and community laboratories (including criteria for selecting, establishing, and evaluating training stations, and guidelines for complying with appropriate laws). Another chapter analyzes essential elements of the cooperative program including staffing; facilities, equipment, and materials; and program development. A final chapter suggests ways of improving cooperative vocational education in its administrative structure, professional development of teacher-coordinators, instructional materials, and program evaluation. A 70-page appendix displays forms appropriate to the planning, implementation, and evaluation of programs. (JR)

We study Babai numbers and Babai $k$-spectra of paths and cycles. We completely determine the Babai numbers of paths $P_n$ for $n>1$ and $1 \leq k \leq n-1$, and the Babai $k$-spectra for $P_n$ when $1 \leq k \leq n/2$. We also completely determine Babai numbers and Babai $k$-spectra of all cycles $C_n$ for $k \in \{1,2\}$ and $n \geq 3$ if $k=1$ and $n > 3$ if $k=2$., Comment: 21 pages, 1 figure, 7 references

Understanding the physics of strongly correlated materials is one of the grand challenge problems for physics today. A large class of scientifically interesting materials, from high-$T_c$ superconductors to spin liquids, involve medium to strong correlations, and building a holistic understanding of these materials is critical. Doing so is hindered by the competition between the kinetic energy and Coulomb repulsion, which renders both analytic and numerical methods unsatisfactory for describing interacting materials. Fault-tolerant quantum computers have been proposed as a path forward to overcome these difficulties, but this potential capability has not yet been fully assessed. Here, using the multi-orbital Fermi-Hubbard model as a representative model and a source of scalable problem specifications, we estimate the resource costs needed to use fault-tolerant quantum computers for obtaining experimentally relevant quantities such as correlation function estimation. We find that advances in quantum algorithms and hardware will be needed in order to reduce quantum resources and feasibly address utility-scale problem instances.

The industrial manufacturing of chemicals consumes a significant amount of energy and raw materials. In principle, the development of new catalysts could greatly improve the efficiency of chemical production. However, the discovery of viable catalysts can be exceedingly challenging because it is difficult to know the efficacy of a candidate without experimentally synthesizing and characterizing it. This study explores the feasibility of using fault-tolerant quantum computers to accelerate the discovery of homogeneous catalysts for nitrogen fixation, an industrially important chemical process. It introduces a set of ground-state energy estimation problems representative of calculations needed for the discovery of homogeneous catalysts and analyzes them on three dimensions: economic utility, classical hardness, and quantum resource requirements. For the highest utility problem considered, two steps of a catalytic cycle for the generation of cyanate anion from dinitrogen, the economic utility of running these computations is estimated to be $200,000, and the required runtime for double-factorized phase estimation on a fault-tolerant superconducting device is estimated under conservative assumptions to be 139,000 QPU-hours. The computational cost of an equivalent DMRG calculation is estimated to be about 400,000 CPU-hours. These results suggest that, with continued development, it will be feasible for fault-tolerant quantum computers to accelerate the discovery of homogeneous catalysts., Comment: 27 pages, 11 tables, 8 figures plus appendix

Across industries, traditional design and engineering workflows are being upgraded to simulation-driven processes. Many workflows include computational fluid dynamics (CFD). Simulations of turbulent flow are notorious for high compute costs and reliance on approximate methods that compromise accuracy. Improvements in the speed and accuracy of CFD calculations would potentially reduce design workflow costs by reducing computational costs and eliminating the need for experimental testing. This study explores the feasibility of using fault-tolerant quantum computers to improve the speed and accuracy of CFD simulations in the incompressible or weakly compressible regime. For the example of simulation-driven ship design, we consider simulations for calculating the drag force in steady-state flows, and provide analysis on economic utility and classical hardness. As a waypoint toward assessing the feasibility of our chosen quantum approach, we estimate the quantum resources required for the simpler case of drag force on a sphere. We estimate the product of (logical qubits)$\times$($T$ gates) to range from $10^{22}$ to $10^{28}$. These high initial estimates suggest that future quantum computers are unlikely to provide utility for incompressible CFD applications unless significant algorithmic advancements or alternative quantum approaches are developed. Encouraged by applications in quantum chemistry that have realized orders-of-magnitude improvements as they matured, we identify the most promising next steps for quantum resource reduction as we work to scale up our estimates from spheres to utility-scale problems with more complex geometry., Comment: Version 2: Block encoding the Carleman $A$-matrix section edited for clarity

We introduce an invariant of negative definite plumbed knot complements unifying knot lattice homology, due to Ozsv\'ath, Stipsicz, and Szab\'o, and the BPS $q$-series of Gukov and Manolescu. This invariant is a natural extension of weighted graded roots of negative definite plumbed 3-manifolds introduced earlier by the first two authors and Krushkal. We prove a surgery formula relating our invariant with the weighted graded root of the surgered 3-manifold., Comment: 52 pages

One promising field of quantum computation is the simulation of quantum systems, and specifically, the task of ground state energy estimation (GSEE). Ground state preparation (GSP) is a crucial component in GSEE algorithms, and classical methods like Hartree-Fock state preparation are commonly used. However, the efficiency of such classical methods diminishes exponentially with increasing system size in certain cases. In this study, we investigated whether in those cases quantum heuristic GSP methods could improve the overlap values compared to Hartree-Fock. Moreover, we carefully studied the performance gain for GSEE algorithms by exploring the trade-off between the overlap improvement and the associated resource cost in terms of T-gates of the GSP algorithm. Our findings indicate that quantum heuristic GSP can accelerate GSEE tasks, already for computationally affordable strongly-correlated systems of intermediate size. These results suggest that quantum heuristic GSP has the potential to significantly reduce the runtime requirements of GSEE algorithms, thereby enhancing their suitability for implementation on quantum hardware., Comment: 11 pages, 5 figures, 5 tables

Over the past decade, research in quantum computing has tended to fall into one of two camps: near-term intermediate scale quantum (NISQ) and fault-tolerant quantum computing (FTQC). Yet, a growing body of work has been investigating how to use quantum computers in transition between these two eras. This envisions operating with tens of thousands to millions of physical qubits, able to support fault-tolerant protocols, though operating close to the fault-tolerant threshold. Two challenges emerge from this picture: how to model the performance of devices that are continually improving and how to design algorithms to make the most use of these devices? In this work we develop a model for the performance of early fault-tolerant quantum computing (EFTQC) architectures and use this model to elucidate the regimes in which algorithms suited to such architectures are advantageous. As a concrete example, we show that, for the canonical task of phase estimation, in a regime of moderate scalability and using just over one million physical qubits, the ``reach'' of the quantum computer can be extended (compared to the standard approach) from 90-qubit instances to over 130-qubit instances using a simple early fault-tolerant quantum algorithm, which reduces the number of operations per circuit by a factor of 100 and increases the number of circuit repetitions by a factor of 10,000. This clarifies the role that such algorithms might play in the era of limited-scalability quantum computing., Comment: 20 pages, 8 figures with desmos links, plus appendix

In this work, we study a new hollow-core (air-filled) double-clad anti-resonant fiber (DC-ARF) as a potent candidate for multiphoton micro-endoscopy. We compare the fiber characteristics with a single-clad anti-resonant fiber (SC-ARF) and a solid core fiber (SCF). While the DC-ARF and the SC-ARF enable low-loss (<0.2 dBm-1), close to dispersion-free excitation pulse delivery (<10% pulse width increase at 900 nm per 1 m fiber) without any induced non-linearities, the SCF resulted in spectral broadening and pulse-stretching (> 2000% of pulse width increase at 900 nm per 1 m fiber). An ideal optical fiber endoscope needs to be several meters long and should enable both excitation and collection through the fiber. Therefore, we performed multiphoton imaging on endoscopy-compatible 1 m and 3 m lengths of fiber in the back-scattered geometry, wherein the signals were collected either directly (non-descanned detection) or through the fiber (descanned detection). Second harmonic images were collected from barium titanate crystals as well as from biological samples (rat tail tendon). In non-descanned detection conditions, the ARFs outperformed the SCF by up to 10 times in terms of signal-to-noise ratio of images. Significantly, only the DC-ARF, due to its high numerical aperture (0.45) and wide-collection bandwidth (>1 um), could provide images in the de-scanned detection configuration desirable for endoscopy. Thus, our systematic characterization and comparison of different optical fibres under different image collection configurations, confirms and establishes the utility of DC-ARFs for high-performing label-free multiphoton imaging based micro-endoscopy., Comment: 29 pages, 13 figures

Recent progress in quantum computing is paving the way for the realization of early fault-tolerant quantum computers. To maximize the utility of these devices, it is important to develop quantum algorithms that match their capabilities and limitations. Motivated by this, recent work has developed low-depth quantum algorithms for ground state energy estimation (GSEE), an important subroutine in quantum chemistry and materials. We detail a new GSEE algorithm which, like recent work, uses a number of operations scaling as $O(1/\Delta)$ as opposed to the typical $O(1/\epsilon)$, at the cost of an increase in the number of circuit repetitions from $O(1)$ to $O(1/\epsilon^2)$. The relevant features of this algorithm come about from using a Gaussian window, which exponentially reduces contamination from excited states over the simplest GSEE algorithm based on the Quantum Fourier Transform (QFT). We adapt this algorithm to interpolate between the low-depth and full-depth regime by replacing $\Delta$ with anything between $\Delta$ and $\epsilon$. At the cost of increasing the number of ancilla qubits from $1$ to $O(\log\Delta)$, our method reduces the upper bound on the number of circuit repetitions by a factor of four compared to previous methods., Comment: 12 pages, 1 figure, plus appendix

Progress in fault-tolerant quantum computation (FTQC) has driven the pursuit of practical applications with early fault-tolerant quantum computers (EFTQC). These devices, limited in their qubit counts and fault-tolerance capabilities, require algorithms that can accommodate some degrees of error, which are known as EFTQC algorithms. To predict the onset of early quantum advantage, a comprehensive methodology is needed to develop and analyze EFTQC algorithms, drawing insights from both the methodologies of noisy intermediate-scale quantum (NISQ) and traditional FTQC. To address this need, we propose such a methodology for modeling algorithm performance on EFTQC devices under varying degrees of error. As a case study, we apply our methodology to analyze the performance of Randomized Fourier Estimation (RFE), an EFTQC algorithm for phase estimation. We investigate the runtime performance and the fault-tolerant overhead of RFE in comparison to the traditional quantum phase estimation algorithm. Our analysis reveals that RFE achieves significant savings in physical qubit counts while having a much higher runtime upper bound. We anticipate even greater physical qubit savings when considering more realistic assumptions about the performance of EFTQC devices. By providing insights into the performance trade-offs and resource requirements of EFTQC algorithms, our work contributes to the development of practical and efficient quantum computing solutions on the path to quantum advantage., Comment: 9 pages, 8 figures, plus appendix

A major thrust in quantum algorithm development over the past decade has been the search for the quantum algorithms that will deliver practical quantum advantage first. Today's quantum computers and even early fault-tolerant quantum computers will be limited in the number of operations they can implement per circuit. We introduce quantum algorithms for ground state energy estimation (GSEE) that accommodate this design constraint. The first estimates ground state energies and has a quadratic improvement on the ground state overlap parameter compared to other methods in this regime. The second certifies that the estimated ground state energy is within a specified error tolerance of the true ground state energy, addressing the issue of gap estimation that beleaguers several ground state preparation and energy estimation algorithms. We note, however, that the scaling of this certification technique is, unfortunately, worse than that of the GSEE algorithm. These algorithms are based on a novel use of the quantum computer to facilitate rejection sampling. After a classical computer is used to draw samples, the quantum computer is used to accept or reject the samples. The set of accepted samples correspond to draws from a target distribution. While we use this technique for ground state energy estimation, it may find broader application. Our work pushes the boundaries of what operation-limited quantum computers are capable of and thus brings the target of quantum advantage closer to the present., Comment: 31 pages + appendix, 5 figures

The primordial ingredient of cuprate superconductivity is the CuO2 unit cell. Here, theoretical attention usually concentrates on the intra-atom Coulombic interactions dominating the 3d^9 and 3d^10 configurations of each copper ion. However, if Coulombic interactions also occur between electrons of the 2p^6 orbitals of each planar oxygen atom, spontaneous orbital ordering may split their energy levels. This long predicted intra-unit cell symmetry breaking should then generate an orbital ordered phase, for which the charge-transfer energy E separating the 2p^6 and 3d^10orbitals is distinct for the two oxygen atoms. Here we introduce sublattice resolved E(r) imaging techniques to CuO2 studies and discover intra-unit-cell rotational symmetry breaking of E(r), with energy-level splitting between the two oxygen atoms on the 50 meV scale. Spatially, this state is arranged in disordered Ising domains of orthogonally oriented orbital order that appear bounded by dopant ions, and within whose domain walls low energy electronic quadrupolar two-level systems occur. Overall, these data reveal a Q=0 orbitally ordered state that splits the energy levels of the oxygen orbitals by ~50 meV, in underdoped CuO2., Comment: Manuscript: 21 pages, 4 figures. Methods: 40 pages, 23 figures

In recent years substantial research effort has been devoted to quantum algorithms for ground state energy estimation (GSEE) in chemistry and materials. Given the many heuristic and non-heuristic methods being developed, it is challenging to assess what combination of these will ultimately be used in practice. One important metric for assessing utility is runtime. For most GSEE algorithms, the runtime depends on the ground state preparation (GSP) method. Towards assessing the utility of various combinations of GSEE and GSP methods, we asked under which conditions a GSP method should be accepted over a reference method, such as the Hartree-Fock state. We introduce a criteria for accepting or rejecting a GSP method for the purposes of GSEE. We consider different GSP methods ranging from heuristics to algorithms with provable performance guarantees and perform numerical simulations to benchmark their performance on different chemical systems, starting from small molecules like the hydrogen atom to larger systems like the jellium. In the future this approach may be used to abandon certain VQE ansatzes and other heursitics. Yet so far our findings do not provide evidence against the use of VQE and more expensive heuristic methods, like the low-depth booster. This work sets a foundation from which to further explore the requirements to achieve quantum advantage in quantum chemistry., Comment: 8 pages, 3 figures

The hope of the quantum computing field is that quantum architectures are able to scale up and realize fault-tolerant quantum computing. Due to engineering challenges, such "cheap" error correction may be decades away. In the meantime, we anticipate an era of "costly" error correction, or early fault-tolerant quantum computing. Costly error correction might warrant settling for error-prone quantum computations. This motivates the development of quantum algorithms which are robust to some degree of error as well as methods to analyze their performance in the presence of error. We introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. In both cases the analysis leads to a noise threshold, below which arbitrarily high accuracy can be achieved by increasing the number of samples used in the algorithm. As an application of this general analysis, we compute the maximum ratio of the largest circuit depth and the dephasing scale such that performance guarantees hold. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale., Comment: 27 pages, 3 figures, 1 table, 1 algorithm. To be submitted to QIP 2023

A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding is that achieving quantum advantage in this area will require some degree of fault tolerance. While hardware is improving towards this milestone, optimizing quantum algorithms also brings it closer to the present. Existing methods for ground state energy estimation are costly in that they require a number of gates per circuit that grows exponentially with the desired number of bits in precision. We reduce this cost exponentially, by developing a ground state energy estimation algorithm for which this cost grows linearly in the number of bits of precision. Relative to recent resource estimates of ground state energy estimation for the industrially-relevant molecules of ethylene-carbonate and PF$_6^-$, the estimated gate count and circuit depth is reduced by a factor of 43 and 78, respectively. Furthermore, the algorithm can use additional circuit depth to reduce the total runtime. These features make our algorithm a promising candidate for realizing quantum advantage in the era of early fault-tolerant quantum computing., Comment: 30 (16+14) pages, 3 figures. Comparison with related works is added. The presentation of the results is improved

Recently evidence has emerged in the topological superconductor Fe-chalcogenide FeTe1-xSex for time-reversal symmetry breaking (TRSB), the nature of which has strong implications on the Majorana zero modes (MZM) discovered in this system. It remains unclear however whether the TRSB resides in the topological surface state (TSS) or in the bulk, and whether it is due to an unconventional TRSB superconducting order parameter or an intertwined order. Here by performing in superconducting FeTe1-xSex crystals both surface-magneto-optic-Kerr effect (SMOKE) measurements using a Sagnac interferometer and bulk magnetic susceptibility measurements, we pinpoint the TRSB to the TSS, where we also detect a Dirac gap. Further, we observe surface TRSB in non-superconducting FeTe1-xSex of nominally identical composition, indicating that TRSB arises from an intertwined surface ferromagnetic (FM) order. The observed surface FM bears striking similarities to the two-dimensional (2D) FM found in 2D van der Waals crystals, and is highly sensitive to the exact chemical composition, thereby providing a means for optimizing the conditions for Majorana particles that are useful for robust quantum computing., Comment: accepted version at Physical Review Letters

Elemental substitution is a proven method of Fermi level tuning in topological insulators, which is needed for device applications. Through static and time resolved photoemission, we show that in MnBi$_2$Te$_4$, elemental substitution of Bi with Sb indeed tunes the Fermi level towards the bulk band gap, making the material charge neutral at 35\% Sb concentration. For the first time, we are able to directly probe the excited state band structure at this doping level, and their dynamics, which show that the decay channels at the Fermi level are severely restricted. However, elemental substitution widens the surface state gap, which we attribute to the increase in antisite defects resulting from Sb substitution. This hypothesis is supported by DFT calculations that include defects, which show a sensitivity of the topological surface state to their inclusion. Our results emphasize the need for defect control if MnBi$_{2-x}$Sb$_x$Te$_4$ is to be used for device applications.

Determining the properties of molecules and materials is one of the premier applications of quantum computing. A major question in the field is: how might we use imperfect near-term quantum computers to solve problems of practical value? We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. The method is a recursive variational series estimation method, where we expand an operator of interest in terms of Chebyshev polynomials and evaluate each term in the expansion using a variational quantum algorithm. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain., Comment: 16+10 pages, 3 figures; comments welcome

Electron-pair density wave (PDW) states are now an intense focus of research in the field of cuprate correlated superconductivity. PDWs exhibit periodically modulating superconductive electron pairing which can be visualized directly using scanned Josephson tunneling microscopy (SJTM). Although from theory, intertwining the d-wave superconducting (DSC) and PDW order parameters allows a plethora of global electron-pair orders to appear, which one actually occurs in the various cuprates is unknown. Here we use SJTM to visualize the interplay of PDW and DSC states in Bi2Sr2CaCu2O8+x at a carrier density where the charge density wave (CDW) modulations are virtually nonexistent. Simultaneous visualization of their amplitudes reveals that the intertwined PDW and DSC are mutually attractive states. Then, by separately imaging the electron-pair density modulations of the two orthogonal PDWs, we discover a robust nematic PDW state. Its spatial arrangement entails Ising domains of opposite nematicity, each consisting primarily of unidirectional and lattice commensurate electron-pair density modulations. Further, we demonstrate by direct imaging that the scattering resonances identifying Zn impurity atom sites occur predominantly within boundaries between these domains. This implies that the nematic PDW state is pinned by Zn atoms, as was recently proposed (Lozano et al, PHYSICAL REVIEW B 103, L020502 (2021)). Taken in combination, these data indicate that the PDW in Bi2Sr2CaCu2O8+x is a vestigial nematic pair density wave state (J. Wardh and M. Granath arXiv:2203.08250v1)., Comment: 15 pages, 4 figures

Measuring quantum observables by grouping terms that can be rotated to sums of only products of Pauli $\hat z$ operators (Ising form) is proven to be efficient in near term quantum computing algorithms. This approach requires extra unitary transformations to rotate the state of interest so that the measurement of a fragment's Ising form would be equivalent to measurement of the fragment for the unrotated state. These extra rotations allow one to perform a fewer number of measurements by grouping more terms into the measurable fragments with a lower overall estimator variance. However, previous estimations of the number of measurements did not take into account non-unit fidelity of quantum gates implementing the additional transformations. Through a circuit fidelity reduction, additional transformations introduce extra uncertainty and increase the needed number of measurements. Here we consider a simple model for errors introduced by additional gates needed in schemes involving grouping of commuting Pauli products. For a set of molecular electronic Hamiltonians, we confirm that the numbers of measurements in schemes using non-local qubit rotations are still lower than those in their local qubit rotation counterparts, even after accounting for uncertainties introduced by additional gates.

Quantum chemistry and materials is one of the most promising applications of quantum computing. Yet much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them. Most previous efforts have carried out resource estimations for quantum algorithms run on large-scale fault-tolerant architectures, which include the quantum phase estimation algorithm. In contrast, few have assessed the performance of near-term quantum algorithms, which include the variational quantum eigensolver (VQE) algorithm. Recently, a large-scale benchmark study [Gonthier et al. 2020] found evidence that the performance of the variational quantum eigensolver for a set of industry-relevant molecules may be too inefficient to be of practical use. This motivates the need for developing and assessing methods that improve the efficiency of VQE. In this work, we predict the runtime of the energy estimation subroutine of VQE when using robust amplitude estimation (RAE) to estimate Pauli expectation values. Under conservative assumptions, our resource estimation predicts that RAE can reduce the runtime over the standard estimation method in VQE by one to two orders of magnitude. Despite this improvement, we find that the runtimes are still too large to be practical. These findings motivate two complementary efforts towards quantum advantage: 1) the investigation of more efficient near-term methods for ground state energy estimation and 2) the development of problem instances that are of industrial value and classically challenging, but better suited to quantum computation., Comment: 8 pages, 3 figures + appendix

Intense debate has recently arisen regarding the photoinduced changes to the iron-chalcogenide superconductors, including the enhancement of superconductivity and a metastable state. Here, by employing high energy resolution, we directly observe the melting of superconductivity on ultrafast timescales. We demonstrate a distinctly nonequilibrium response on short timescales, where the gap fills in prior to the destruction of the superconducting peak, followed by a metastable response. We propose that the former is due to pair phase decoherence and speculate that the latter is due to the increase in double stripe correlations that are known to compete with superconductivity. Our results add to exciting new developments on the iron-based superconductors, indicating that the photoinduced metastable state possibly competes with superconductivity.

Quantum computing is believed to be particularly useful for the simulation of chemistry and materials, among the various applications. In recent years, there have been significant advancements in the development of near-term quantum algorithms for quantum simulation, including VQE and many of its variants. However, for such algorithms to be useful, they need to overcome several critical barriers including the inability to prepare high-quality approximations of the ground state. Current challenges to state preparation, including barren plateaus and the high-dimensionality of the optimization landscape, make state preparation through ansatz optimization unreliable. In this work, we introduce the method of ground state boosting, which uses a limited-depth quantum circuit to reliably increase the overlap with the ground state. This circuit, which we call a booster, can be used to augment an ansatz from VQE or be used as a stand-alone state preparation method. The booster converts circuit depth into ground state overlap in a controllable manner. We numerically demonstrate the capabilities of boosters by simulating the performance of a particular type of booster, namely the Gaussian booster, for preparing the ground state of $N_2$ molecular system. Beyond ground state preparation as a direct objective, many quantum algorithms, such as quantum phase estimation, rely on high-quality state preparation as a subroutine. Therefore, we foresee ground state boosting and similar methods as becoming essential algorithmic components as the field transitions into using early fault-tolerant quantum computers., Comment: Comparison with related works and more detailed proofs are added

Among other things, it is shown that for every pair of positive integers $r$, $d$, satisfying $1

The rapid development of noisy intermediate-scale quantum (NISQ) devices has raised the question of whether or not these devices will find commercial use. Unfortunately, a major shortcoming of many proposed NISQ-amenable algorithms, such as the variational quantum eigensolver (VQE), is coming into view: the algorithms require too many independent quantum measurements to solve practical problems in a reasonable amount of time. This motivates the central question of our work: how might we speed up such algorithms in spite of the impact of error on NISQ computations? We demonstrate on quantum hardware that the estimation of expectation values, a core subroutine of many quantum algorithms including VQE, can be improved in terms of precision and accuracy by using a technique we call Robust Amplitude Estimation. Consequently, this method reduces the runtime to achieve the same mean-squared error compared to the standard prepare-and-measure estimation method. The surprising result is that by using deeper, and therefore more error-prone, quantum circuits, we realize more accurate quantum computations in less time. As the quality of quantum devices improves, this method will provide a proportional reduction in estimation runtime. This technique may be used to speed up quantum computations into the regime of early fault-tolerant quantum computation and aid in the realization of quantum advantage.