Showing papers on "Quantum computer published in 2015"

State preservation by repetitive error detection in a superconducting quantum circuit

Abstract: Quantum computing becomes viable when a quantum state can be protected from environment-induced error. If quantum bits (qubits) are sufficiently reliable, errors are sparse and quantum error correction (QEC) is capable of identifying and correcting them. Adding more qubits improves the preservation of states by guaranteeing that increasingly larger clusters of errors will not cause logical failure-a key requirement for large-scale systems. Using QEC to extend the qubit lifetime remains one of the outstanding experimental challenges in quantum computing. Here we report the protection of classical states from environmental bit-flip errors and demonstrate the suppression of these errors with increasing system size. We use a linear array of nine qubits, which is a natural step towards the two-dimensional surface code QEC scheme, and track errors as they occur by repeatedly performing projective quantum non-demolition parity measurements. Relative to a single physical qubit, we reduce the failure rate in retrieving an input state by a factor of 2.7 when using five of our nine qubits and by a factor of 8.5 when using all nine qubits after eight cycles. Additionally, we tomographically verify preservation of the non-classical Greenberger-Horne-Zeilinger state. The successful suppression of environment-induced errors will motivate further research into the many challenges associated with building a large-scale superconducting quantum computer.

A two-qubit logic gate in silicon

Abstract: Quantum computation requires qubits that can be coupled in a scalable manner, together with universal and high-fidelity one- and two-qubit logic gates. Many physical realizations of qubits exist, including single photons, trapped ions, superconducting circuits, single defects or atoms in diamond and silicon, and semiconductor quantum dots, with single-qubit fidelities that exceed the stringent thresholds required for fault-tolerant quantum computing. Despite this, high-fidelity two-qubit gates in the solid state that can be manufactured using standard lithographic techniques have so far been limited to superconducting qubits, owing to the difficulties of coupling qubits and dephasing in semiconductor systems. Here we present a two-qubit logic gate, which uses single spins in isotopically enriched silicon and is realized by performing single- and two-qubit operations in a quantum dot system using the exchange interaction, as envisaged in the Loss-DiVincenzo proposal. We realize CNOT gates via controlled-phase operations combined with single-qubit operations. Direct gate-voltage control provides single-qubit addressability, together with a switchable exchange interaction that is used in the two-qubit controlled-phase gate. By independently reading out both qubits, we measure clear anticorrelations in the two-spin probabilities of the CNOT gate.

Progress towards practical quantum variational algorithms

Abstract: The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be executed without quantum error correction. Such quantum state preparation can be used in variational approaches, optimizing parameters in the circuit to minimize the energy of the constructed quantum state for a given problem Hamiltonian. For this purpose we propose a simple-to-implement class of quantum states motivated by adiabatic state preparation. We test its accuracy and determine the required circuit depth for a Hubbard model on ladders with up to 12 sites (24 spin orbitals), and for small molecules. We find that this ansatz converges faster than previously proposed schemes based on unitary coupled clusters. While the required number of measurements is astronomically large for quantum chemistry applications to molecules, applying the variational approach to the Hubbard model (and related models) is found to be far less demanding and potentially practical on small quantum computers. We also discuss another application of quantum state preparation using short quantum circuits, to prepare trial ground states of models faster than using adiabatic state preparation.

Advances in quantum teleportation

Abstract: This review covers state-of-the-art quantum teleportation technologies, from photonic qubits and optical modes to atomic ensembles, trapped atoms and solid-state systems. Open issues and potential future implementations are also discussed. Quantum teleportation is one of the most important protocols in quantum information. By exploiting the physical resource of entanglement, quantum teleportation serves as a key primitive across a variety of quantum information tasks and represents an important building block for quantum technologies, with a pivotal role in the continuing progress of quantum communication, quantum computing and quantum networks. Here we summarize the basic theoretical ideas behind quantum teleportation and its variant protocols. We focus on the main experiments, together with the technical advantages and disadvantages associated with the use of the various technologies, from photonic qubits and optical modes to atomic ensembles, trapped atoms and solid-state systems. After analysing the current state-of-the-art, we finish by discussing open issues, challenges and potential future implementations.

An introduction to quantum machine learning

Abstract: Machine learning algorithms learn a desired input-output relation from examples in order to interpret new inputs. This is important for tasks such as image and speech recognition or strategy optimisation, with growing applications in the IT industry. In the last couple of years, researchers investigated if quantum computing can help to improve classical machine learning algorithms. Ideas range from running computationally costly algorithms or their subroutines efficiently on a quantum computer to the translation of stochastic methods into the language of quantum theory. This contribution gives a systematic overview of the emerging field of quantum machine learning. It presents the approaches as well as technical details in an accessible way, and discusses the potential of a future theory of quantum learning.

Scalable Quantum Simulation of Molecular Energies

Abstract: We report the first electronic structure calculation performed on a quantum computer without exponentially costly precompilation. We use a programmable array of superconducting qubits to compute the energy surface of molecular hydrogen using two distinct quantum algorithms. First, we experimentally execute the unitary coupled cluster method using the variational quantum eigensolver. Our efficient implementation predicts the correct dissociation energy to within chemical accuracy of the numerically exact result. Second, we experimentally demonstrate the canonical quantum algorithm for chemistry, which consists of Trotterization and quantum phase estimation. We compare the experimental performance of these approaches to show clear evidence that the variational quantum eigensolver is robust to certain errors. This error tolerance inspires hope that variational quantum simulations of classically intractable molecules may be viable in the near future.

Demonstration of a quantum error detection code using a square lattice of four superconducting qubits

Abstract: The physical realization of a quantum computer requires built-in error-correcting codes that compensate the disruption of quantum information arising from noise. Here, the authors demonstrate a quantum error detection scheme for arbitrary single-qubit errors on a four superconducting qubit lattice.

Quantum coherent optical phase modulation in an ultrafast transmission electron microscope

Abstract: Coherent manipulation of quantum systems with light is expected to be a cornerstone of future information and communication technology, including quantum computation and cryptography. The transfer of an optical phase onto a quantum wavefunction is a defining aspect of coherent interactions and forms the basis of quantum state preparation, synchronization and metrology. Light-phase-modulated electron states near atoms and molecules are essential for the techniques of attosecond science, including the generation of extreme-ultraviolet pulses and orbital tomography. In contrast, the quantum-coherent phase-modulation of energetic free-electron beams has not been demonstrated, although it promises direct access to ultrafast imaging and spectroscopy with tailored electron pulses on the attosecond scale. Here we demonstrate the coherent quantum state manipulation of free-electron populations in an electron microscope beam. We employ the interaction of ultrashort electron pulses with optical near-fields to induce Rabi oscillations in the populations of electron momentum states, observed as a function of the optical driving field. Excellent agreement with the scaling of an equal-Rabi multilevel quantum ladder is obtained, representing the observation of a light-driven 'quantum walk' coherently reshaping electron density in momentum space. We note that, after the interaction, the optically generated superposition of momentum states evolves into a train of attosecond electron pulses. Our results reveal the potential of quantum control for the precision structuring of electron densities, with possible applications ranging from ultrafast electron spectroscopy and microscopy to accelerator science and free-electron lasers.

Simulating Hamiltonian Dynamics with a Truncated Taylor Series

Abstract: We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations together with a robust form of oblivious amplitude amplification.

Digital quantum simulation of fermionic models with a superconducting circuit.

Abstract: One of the key applications of quantum information is simulating nature. Fermions are ubiquitous in nature, appearing in condensed matter systems, chemistry and high energy physics. However, universally simulating their interactions is arguably one of the largest challenges, because of the difficulties arising from anticommutativity. Here we use digital methods to construct the required arbitrary interactions, and perform quantum simulation of up to four fermionic modes with a superconducting quantum circuit. We employ in excess of 300 quantum logic gates, and reach fidelities that are consistent with a simple model of uncorrelated errors. The presented approach is in principle scalable to a larger number of modes, and arbitrary spatial dimensions.

Building logical qubits in a superconducting quantum computing system

Abstract: The technological world is in the midst of a quantum computing and quantum information revolution. Since Richard Feynman's famous "plenty of room at the bottom" lecture, hinting at the notion of novel devices employing quantum mechanics, the quantum information community has taken gigantic strides in understanding the potential applications of a quantum computer and laid the foundational requirements for building one. We believe that the next significant step will be to demonstrate a quantum memory, in which a system of interacting qubits stores an encoded logical qubit state longer than the incorporated parts. Here, we describe the important route towards a logical memory with superconducting qubits, employing a rotated version of the surface code. The current status of technology with regards to interconnected superconducting-qubit networks will be described and near-term areas of focus to improve devices will be identified. Overall, the progress in this exciting field has been astounding, but we are at an important turning point where it will be critical to incorporate engineering solutions with quantum architectural considerations, laying the foundation towards scalable fault-tolerant quantum computers in the near future.

Experimental scattershot boson sampling

Abstract: Boson sampling is a computational task strongly believed to be hard for classical computers, but efficiently solvable by orchestrated bosonic interference in a specialized quantum computer. Current experimental schemes, however, are still insufficient for a convincing demonstration of the advantage of quantum over classical computation. A new variation of this task, scattershot boson sampling, leads to an exponential increase in speed of the quantum device, using a larger number of photon sources based on parametric down-conversion. This is achieved by having multiple heralded single photons being sent, shot by shot, into different random input ports of the interferometer. We report the first scattershot boson sampling experiments, where six different photon-pair sources are coupled to integrated photonic circuits. We use recently proposed statistical tools to analyze our experimental data, providing strong evidence that our photonic quantum simulator works as expected. This approach represents an important leap toward a convincing experimental demonstration of the quantum computational supremacy.

Detecting bit-flip errors in a logical qubit using stabilizer measurements

Abstract: Quantum data are susceptible to decoherence induced by the environment and to errors in the hardware processing it. A future fault-tolerant quantum computer will use quantum error correction to actively protect against both. In the smallest error correction codes, the information in one logical qubit is encoded in a two-dimensional subspace of a larger Hilbert space of multiple physical qubits. For each code, a set of non-demolition multi-qubit measurements, termed stabilizers, can discretize and signal physical qubit errors without collapsing the encoded information. Here using a five-qubit superconducting processor, we realize the two parity measurements comprising the stabilizers of the three-qubit repetition code protecting one logical qubit from physical bit-flip errors. While increased physical qubit coherence times and shorter quantum error correction blocks are required to actively safeguard the quantum information, this demonstration is a critical step towards larger codes based on multiple parity measurements.

Solving strongly correlated electron models on a quantum computer

Abstract: Researchers propose a step-by-step quantum recipe to find the ground state of models of strongly interacting electrons.

Coherent manipulation, measurement and entanglement of individual solid-state spins using optical fields

Abstract: This Review covers recent advances in the implementation of spin–photon interfaces in semiconductor quantum dots, nitrogen–vacancy centres in diamond and emerging systems such as colour centres in other wide-bandgap materials. Realization of a quantum interface between stationary and flying qubits is a requirement for long-distance quantum communication and distributed quantum computation. The prospects for integrating many qubits on a single chip render solid-state spins promising candidates for stationary qubits. Certain solid-state systems, including quantum dots and nitrogen–vacancy centres in diamond, exhibit spin-state-dependent optical transitions, allowing for fast initialization, manipulation and measurement of the spins using laser excitation. Recent progress has brought spin photonics research in these materials into the quantum realm, allowing the demonstration of spin–photon entanglement, which in turn has enabled distant spin entanglement as well as quantum teleportation. Advances in the fabrication of photonic nanostructures hosting spin qubits suggest that chips incorporating a high-efficiency spin–photon interface in a quantum photonic network are within reach.

Experimental superposition of orders of quantum gates.

Abstract: Quantum computers achieve a speed-up by placing quantum bits (qubits) in superpositions of different states. However, it has recently been appreciated that quantum mechanics also allows one to 'superimpose different operations'. Furthermore, it has been shown that using a qubit to coherently control the gate order allows one to accomplish a task--determining if two gates commute or anti-commute--with fewer gate uses than any known quantum algorithm. Here we experimentally demonstrate this advantage, in a photonic context, using a second qubit to control the order in which two gates are applied to a first qubit. We create the required superposition of gate orders by using additional degrees of freedom of the photons encoding our qubits. The new resource we exploit can be interpreted as a superposition of causal orders, and could allow quantum algorithms to be implemented with an efficiency unlikely to be achieved on a fixed-gate-order quantum computer.

A surface code quantum computer in silicon

Abstract: The exceptionally long quantum coherence times of phosphorus donor nuclear spin qubits in silicon, coupled with the proven scalability of silicon-based nano-electronics, make them attractive candidates for large-scale quantum computing. However, the high threshold of topological quantum error correction can only be captured in a two-dimensional array of qubits operating synchronously and in parallel—posing formidable fabrication and control challenges. We present an architecture that addresses these problems through a novel shared-control paradigm that is particularly suited to the natural uniformity of the phosphorus donor nuclear spin qubit states and electronic confinement. The architecture comprises a two-dimensional lattice of donor qubits sandwiched between two vertically separated control layers forming a mutually perpendicular crisscross gate array. Shared-control lines facilitate loading/unloading of single electrons to specific donors, thereby activating multiple qubits in parallel across the array on which the required operations for surface code quantum error correction are carried out by global spin control. The complexities of independent qubit control, wave function engineering, and ad hoc quantum interconnects are explicitly avoided. With many of the basic elements of fabrication and control based on demonstrated techniques and with simulated quantum operation below the surface code error threshold, the architecture represents a new pathway for large-scale quantum information processing in silicon and potentially in other qubit systems where uniformity can be exploited.

Quantum algorithms: an overview

Abstract: Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We include a discussion of recent developments and near-term applications of quantum algorithms.

Universal Quantum Transducers based on Surface Acoustic Waves

Abstract: We propose a universal, on-chip quantum transducer based on surface acoustic waves in piezoactive materials. Because of the intrinsic piezoelectric (and/or magnetostrictive) properties of the material, our approach provides a universal platform capable of coherently linking a broad array of qubits, including quantum dots, trapped ions, nitrogen-vacancy centers, or superconducting qubits. The quantized modes of surface acoustic waves lie in the gigahertz range and can be strongly confined close to the surface in phononic cavities and guided in acoustic waveguides. We show that this type of surface acoustic excitation can be utilized efficiently as a quantum bus, serving as an on-chip, mechanical cavity-QED equivalent of microwave photons and enabling long-range coupling of a wide range of qubits.

A quantum annealing architecture with all-to-all connectivity from local interactions

Abstract: Quantum annealers are physical devices that aim at solving NP-complete optimization problems by exploiting quantum mechanics. The basic principle of quantum annealing is to encode the optimization problem in Ising interactions between quantum bits (qubits). A fundamental challenge in building a fully programmable quantum annealer is the competing requirements of full controllable all-to-all connectivity and the quasi-locality of the interactions between physical qubits. We present a scalable architecture with full connectivity, which can be implemented with local interactions only. The input of the optimization problem is encoded in local fields acting on an extended set of physical qubits. The output is—in the spirit of topological quantum memories—redundantly encoded in the physical qubits, resulting in an intrinsic fault tolerance. Our model can be understood as a lattice gauge theory, where long-range interactions are mediated by gauge constraints. The architecture can be realized on various platforms with local controllability, including superconducting qubits, NV-centers, quantum dots, and atomic systems.

Open-system dynamics of entanglement:a key issues review

Abstract: One of the greatest challenges in the fields of quantum information processing and quantum technologies is the detailed coherent control over each and every constituent of quantum systems with an ever increasing number of particles. Within this endeavor, harnessing of many-body entanglement against the detrimental effects of the environment is a major pressing issue. Besides being an important concept from a fundamental standpoint, entanglement has been recognized as a crucial resource for quantum speed-ups or performance enhancements over classical methods. Understanding and controlling many-body entanglement in open systems may have strong implications in quantum computing, quantum simulations of many-body systems, secure quantum communication or cryptography, quantum metrology, our understanding of the quantum-to-classical transition, and other important questions of quantum foundations.In this paper we present an overview of recent theoretical and experimental efforts to underpin the dynamics of entanglement under the influence of noise. Entanglement is thus taken as a dynamic quantity on its own, and we survey how it evolves due to the unavoidable interaction of the entangled system with its surroundings. We analyze several scenarios, corresponding to different families of states and environments, which render a very rich diversity of dynamical behaviors.In contrast to single-particle quantities, like populations and coherences, which typically vanish only asymptotically in time, entanglement may disappear at a finite time. In addition, important classes of entanglement display an exponential decay with the number of particles when subject to local noise, which poses yet another threat to the already-challenging scaling of quantum technologies. Other classes, however, turn out to be extremely robust against local noise. Theoretical results and recent experiments regarding the difference between local and global decoherence are summarized. Control and robustness-enhancement techniques, scaling laws, statistical and geometrical aspects of multipartite-entanglement decay are also reviewed; all in order to give a broad picture of entanglement dynamics in open quantum systems addressed to both theorists and experimentalists inside and outside the field of quantum information.

Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters

Abstract: We present an algorithm for sparse Hamiltonian simulation whose complexity is optimal (up to log factors) as a function of all parameters of interest. Previous algorithms had optimal or near-optimal scaling in some parameters at the cost of poor scaling in others. Hamiltonian simulation via a quantum walk has optimal dependence on the sparsity at the expense of poor scaling in the allowed error. In contrast, an approach based on fractional-query simulation provides optimal scaling in the error at the expense of poor scaling in the sparsity. Here we combine the two approaches, achieving the best features of both. By implementing a linear combination of quantum walk steps with coefficients given by Bessel functions, our algorithm's complexity (as measured by the number of queries and 2-qubit gates) is logarithmic in the inverse error, and nearly linear in the product tau of the evolution time, the sparsity, and the magnitude of the largest entry of the Hamiltonian. Our dependence on the error is optimal, and we prove a new lower bound showing that no algorithm can have sub linear dependence on tau.

Experimental fault-tolerant universal quantum gates with solid-state spins under ambient conditions.

Abstract: Quantum computation provides great speedup over its classical counterpart for certain problems. One of the key challenges for quantum computation is to realize precise control of the quantum system in the presence of noise. Control of the spin-qubits in solids with the accuracy required by fault-tolerant quantum computation under ambient conditions remains elusive. Here, we quantitatively characterize the source of noise during quantum gate operation and demonstrate strategies to suppress the effect of these. A universal set of logic gates in a nitrogen-vacancy centre in diamond are reported with an average single-qubit gate fidelity of 0.999952 and two-qubit gate fidelity of 0.992. These high control fidelities have been achieved at room temperature in naturally abundant (13)C diamond via composite pulses and an optimized control method.

A case study in programming a quantum annealer for hard operational planning problems

Abstract: We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the performance of quantum annealers on problems native to their architecture, and others have examined performance of select problems stemming from an application area, ours is one of the first studies of a quantum annealer's performance on parametrized families of hard problems from a practical domain. We explore two different general mappings of planning problems to quadratic unconstrained binary optimization (QUBO) problems, and apply them to two parametrized families of planning problems, navigation-type and scheduling-type. We also examine two more compact, but problem-type specific, mappings to QUBO, one for the navigation-type planning problems and one for the scheduling-type planning problems. We study embedding properties and parameter setting and examine their effect on the efficiency with which the quantum annealer solves these problems. From these results, we derive insights useful for the programming and design of future quantum annealers: problem choice, the mapping used, the properties of the embedding, and the annealing profile all matter, each significantly affecting the performance.

Laser written circuits for quantum photonics

Abstract: The femtosecond laser direct-writing (FLDW) of waveguide circuits in glasses has seen interest from a number of fields over the previous 20 years. It has evolved from a curiosity to a viable platform for the rapid prototyping of small scale circuits. The field of quantum information science has exploited this capability and in the process advanced the fabrication technique. In this review the technological aspects of the laser inscription method relevant to quantum information science will be discussed. A range of demonstrations which have been enabled by laser written circuits will be outlined; these include novel circuits, simulations, photon sources and detection. This places the FLDW technique among the few integrated optical platforms to have produced individually every component required for scalable quantum computation.

Quantum image encryption based on generalized Arnold transform and double random-phase encoding

Abstract: A quantum realization of the generalized Arnold transform is designed. A novel quantum image encryption algorithm based on generalized Arnold transform and double random-phase encoding is proposed. The pixels are scrambled by the generalized Arnold transform, and the gray-level information of images is encoded by the double random-phase operations. The keys of the encryption algorithm include the independent parameters of coefficients matrix, iterative times and classical binary sequences, and thus, the key space is extremely large. Numerical simulations and theoretical analyses demonstrate that the proposed algorithm with good feasibility and effectiveness has lower computational complexity than its classical counterpart.

Probing for quantum speedup in spin-glass problems with planted solutions

Abstract: The availability of quantum annealing devices with hundreds of qubits has made the experimental demonstration of a quantum speedup for optimization problems a coveted, albeit elusive goal Going beyond earlier studies of random Ising problems, here we introduce a method to construct a set of frustrated Ising-model optimization problems with tunable hardness We study the performance of a D-Wave Two device (DW2) with up to 503 qubits on these problems and compare it to a suite of classical algorithms, including a highly optimized algorithm designed to compete directly with the DW2 The problems are generated around predetermined ground-state configurations, called planted solutions, which makes them particularly suitable for benchmarking purposes The problem set exhibits properties familiar from constraint satisfaction (SAT) problems, such as a peak in the typical hardness of the problems, determined by a tunable clause density parameter We bound the hardness regime where the DW2 device either does not or might exhibit a quantum speedup for our problem set While we do not find evidence for a speedup for the hardest and most frustrated problems in our problem set, we cannot rule out that a speedup might exist for some of the easier, less frustrated problems Our empirical findings pertain to the specific D-Wave processor and problem set we studied and leave open the possibility that future processors might exhibit a quantum speedup on the same problem set

From Three-Photon Greenberger-Horne-Zeilinger States to Ballistic Universal Quantum Computation.

Abstract: Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. A series of increasingly efficient proposals have shown linear-optical quantum computing to be formally scalable. However, existing schemes typically require extensive adaptive switching, which is experimentally challenging and noisy, thousands of photon sources per renormalized qubit, and/or large quantum memories for repeat-until-success strategies. Our work overcomes all these problems. We present a scheme to construct a cluster state universal for quantum computation, which uses no adaptive switching, no large memories, and which is at least an order of magnitude more resource efficient than previous passive schemes. Unlike previous proposals, it is constructed entirely from loss-detecting gates and offers a robustness to photon loss. Even without the use of an active loss-tolerant encoding, our scheme naturally tolerates a total loss rate ∼1.6% in the photons detected in the gates. This scheme uses only 3 Greenberger-Horne-Zeilinger states as a resource, together with a passive linear-optical network. We fully describe and model the iterative process of cluster generation, including photon loss and gate failure. This demonstrates that building a linear-optical quantum computer needs to be less challenging than previously thought.

Estimating Outcome Probabilities of Quantum Circuits Using Quasiprobabilities.

Abstract: We present a method for estimating the probabilities of outcomes of a quantum circuit using Monte Carlo sampling techniques applied to a quasiprobability representation. Our estimate converges to the true quantum probability at a rate determined by the total negativity in the circuit, using a measure of negativity based on the 1-norm of the quasiprobability. If the negativity grows at most polynomially in the size of the circuit, our estimator converges efficiently. These results highlight the role of negativity as a measure of nonclassical resources in quantum computation.

Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation

Abstract: Although the simulation of quantum chemistry is one of the most anticipated applications of quantum computing, the scaling of known upper bounds on the complexity of these algorithms is daunting. Prior work has bounded errors due to discretization of the time evolution (known as ``Trotterization'') in terms of the norm of the error operator and analyzed scaling with respect to the number of spin orbitals. However, we find that these error bounds can be loose by up to 16 orders of magnitude for some molecules. Furthermore, numerical results for small systems fail to reveal any clear correlation between ground-state error and number of spin orbitals. We instead argue that chemical properties, such as the maximum nuclear charge in a molecule and the filling fraction of orbitals, can be decisive for determining the cost of a quantum simulation. Our analysis motivates several strategies to use classical processing to further reduce the required Trotter step size and estimate the necessary number of steps, without requiring additional quantum resources. Finally, we demonstrate improved methods for state preparation techniques which are asymptotically superior to proposals in the simulation literature.