Catalog footprint

What is connected

111works
26topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

111 published item(s)

preprint2026arXiv

Discrete Feynman-Kac Correctors

Discrete diffusion models have recently emerged as a promising alternative to the autoregressive approach for generating discrete sequences. Sample generation via gradual denoising or demasking processes allows them to capture hierarchical non-sequential interdependencies in the data. These custom processes, however, do not assume a flexible control over the distribution of generated samples. We propose Discrete Feynman-Kac Correctors, a framework that allows for controlling the generated distribution of discrete masked diffusion models at inference time. We derive Sequential Monte Carlo (SMC) algorithms that, given a trained discrete diffusion model, control the temperature of the sampled distribution (i.e. perform annealing), sample from the product of marginals of several diffusion processes (e.g. differently conditioned processes), and sample from the product of the marginal with an external reward function, producing likely samples from the target distribution that also have high reward. Notably, our framework does not require any training of additional models or fine-tuning of the original model. We illustrate the utility of our framework in several applications including: efficient sampling from the annealed Boltzmann distribution of the Ising model, improving the performance of language models for code generation and amortized learning, as well as reward-tilted protein sequence generation.

preprint2026arXiv

QCalEval: Benchmarking Vision-Language Models for Quantum Calibration Plot Understanding

Quantum computing calibration depends on interpreting experimental data, and calibration plots provide the most universal human-readable representation for this task, yet no systematic evaluation exists of how well vision-language models (VLMs) interpret them. We introduce QCalEval, the first VLM benchmark for quantum calibration plots: 243 samples across 87 scenario types from 22 experiment families, spanning superconducting qubits and neutral atoms, evaluated on six question types in both zero-shot and in-context learning settings. The best general-purpose zero-shot model reaches a mean score of 72.3, and many open-weight models degrade under multi-image in-context learning, whereas frontier closed models improve substantially. A supervised fine-tuning ablation at the 9-billion-parameter scale shows that SFT improves zero-shot performance but cannot close the multimodal in-context learning gap. As a reference case study, we release NVIDIA Ising Calibration 1, an open-weight model based on Qwen3.5-35B-A3B that reaches 74.7 zero-shot average score.

preprint2023arXiv

Differentiable quantum computational chemistry with PennyLane

This work describes the theoretical foundation for all quantum chemistry functionality in PennyLane, a quantum computing software library specializing in quantum differentiable programming. We provide an overview of fundamental concepts in quantum chemistry, including the basic principles of the Hartree-Fock method. A flagship feature in PennyLane is the differentiable Hartree-Fock solver, allowing users to compute exact gradients of molecular Hamiltonians with respect to nuclear coordinates and basis set parameters. PennyLane provides specialized operations for quantum chemistry, including excitation gates as Givens rotations and templates for quantum chemistry circuits. Moreover, built-in simulators exploit sparse matrix techniques for representing molecular Hamiltonians that lead to fast simulation for quantum chemistry applications. In combination with PennyLane's existing methods for constructing, optimizing, and executing circuits, these methods allow users to implement a wide range of quantum algorithms for quantum chemistry. We discuss how PennyLane can be used to implement variational algorithms for calculating ground-state energies, excited-state energies, and energy derivatives, all of which can be differentiated with respect to both circuit and Hamiltonian parameters. We provide an example workflow describing how to jointly optimize circuit parameters, nuclear coordinates, and basis set parameters for quantum chemistry algorithms. We discuss a functionality for reducing the number of qubits by using symmetries and explain how PennyLane can be used to estimate quantum resources needed to implement several quantum algorithms. By combining insights from quantum computing, computational chemistry, and machine learning, PennyLane is the first library for differentiable quantum computational chemistry.

preprint2023arXiv

Toward Reliability in the NISQ Era: Robust Interval Guarantee for Quantum Measurements on Approximate States

Near-term quantum computation holds potential across multiple application domains. However, imperfect preparation and evolution of states due to algorithmic and experimental shortcomings, characteristic in the near-term implementation, would typically result in measurement outcomes deviating from the ideal setting. It is thus crucial for any near-term application to quantify and bound these output errors. We address this need by deriving robustness intervals which are guaranteed to contain the output in the ideal setting. The first type of interval is based on formulating robustness bounds as semi-definite programs, and uses only the first moment and the fidelity to the ideal state. Furthermore, we consider higher statistical moments of the observable and generalize bounds for pure states based on the non-negativity of Gram matrices to mixed states, thus enabling their applicability in the NISQ era where noisy scenarios are prevalent. Finally, we demonstrate our results in the context of the variational quantum eigensolver (VQE) on noisy and noiseless simulations.

preprint2022arXiv

Experimental high-dimensional Greenberger-Horne-Zeilinger entanglement with superconducting transmon qutrits

Multipartite entanglement is one of the core concepts in quantum information science with broad applications that span from condensed matter physics to quantum physics foundations tests. Although its most studied and tested forms encompass two-dimensional systems, current quantum platforms technically allow the manipulation of additional quantum levels. We report the experimental demonstration and certification of a high-dimensional multipartite entangled state in a superconducting quantum processor. We generate the three-qutrit Greenberger-Horne-Zeilinger state by designing the necessary pulses to perform high-dimensional quantum operations. We obtain the fidelity of $76\pm 1\%$, proving the generation of a genuine three-partite and three-dimensional entangled state. To this date, only photonic devices have been able to create and certify the entanglement of these high-dimensional states. Our work demonstrates that another platform, superconducting systems, is ready to exploit genuine high-dimensional entanglement and that a programmable quantum device accessed on the cloud can be used to design and execute experiments beyond binary quantum computation.

preprint2022arXiv

Improving the Accuracy of the Variational Quantum Eigensolver for Molecular Systems by the Explicitly-Correlated Perturbative [2]-R12-Correction

We provide an integration of the universal, perturbative explicitly correlated [2]$_\text{R12}$-correction in the context of the Variational Quantum Eigensolver (VQE). This approach is able to increase the accuracy of the underlying reference method significantly while requiring no additional quantum resources. Our proposed approach only requires knowledge of the one- and two-particle reduced density matrices (RDMs) of the reference wavefunction; these can be measured after having reached convergence in VQE. The RDMs are then combined with a set of molecular integrals. This computation comes at a cost that scales as the sixth power of the number of electrons. We explore the performance of the VQE+[2]$_\text{R12}$ approach using both conventional Gaussian basis sets and our recently proposed directly determined pair-natural orbitals obtained by multiresolution analysis (MRA-PNOs). Both Gaussian orbital and PNOs are investigated as a potential set of complementary basis functions in the computation of [2]$_\text{R12}$. In particular the combination of MRA-PNOs with [2]$_\text{R12}$ has turned out to be very promising -- persistently throughout our data, this allowed very accurate simulations at a quantum cost of a minimal basis set. Additionally, we found that the deployment of PNOs as complementary basis can greatly reduce the number of complementary basis functions that enter the computation of the correction at a cubic complexity.

preprint2022arXiv

Learning quantum dynamics with latent neural ODEs

The core objective of machine-assisted scientific discovery is to learn physical laws from experimental data without prior knowledge of the systems in question. In the area of quantum physics, making progress towards these goals is significantly more challenging due to the curse of dimensionality as well as the counter-intuitive nature of quantum mechanics. Here, we present the QNODE, a latent neural ODE trained on expectation values of closed and open quantum systems dynamics. It can learn to generate such measurement data and extrapolate outside of its training region that satisfies the von Neumann and time-local Lindblad master equations for closed and open quantum systems respectively in an unsupervised means. Furthermore, the QNODE rediscovers quantum mechanical laws such as the Heisenberg's uncertainty principle in a data-driven way, without any constraint or guidance. Additionally, we show that trajectories that are generated from the QNODE that are close in its latent space have similar quantum dynamics while preserving the physics of the training system.

preprint2022arXiv

On scientific understanding with artificial intelligence

Imagine an oracle that correctly predicts the outcome of every particle physics experiment, the products of every chemical reaction, or the function of every protein. Such an oracle would revolutionize science and technology as we know them. However, as scientists, we would not be satisfied with the oracle itself. We want more. We want to comprehend how the oracle conceived these predictions. This feat, denoted as scientific understanding, has frequently been recognized as the essential aim of science. Now, the ever-growing power of computers and artificial intelligence poses one ultimate question: How can advanced artificial systems contribute to scientific understanding or achieve it autonomously? We are convinced that this is not a mere technical question but lies at the core of science. Therefore, here we set out to answer where we are and where we can go from here. We first seek advice from the philosophy of science to understand scientific understanding. Then we review the current state of the art, both from literature and by collecting dozens of anecdotes from scientists about how they acquired new conceptual understanding with the help of computers. Those combined insights help us to define three dimensions of android-assisted scientific understanding: The android as a I) computational microscope, II) resource of inspiration and the ultimate, not yet existent III) agent of understanding. For each dimension, we explain new avenues to push beyond the status quo and unleash the full power of artificial intelligence's contribution to the central aim of science. We hope our perspective inspires and focuses research towards androids that get new scientific understanding and ultimately bring us closer to true artificial scientists.

preprint2022arXiv

Optimized Low-Depth Quantum Circuits for Molecular Electronic Structure using a Separable Pair Approximation

We present a classically solvable model that leads to optimized low-depth quantum circuits leveraging separable pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms. The associated wavefunctions can be represented with linear memory requirement which allows classical optimization of the circuits and naturally defines a minimum benchmark for quantum algorithms. In this work, we employ directly determined pair-natural orbitals within a basis-set-free approach. This leads to an accurate representation of the one- and many-body parts for weakly correlated systems and we explicitly illustrate how the model can be integrated into variational and projective quantum algorithms for stronger correlated systems.

preprint2022arXiv

Polynomial unconstrained binary optimisation inspired by optical simulation

We propose an algorithm inspired by optical coherent Ising machines to solve the problem of polynomial unconstrained binary optimization (PUBO). We benchmark the proposed algorithm against existing PUBO algorithms on the extended Sherrington-Kirkpatrick model and random third-degree polynomial pseudo-Boolean functions, and observe its superior performance. We also address instances of practically relevant computational problems such as protein folding and electronic structure calculations with problem sizes not accessible to existing quantum annealing devices. The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approximating the electronic structure problem by a PUBO problem, which, in turn, puts into question the applicability of the unconstrained binary optimization formulation, such as that of quantum annealers and coherent Ising machines, in this context.

preprint2022arXiv

Quantum compression with classically simulatable circuits

As we continue to find applications where the currently available noisy devices exhibit an advantage over their classical counterparts, the efficient use of quantum resources is highly desirable. The notion of quantum autoencoders was proposed as a way for the compression of quantum information to reduce resource requirements. Here, we present a strategy to design quantum autoencoders using evolutionary algorithms for transforming quantum information into lower-dimensional representations. We successfully demonstrate the initial applications of the algorithm for compressing different families of quantum states. In particular, we point out that using a restricted gate set in the algorithm allows for efficient simulation of the generated circuits. This approach opens the possibility of using classical logic to find low representations of quantum data, using fewer computational resources.

preprint2022arXiv

Scalable Fragment-Based 3D Molecular Design with Reinforcement Learning

Machine learning has the potential to automate molecular design and drastically accelerate the discovery of new functional compounds. Towards this goal, generative models and reinforcement learning (RL) using string and graph representations have been successfully used to search for novel molecules. However, these approaches are limited since their representations ignore the three-dimensional (3D) structure of molecules. In fact, geometry plays an important role in many applications in inverse molecular design, especially in drug discovery. Thus, it is important to build models that can generate molecular structures in 3D space based on property-oriented geometric constraints. To address this, one approach is to generate molecules as 3D point clouds by sequentially placing atoms at locations in space -- this allows the process to be guided by physical quantities such as energy or other properties. However, this approach is inefficient as placing individual atoms makes the exploration unnecessarily deep, limiting the complexity of molecules that can be generated. Moreover, when optimizing a molecule, organic and medicinal chemists use known fragments and functional groups, not single atoms. We introduce a novel RL framework for scalable 3D design that uses a hierarchical agent to build molecules by placing molecular substructures sequentially in 3D space, thus attempting to build on the existing human knowledge in the field of molecular design. In a variety of experiments with different substructures, we show that our agent, guided only by energy considerations, can efficiently learn to produce molecules with over 100 atoms from many distributions including drug-like molecules, organic LED molecules, and biomolecules.

preprint2022arXiv

Towards Quantum Computing with Molecular Electronics

In this study, we explore the use of molecules and molecular electronics for quantum computing. We construct one-qubit gates using one-electron scattering in molecules, and two-qubit controlled-phase gates using electron-electron scattering along metallic leads. Furthermore, we propose a class of circuit implementations, and show initial applications of the framework by illustrating one-qubit gates using the molecular electronic structure of molecular hydrogen as a baseline model.

preprint2021arXiv

Assigning Confidence to Molecular Property Prediction

Introduction: Computational modeling has rapidly advanced over the last decades, especially to predict molecular properties for chemistry, material science and drug design. Recently, machine learning techniques have emerged as a powerful and cost-effective strategy to learn from existing datasets and perform predictions on unseen molecules. Accordingly, the explosive rise of data-driven techniques raises an important question: What confidence can be assigned to molecular property predictions and what techniques can be used for that purpose? Areas covered: In this work, we discuss popular strategies for predicting molecular properties relevant to drug design, their corresponding uncertainty sources and methods to quantify uncertainty and confidence. First, our considerations for assessing confidence begin with dataset bias and size, data-driven property prediction and feature design. Next, we discuss property simulation via molecular docking, and free-energy simulations of binding affinity in detail. Lastly, we investigate how these uncertainties propagate to generative models, as they are usually coupled with property predictors. Expert opinion: Computational techniques are paramount to reduce the prohibitive cost and timing of brute-force experimentation when exploring the enormous chemical space. We believe that assessing uncertainty in property prediction models is essential whenever closed-loop drug design campaigns relying on high-throughput virtual screening are deployed. Accordingly, considering sources of uncertainty leads to better-informed experimental validations, more reliable predictions and to more realistic expectations of the entire workflow. Overall, this increases confidence in the predictions and designs and, ultimately, accelerates drug design.

preprint2021arXiv

Gemini: Dynamic Bias Correction for Autonomous Experimentation and Molecular Simulation

Bayesian optimization has emerged as a powerful strategy to accelerate scientific discovery by means of autonomous experimentation. However, expensive measurements are required to accurately estimate materials properties, and can quickly become a hindrance to exhaustive materials discovery campaigns. Here, we introduce Gemini: a data-driven model capable of using inexpensive measurements as proxies for expensive measurements by correcting systematic biases between property evaluation methods. We recommend using Gemini for regression tasks with sparse data and in an autonomous workflow setting where its predictions of expensive to evaluate objectives can be used to construct a more informative acquisition function, thus reducing the number of expensive evaluations an optimizer needs to achieve desired target values. In a regression setting, we showcase the ability of our method to make accurate predictions of DFT calculated bandgaps of hybrid organic-inorganic perovskite materials. We further demonstrate the benefits that Gemini provides to autonomous workflows by augmenting the Bayesian optimizer Phoenics to yeild a scalable optimization framework leveraging multiple sources of measurement. Finally, we simulate an autonomous materials discovery platform for optimizing the activity of electrocatalysts for the oxygen evolution reaction. Realizing autonomous workflows with Gemini, we show that the number of measurements of a composition space comprising expensive and rare metals needed to achieve a target overpotential is significantly reduced when measurements from a proxy composition system with less expensive metals are available.

preprint2021arXiv

Noisy intermediate-scale quantum (NISQ) algorithms

A universal fault-tolerant quantum computer that can solve efficiently problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement towards realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations in a limited coherence time. In the search for quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry and combinatorial optimization. The goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, we provide a thorough summary of NISQ computational paradigms and algorithms. We discuss the key structure of these algorithms, their limitations, and advantages. We additionally provide a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices.

preprint2021arXiv

Tequila: A platform for rapid development of quantum algorithms

Variational quantum algorithms are currently the most promising class of algorithms for deployment on near-term quantum computers. In contrast to classical algorithms, there are almost no standardized methods in quantum algorithmic development yet, and the field continues to evolve rapidly. As in classical computing, heuristics play a crucial role in the development of new quantum algorithms, resulting in high demand for flexible and reliable ways to implement, test, and share new ideas. Inspired by this demand, we introduce tequila, a development package for quantum algorithms in python, designed for fast and flexible implementation, prototyping, and deployment of novel quantum algorithms in electronic structure and other fields. Tequila operates with abstract expectation values which can be combined, transformed, differentiated, and optimized. On evaluation, the abstract data structures are compiled to run on state-of-the-art quantum simulators or interfaces.

preprint2020arXiv

A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers

We develop computationally affordable and encoding independent gradient evaluation procedures for unitary coupled-cluster type operators, applicable on quantum computers. We show that, within our framework, the gradient of an expectation value with respect to a parameterized n-fold fermionic excitation can be evaluated by four expectation values of similar form and size, whereas most standard approaches based on the direct application of the parameter-shift-rule come with an associated cost of O(2^(2n)) expectation values. For real wavefunctions, this cost can be further reduced to two expectation values. Our strategies are implemented within the open-source package tequila and allow blackboard style construction of differentiable objective functions. We illustrate initial applications for electronic ground and excited states.

preprint2020arXiv

An Artificial Spiking Quantum Neuron

Artificial spiking neural networks have found applications in areas where the temporal nature of activation offers an advantage, such as time series prediction and signal processing. To improve their efficiency, spiking architectures often run on custom-designed neuromorphic hardware, but, despite their attractive properties, these implementations have been limited to digital systems. We describe an artificial quantum spiking neuron that relies on the dynamical evolution of two easy to implement Hamiltonians and subsequent local measurements. The architecture allows exploiting complex amplitudes and back-action from measurements to influence the input. This approach to learning protocols is advantageous in the case where the input and output of the system are both quantum states. We demonstrate this through the classification of Bell pairs which can be seen as a certification protocol. Stacking the introduced elementary building blocks into larger networks combines the spatiotemporal features of a spiking neural network with the non-local quantum correlations across the graph.

preprint2020arXiv

Augmenting Genetic Algorithms with Deep Neural Networks for Exploring the Chemical Space

Challenges in natural sciences can often be phrased as optimization problems. Machine learning techniques have recently been applied to solve such problems. One example in chemistry is the design of tailor-made organic materials and molecules, which requires efficient methods to explore the chemical space. We present a genetic algorithm (GA) that is enhanced with a neural network (DNN) based discriminator model to improve the diversity of generated molecules and at the same time steer the GA. We show that our algorithm outperforms other generative models in optimization tasks. We furthermore present a way to increase interpretability of genetic algorithms, which helped us to derive design principles.

preprint2020arXiv

Automated discovery of superconducting circuits and its application to 4-local coupler design

Superconducting circuits have emerged as a promising platform to build quantum processors. The challenge of designing a circuit is to compromise between realizing a set of performance metrics and reducing circuit complexity and noise sensitivity. At the same time, one needs to explore a large design space, and computational approaches often yield long simulation times. Here we automate the circuit design task using SCILLA, a software for automated discovery of superconducting circuits. SCILLA performs a parallelized, closed-loop optimization to design circuit diagrams that match pre-defined properties such as spectral features and noise sensitivities. We employ it to discover 4-local couplers for superconducting flux qubits and identify a circuit that outperforms an existing proposal with similar circuit structure in terms of coupling strength and noise resilience for experimentally accessible parameters. This work demonstrates how automated discovery can facilitate the design of complex circuit architectures for quantum information processing.

preprint2020arXiv

Generative Adversarial Networks for Crystal Structure Prediction

The constant demand for new functional materials calls for efficient strategies to accelerate the materials design and discovery. In addressing this challenge, machine learning generative models can offer promising opportunities since they allow for the continuous navigation of chemical space via low dimensional latent spaces. In this work, we employ a crystal representation that is inversion-free with a low memory requirement based on unit cell information and fractional atomic coordinates, and build the generative adversarial network (GAN) for crystal structures. The proposed model is then applied to the Mg-Mn-O ternary inorganic materials system to generate novel structures with application as potential water-splitting photoanodes, and combined with the evaluation of their photoanode properties for high-throughput virtual screening (HTVS). The generative-HTVS system that we built predicts 23 new crystal structures with a reasonable predicted stability and bandgap. These findings suggest that the proposed generative model can be an effective way to explore hidden portions of the chemical space, an area that is usually unreachable when conventional substitution-based discovery is employed.

preprint2020arXiv

Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization

Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one can sometimes improve upon those results with optimized implementations of Trotter-Suzuki-based product formulas. We show that low-order Trotter methods perform surprisingly well when used with phase estimation to compute relative precision quantities (e.g. energies per unit cell), as is often the goal for condensed-phase systems. In this context, simulations of the Hubbard and plane-wave electronic structure models with $N < 10^5$ fermionic modes can be performed with roughly $O(1)$ and $O(N^2)$ T complexities. We perform numerics revealing tradeoffs between the error and gate complexity of a Trotter step; e.g., we show that split-operator techniques have less Trotter error than popular alternatives. By compiling to surface code fault-tolerant gates and assuming error rates of one part per thousand, we show that one can error-correct quantum simulations of interesting, classically intractable instances with a few hundred thousand physical qubits.

preprint2020arXiv

Quantum Computation of Eigenvalues within Target Intervals

There is widespread interest in calculating the energy spectrum of a Hamiltonian, for example to analyze optical spectra and energy deposition by ions in materials. In this study, we propose a quantum algorithm that samples the set of energies within a target energy-interval without requiring good approximations of the target energy-eigenstates. We discuss the implementation of direct and iterative amplification protocols and give resource and runtime estimates. We illustrate initial applications by amplifying excited states on molecular Hydrogen.

preprint2020arXiv

Reducing qubit requirements while maintaining numerical precision for the Variational Quantum Eigensolver: A Basis-Set-Free Approach

We present a basis-set-free approach to the variational quantum eigensolver using an adaptive representation of the spatial part of molecular wavefunctions. Our approach directly determines system-specific representations of qubit Hamiltonians while fully omitting globally defined basis sets. In this work, we use directly determined pair-natural orbitals on the level of second-order perturbation theory. This results in compact qubit Hamiltonians with high numerical accuracy. We demonstrate initial applications with compact Hamiltonians on up to 20 qubits where conventional representation would for the same systems require 40-100 or more qubits.

preprint2020arXiv

Resource-efficient digital quantum simulation of $d$-level systems for photonic, vibrational, and spin-$s$ Hamiltonians

Simulation of quantum systems is expected to be one of the most important applications of quantum computing, with much of the theoretical work so far having focused on fermionic and spin-$\frac{1}{2}$ systems. Here, we instead consider encodings of $d$-level (i.e. qudit) quantum operators into multi-qubit operators, studying resource requirements for approximating operator exponentials by Trotterization. We primarily focus on spin-$s$ and truncated bosonic operators in second quantization, observing desirable properties for approaches based on the Gray code, which to our knowledge has not been used in this context previously. After outlining a methodology for implementing an arbitrary encoding, we investigate the interplay between Hamming distances, sparsity patterns, bosonic truncation, and other properties of local operators. Finally, we obtain resource counts for five common Hamiltonian classes used in physics and chemistry, while modeling the possibility of converting between encodings within a Trotter step. The most efficient encoding choice is heavily dependent on the application and highly sensitive to $d$, although clear trends are present. These operation count reductions are relevant for running algorithms on near-term quantum hardware because the savings effectively decrease the required circuit depth. Results and procedures outlined in this work may be useful for simulating a broad class of Hamiltonians on qubit-based digital quantum computers.

preprint2020arXiv

Self-driving laboratory for accelerated discovery of thin-film materials

Discovering and optimizing commercially viable materials for clean energy applications typically takes over a decade. Self-driving laboratories that iteratively design, execute, and learn from material science experiments in a fully autonomous loop present an opportunity to accelerate this research. We report here a modular robotic platform driven by a model-based optimization algorithm capable of autonomously optimizing the optical and electronic properties of thin-film materials by modifying the film composition and processing conditions. We demonstrate this platform by using it to maximize the hole mobility of organic hole transport materials commonly used in perovskite solar cells and consumer electronics. This demonstration highlights the possibilities of using autonomous laboratories to discover organic and inorganic materials relevant to materials sciences and clean energy technologies.

preprint2019arXiv

Generalized Kasha's Scheme for Classifying Two-Dimensional Excitonic Molecular Aggregates: Temperature Dependent Absorption Peak Frequency Shift

We propose a generalized theoretical framework for classifying two-dimensional (2D) excitonic molecular aggregates based on an analysis of temperature dependent spectra. In addition to the monomer-aggregate absorption peak shift, which defines the conventional J- and H-aggregates, we incorporate the peak shift associated with increasing temperature as a measure to characterize the exciton band structure. First we show that there is a one-to-one correspondence between the monomer-aggregate and the T-dependent peak shifts for Kasha's well-established model of 1D aggregates, where J-aggregates exhibit further redshift upon increasing temperature and H-aggregates exhibit further blueshift. On the contrary, 2D aggregate structures are capable of supporting the two other combinations: blueshifting J-aggregates and redshifting H-aggregates, owing to their more complex exciton band structures. Secondly, using spectral lineshape theory, the T-dependent shift is associated with the relative abundance of states on each side of the bright state. We further establish that the density of states can be connected to the microscopic packing condition leading to these four classes of aggregates by separately considering the short and long-range contribution to the excitonic couplings. In particular the T-dependent shift is shown to be an unambiguous signature for the sign of net short-range couplings: Aggregates with net negative (positive) short-range couplings redshift (blueshift) with increasing temperature. Lastly, comparison with experiments shows that our theory can be utilized to quantitatively account for the observed but previously unexplained T-dependent absorption lineshapes. Thus, our work provides a firm ground for elucidating the structure-function relationships for molecular aggregates and is fully compatible with existing experimental and theoretical structure characterization tools.

preprint2019arXiv

Quantum Computing at the Frontiers of Biological Sciences

The search for meaningful structure in biological data has relied on cutting-edge advances in computational technology and data science methods. However, challenges arise as we push the limits of scale and complexity in biological problems. Innovation in massively parallel, classical computing hardware and algorithms continues to address many of these challenges, but there is a need to simultaneously consider new paradigms to circumvent current barriers to processing speed. Accordingly, we articulate a view towards quantum computation and quantum information science, where algorithms have demonstrated potential polynomial and exponential computational speedups in certain applications, such as machine learning. The maturation of the field of quantum computing, in hardware and algorithm development, also coincides with the growth of several collaborative efforts to address questions across length and time scales, and scientific disciplines. We use this coincidence to explore the potential for quantum computing to aid in one such endeavor: the merging of insights from genetics, genomics, neuroimaging and behavioral phenotyping. By examining joint opportunities for computational innovation across fields, we highlight the need for a common language between biological data analysis and quantum computing. Ultimately, we consider current and future prospects for the employment of quantum computing algorithms in the biological sciences.

preprint2018arXiv

Quantum Chemistry in the Age of Quantum Computing

Practical challenges in simulating quantum systems on classical computers have been widely recognized in the quantum physics and quantum chemistry communities over the past century. Although many approximation methods have been introduced, the complexity of quantum mechanics remains hard to appease. The advent of quantum computation brings new pathways to navigate this challenging complexity landscape. By manipulating quantum states of matter and taking advantage of their unique features such as superposition and entanglement, quantum computers promise to efficiently deliver accurate results for many important problems in quantum chemistry such as the electronic structure of molecules. In the past two decades significant advances have been made in developing algorithms and physical hardware for quantum computing, heralding a revolution in simulation of quantum systems. This article is an overview of the algorithms and results that are relevant for quantum chemistry. The intended audience is both quantum chemists who seek to learn more about quantum computing, and quantum computing researchers who would like to explore applications in quantum chemistry.

preprint2017arXiv

Automatic differentiation in quantum chemistry with an application to fully variational Hartree-Fock

Automatic Differentiation (AD) is a powerful tool that allows calculating derivatives of implemented algorithms with respect to all of their parameters up to machine precision, without the need to explicitly add any additional functions. Thus, AD has great potential in quantum chemistry, where gradients are omnipresent but also difficult to obtain, and researchers typically spend a considerable amount of time finding suitable analytical forms when implementing derivatives. Here, we demonstrate that automatic differentiation can be used to compute gradients with respect to any parameter throughout a complete quantum chemistry method. We implement DiffiQult, a fully autodifferentiable Hartree-Fock (HF) algorithm, which serves as a proof-of-concept that illustrates the capabilities of AD for quantum chemistry. We leverage the obtained gradients to optimize the parameters of one-particle basis sets in the context of the floating Gaussian framework.

preprint2017arXiv

Local protein solvation drives direct down-conversion in phycobiliprotein PC645 via incoherent vibronic transport

Mechanisms controlling excitation energy transport (EET) in light-harvesting complexes remain controversial. Following the observation of long-lived beats in two-dimensional electronic spectroscopy of PC645, vibronic coherence, the delocalization of excited states between pigments supported by a resonant vibration, has been proposed to enable direct down-conversion from the highest-energy states to the lowest-energy pigments. Here, we instead show that for phycobiliprotein PC645 an incoherent vibronic transport mechanism is at play. We quantify the solvation dynamics of individual pigments using ab initio QM/MM nuclear dynamics. Our atomistic spectral densities reproduce experimental observations ranging from absorption and fluorescence spectra to the timescales and selectivity of down-conversion observed in transient absorption measurements. We demonstrate that bilin solvation controls EET pathways and that direct down-conversion proceeds incoherently, enhanced by large reorganization energies and a broad collection of high-frequency vibrations. We thus suggest that engineering local solvation dynamics represents a potential design principle for nanoscale control of EET.

preprint2017arXiv

Optical Spectra of p-Doped PEDOT Nano-Aggregates Provide Insight into the Material Disorder

Highly doped Poly(3,4-ethylenedioxythiophene) or PEDOT is a conductive polymer with a wide range of applications in energy conversion due to its ease of processing, optical properties and high conductivity. The latter is influenced by processing conditions, including formulation, annealing, and solvent treatment of the polymer, which also affects the polymer arrangement. Here we show that the analysis of the optical spectra of PEDOT domains reveals the nature and magnitude of the structural disorder in the material. In particular, the optical spectra of objects on individual domains can be used for the elucidation of the molecular disorder in oligomer arrangement which is a key factor affecting the conductivity.

preprint2016arXiv

Calibration of the Many-Body Dispersion Range-Separation Parameter

Recent work has shown that a fully many-body treatment of noncovalent interactions, such as that given by the method of many-body dispersion (MBD), is vital to accurately modeling the structure and energetics of many molecular systems with density functional theory (DFT). To avoid double counting the correlation contributions of DFT and the MBD correction, a single-parameter range-separation scheme is typically employed. Coupling the MBD correction to a given exchange-correlation functional therefore requires calibrating the range-separation parameter. We perform this calibration for 24 popular DFT functionals by optimizing against the S66x8 benchmark set. Additionally, we report a linear equation that predicts near optimal range-separation parameters, dependent only on the class of the exchange functional and the value of the gradient enhancement factor. When a calibrated MBD correction is employed, most of the exchange-correlation functionals considered are capable of achieving agreement with CCSD(T)/CBS interaction energies in the S66x8 set to better than 1~kcal/mol mean absolute error.

preprint2016arXiv

Error Sensitivity to Environmental Noise in Quantum Circuits for Chemical State Preparation

Calculating molecular energies is likely to be one of the first useful applications to achieve quantum supremacy, performing faster on a quantum than a classical computer. However, if future quantum devices are to produce accurate calculations, errors due to environmental noise and algorithmic approximations need to be characterized and reduced. In this study, we use the high performance qHiPSTER software to investigate the effects of environmental noise on the preparation of quantum chemistry states. We simulated eighteen 16-qubit quantum circuits under environmental noise, each corresponding to a unitary coupled cluster state preparation of a different molecule or molecular configuration. Additionally, we analyze the nature of simple gate errors in noise-free circuits of up to 40 qubits. We find that the Jordan-Wigner (JW) encoding produces consistently smaller errors under a noisy environment as compared to the Bravyi-Kitaev (BK) encoding. For the JW encoding, pure-dephasing noise is shown to produce substantially smaller errors than pure relaxation noise of the same magnitude. We report error trends in both molecular energy and electron particle number within a unitary coupled cluster state preparation scheme, against changes in nuclear charge, bond length, number of electrons, noise types, and noise magnitude. These trends may prove to be useful in making algorithmic and hardware-related choices for quantum simulation of molecular energies.

preprint2016arXiv

Faster than Classical Quantum Algorithm for dense Formulas of Exact Satisfiability and Occupation Problems

We present an exact quantum algorithm for solving the Exact Satisfiability (XSAT) problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: First, the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the XSAT; Second, a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query complexities for the worst-case are respectively bounded by $O(\sqrt{2^{n-M^{\prime}}})$ and $O(2^{n-M^{\prime}})$, where $n$ is the number of variables and $M^{\prime}$ the number of linearly independent clauses. Remarkably, the proposed quantum algorithm results to be faster than any known exact classical algorithm to solve dense formulas of XSAT. As a concrete application, we provide the worst-case complexity for the Hamiltonian cycle problem obtained after mapping it to a suitable XSAT. Specifically, we show that the time complexity for the proposed quantum algorithm is bounded by $O(2^{n/4})$ for 3-regular undirected graphs, where $n$ is the number of nodes. The same worst-case complexity holds for $(3,3)$-regular bipartite graphs (the current best classical algorithm has a (worst-case) running time bounded by $O(2^{31n/96})$). Finally, when compared to heuristic techniques for XSAT, the proposed quantum algorithm is faster than the classical WalkSAT and Adiabatic Quantum Optimization for random instances with a density of constraints close to the satisfiability threshold, the regime in which instances are typically the hardest to solve. The proposed quantum algorithm can be also extended to the generalized version of the XSAT known as Occupation problem.

preprint2016arXiv

MultiDK: A Multiple Descriptor Multiple Kernel Approach for Molecular Discovery and Its Application to The Discovery of Organic Flow Battery Electrolytes

We propose a multiple descriptor multiple kernel (MultiDK) method for efficient molecular discovery using machine learning. We show that the MultiDK method improves both the speed and the accuracy of molecular property prediction. We apply the method to the discovery of electrolyte molecules for aqueous redox flow batteries. Using \emph{multiple-type - as opposed to single-type - descriptors}, more relevant features for machine learning can be obtained. Following the principle of the 'wisdom of the crowds', the combination of multiple-type descriptors significantly boosts prediction performance. Moreover, MultiDK can exploit irregularities between molecular structure and property relations better than the linear regression method by employing multiple kernels - more than one kernel functions for a set of the input descriptors. The multiple kernels consist of the Tanimoto similarity function and a linear kernel for a set of binary descriptors and a set of non-binary descriptors, respectively. Using MultiDK, we achieve average performance of $r^2 = 0.92$ with a set of molecules for solubility prediction. We also extend MultiDK to predict pH-dependent solubility and apply it to solubility estimation of quinone molecules with ionizable functional groups as strong candidates of flow battery electrolytes.

preprint2016arXiv

qHiPSTER: The Quantum High Performance Software Testing Environment

We present qHiPSTER, the Quantum High Performance Software Testing Environment. qHiPSTER is a distributed high-performance implementation of a quantum simulator on a classical computer, that can simulate general single-qubit gates and two-qubit controlled gates. We perform a number of single- and multi-node optimizations, including vectorization, multi-threading, cache blocking, as well as overlapping computation with communication. Using the TACC Stampede supercomputer, we simulate quantum circuits ("quantum software") of up to 40 qubits. We carry out a detailed performance analysis to show that our simulator achieves both high performance and high hardware efficiency, limited only by the sustainable memory and network bandwidth of the machine.

preprint2016arXiv

Quantum Simulation with a Boson Sampling Circuit

In this work we study a system that consists of $2M$ matter qubits that interact through a boson sampling circuit, i.e., an $M$-port interferometer, embedded in two different architectures. We prove that, under the conditions required to derive a master equation, the qubits evolve according to effective bipartite XY spin Hamiltonians, with or without local and collective dissipation terms. This opens the door to the simulation of any bipartite spin or hard-core boson models and exploring dissipative phase transitions as the competition between coherent and incoherent exchange of excitations. We also show that in the purely dissipative regime this model has a large number of exact and approximate dark states, whose structure and decay rates can be estimated analytically. We finally argue that this system may be used for the adiabatic preparation of boson sampling states encoded in the matter qubits.

preprint2015arXiv

Adiabatic quantum optimization in presence of discrete noise: Reducing the problem dimensionality

Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the minimum energy gap encountered during the dynamics. Unfortunately, the direct calculation of the gap is strongly limited by the exponential growth in the dimensionality of the Hilbert space associated to the quantum system. Although many special-purpose methods have been devised to reduce the effective dimensionality, they are strongly limited to particular classes of problems with evident symmetries. Moreover, little is known about the computational power of adiabatic quantum optimizers in real-world conditions. Here, we propose and implement a general purposes reduction method that does not rely on any explicit symmetry and which requires, under certain general conditions, only a polynomial amount of classical resources. Thanks to this method, we are able to analyze the performance of "non-ideal" quantum adiabatic optimizers to solve the well-known Grover problem, namely the search of target entries in an unsorted database, in the presence of discrete local defects. In this case, we show that adiabatic quantum optimization, even if affected by random noise, is still potentially faster than any classical algorithm.

preprint2015arXiv

Analytical nuclear gradients for the range-separated many-body dispersion model of noncovalent interactions

Accurate treatment of the long-range electron correlation energy, including van der Waals (vdW) or dispersion interactions, is essential for describing the structure, dynamics, and function of a wide variety of systems. Among the most accurate models for including dispersion into density functional theory (DFT) is the range-separated many-body dispersion (MBD) method [A. Ambrossetti et al., J. Chem. Phys. 140, 18A508 (2014)], in which the correlation energy is modeled at short-range by a semi-local density functional and at long-range by a model system of coupled quantum harmonic oscillators. In this work, we develop analytical gradients of the MBD energy with respect to nuclear coordinates, including all implicit coordinate dependencies arising from the partitioning of the charge density into Hirshfeld effective volumes. To demonstrate the efficiency and accuracy of these MBD gradients for geometry optimizations of systems with intermolecular and intramolecular interactions, we optimized conformers of the benzene dimer and isolated small peptides with aromatic side-chains. We find excellent agreement with the wavefunction theory reference geometries of these systems (at a fraction of the computational cost) and find that MBD consistently outperforms the popular TS and D3(BJ) dispersion corrections. To demonstrate the performance of the MBD model on a larger system with supramolecular interactions, we optimized the C$_{60}$@C$_{60}$H$_{28}$ buckyball catcher host-guest complex. Finally, we find that neglecting the implicit nuclear coordinate dependence arising from the charge density partitioning, as has been done in prior numerical treatments, leads to an unacceptable error in the MBD forces, with relative errors of ~20% (on average) that can extend well beyond 100%.

preprint2015arXiv

Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation

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 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 sixteen 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 to 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.

preprint2015arXiv

Convolutional Networks on Graphs for Learning Molecular Fingerprints

We introduce a convolutional neural network that operates directly on graphs. These networks allow end-to-end learning of prediction pipelines whose inputs are graphs of arbitrary size and shape. The architecture we present generalizes standard molecular feature extraction methods based on circular fingerprints. We show that these data-driven features are more interpretable, and have better predictive performance on a variety of tasks.

preprint2015arXiv

Efficiency of energy funneling in the photosystem II supercomplex of higher plants

The investigation of energy transfer properties in photosynthetic multi-protein networks gives insight into their underlying design principles.Here, we discuss excitonic energy transfer mechanisms of the photosystem II (PS-II) C$_2$S$_2$M$_2$ supercomplex, which is the largest isolated functional unit of the photosynthetic apparatus of higher plants.Despite the lack of a decisive energy gradient in C$_2$S$_2$M$_2$, we show that the energy transfer is directed by relaxation to low energy states. C$_2$S$_2$M$_2$ is not organized to form pathways with strict energetic downhill transfer, which has direct consequences on the transfer efficiency, transfer pathways and transfer limiting steps. The exciton dynamics is sensitive to small structural changes, which, for instance, are induced by the reorganization of vibrational coordinates. In order to incorporate the reorganization process in our numerical simulations, we go beyond rate equations and use the hierarchically coupled equation of motion approach (HEOM). While transfer from the peripherical antenna to the proteins in proximity to the reaction center occurs on a faster time scale, the final step of the energy transfer to the RC core is rather slow, and thus the limiting step in the transfer chain. Our findings suggest that the structure of the PS-II supercomplex guarantees photoprotection rather than optimized efficiency.

preprint2015arXiv

Exponentially more precise quantum simulation of fermions I: Quantum chemistry in second quantization

We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique for simulating Hamiltonian evolution using a truncated Taylor series to obtain logarithmic scaling with the inverse of the desired precision, an exponential improvement over all prior methods. The two algorithms developed in this work rely on a second quantized encoding of the wavefunction in which the state of an $N$ spin-orbital system is encoded in ${\cal O}(N)$ qubits. Our first algorithm requires at most $\widetilde{\cal O}(N^8 t)$ gates. Our second algorithm involves on-the-fly computation of molecular integrals, in a way that is exponentially more precise than classical sampling methods, by using the truncated Taylor series simulation technique. Our second algorithm has the lowest gate count of any approach to second quantized quantum chemistry simulation in the literature, scaling as $\widetilde{\cal O}(N^{5} t)$. The approaches presented here are readily applicable to a wide class of fermionic models, many of which are defined by simplified versions of the chemistry Hamiltonian.

preprint2015arXiv

Machine Learning Exciton Dynamics

Obtaining the exciton dynamics of large photosynthetic complexes by using mixed quantum mechanics/molecular mechanics (QM/MM) is computationally demanding. We propose a machine learning technique, multi-layer perceptrons, as a tool to reduce the time required to compute excited state energies. With this approach we predict time-dependent density functional theory (TDDFT) excited state energies of bacteriochlorophylls in the Fenna-Matthews-Olson (FMO) complex. Additionally we compute spectral densities and exciton populations from the predictions. Different methods to determine multi-layer perceptron training sets are introduced, leading to several initial data selections. In addition, we compute spectral densities and exciton populations. Once multi-layer perceptrons are trained, predicting excited state energies was found to be significantly faster than the corresponding QM/MM calculations. We showed that multi-layer perceptrons can successfully reproduce the energies of QM/MM calculations to a high degree of accuracy with prediction errors contained within 0.01 eV (0.5%). Spectral densities and exciton dynamics are also in agreement with the TDDFT results. The acceleration and accurate prediction of dynamics strongly encourage the combination of machine learning techniques with ab-initio methods.

preprint2015arXiv

Real-space grids and the Octopus code as tools for the development of new simulation approaches for electronic systems

Real-space grids are a powerful alternative for the simulation of electronic systems. One of the main advantages of the approach is the flexibility and simplicity of working directly in real space where the different fields are discretized on a grid, combined with competitive numerical performance and great potential for parallelization. These properties constitute a great advantage at the time of implementing and testing new physical models. Based on our experience with the Octopus code, in this article we discuss how the real-space approach has allowed for the recent development of new ideas for the simulation of electronic systems. Among these applications are approaches to calculate response properties, modeling of photoemission, optimal control of quantum systems, simulation of plasmonic systems, and the exact solution of the Schrödinger equation for low-dimensionality systems.

preprint2015arXiv

Strongly coupled quantum heat machines

Quantum heat machines (QHMs) models generally assume a weak coupling to the baths. This supposition is grounded in the separability principle between systems and allows the derivation of the evolution equation for this case. In the weak coupling regime, the machine's output is limited by the coupling strength, restricting their application. Seeking to overcome this limitation, we here analyze QHMs in the virtually unexplored strong coupling regime, where separability, as well as other standard thermodynamic assumptions, may no longer hold. We show that strongly coupled QHMs may be as efficient as their weakly coupled counterparts. In addition, we find a novel turnover behavior where their output saturates and disappears in the limit of ultra-strong coupling.

preprint2015arXiv

The theory of variational hybrid quantum-classical algorithms

Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as "the quantum variational eigensolver" was developed with the philosophy that even minimal quantum resources could be made useful when used in conjunction with classical routines. In this work we extend the general theory of this algorithm and suggest algorithmic improvements for practical implementations. Specifically, we develop a variational adiabatic ansatz and explore unitary coupled cluster where we establish a connection from second order unitary coupled cluster to universal gate sets through relaxation of exponential splitting. We introduce the concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device. Additionally, we analyze truncation and correlated sampling in Hamiltonian averaging as ways to reduce the cost of this procedure. Finally, we show how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.

preprint2014arXiv

A sparse-sampling approach for the fast computation of matrices: application to molecular vibrations

This article presents a new method to compute matrices from numerical simulations based on the ideas of sparse sampling and compressed sensing. The method is useful for problems where the determination of the entries of a matrix constitutes the computational bottleneck. We apply this new method to an important problem in computational chemistry: the determination of molecular vibrations from electronic structure calculations, where our results show that the overall scaling of the procedure can be improved in some cases. Moreover, our method provides a general framework for bootstrapping cheap low-accuracy calculations in order to reduce the required number of expensive high-accuracy calculations, resulting in a significant 3x speed-up in actual calculations.

preprint2014arXiv

Boson Sampling for Molecular Vibronic Spectra

Quantum computers are expected to be more efficient in performing certain computations than any classical machine. Unfortunately, the technological challenges associated with building a full-scale quantum computer have not yet allowed the experimental verification of such an expectation. Recently, boson sampling has emerged as a problem that is suspected to be intractable on any classical computer, but efficiently implementable with a linear quantum optical setup. Therefore, boson sampling may offer an experimentally realizable challenge to the Extended Church-Turing thesis and this remarkable possibility motivated much of the interest around boson sampling, at least in relation to complexity-theoretic questions. In this work, we show that the successful development of a boson sampling apparatus would not only answer such inquiries, but also yield a practical tool for difficult molecular computations. Specifically, we show that a boson sampling device with a modified input state can be used to generate molecular vibronic spectra, including complicated effects such as Duschinsky rotations.

preprint2014arXiv

Clock Quantum Monte Carlo: an imaginary-time method for real-time quantum dynamics

In quantum information theory, there is an explicit mapping between general unitary dynamics and Hermitian ground state eigenvalue problems known as the Feynman-Kitaev Clock. A prominent family of methods for the study of quantum ground states are quantum Monte Carlo methods, and recently the full configuration interaction quantum Monte Carlo (FCIQMC) method has demonstrated great promise for practical systems. We combine the Feynman-Kitaev Clock with FCIQMC to formulate a new technique for the study of quantum dynamics problems. Numerical examples using quantum circuits are provided as well as a technique to further mitigate the sign problem through time-dependent basis rotations. Moreover, this method allows one to combine the parallelism of Monte Carlo techniques with the locality of time to yield an effective parallel-in-time simulation technique.

preprint2014arXiv

Compact wavefunctions from compressed imaginary time evolution

Simulation of quantum systems promises to deliver physical and chemical predictions for the frontiers of technology. Unfortunately, the exact representation of these systems is plagued by the exponential growth of dimension with the number of particles, or colloquially, the curse of dimensionality. The success of approximation methods has hinged on the relative simplicity of physical systems with respect to the exponentially complex worst case. Exploiting this relative simplicity has required detailed knowledge of the physical system under study. In this work, we introduce a general and efficient black box method for many-body quantum systems that utilizes technology from compressed sensing to find the most compact wavefunction possible without detailed knowledge of the system. It is a Multicomponent Adaptive Greedy Iterative Compression (MAGIC) scheme. No knowledge is assumed in the structure of the problem other than correct particle statistics. This method can be applied to many quantum systems such as spins, qubits, oscillators, or electronic systems. As an application, we use this technique to compute ground state electronic wavefunctions of hydrogen fluoride and recover 98% of the basis set correlation energy or equivalently 99.996% of the total energy with $50$ configurations out of a possible $10^7$. Building from this compactness, we introduce the idea of nuclear union configuration interaction for improving the description of reaction coordinates and use it to study the dissociation of hydrogen fluoride and the helium dimer.

preprint2014arXiv

Exploiting locality in quantum computation for quantum chemistry

Accurate prediction of chemical and material properties from first principles quantum chemistry is a challenging task on traditional computers. Recent developments in quantum computation offer a route towards highly accurate solutions with polynomial cost, however this solution still carries a large overhead. In this perspective, we aim to bring together known results about the locality of physical interactions from quantum chemistry with ideas from quantum computation. We show that the utilization of spatial locality combined with the Bravyi-Kitaev transformation offers an improvement in the scaling of known quantum algorithms for quantum chemistry and provide numerical examples to help illustrate this point. We combine these developments to improve the outlook for the future of quantum chemistry on quantum computers.

preprint2014arXiv

Linear-algebraic bath transformation for simulating complex open quantum systems

In studying open quantum systems, the environment is often approximated as a collection of non-interacting harmonic oscillators, a configuration also known as the star-bath model. It is also well known that the star-bath can be transformed into a nearest-neighbor interacting chain of oscillators. The chain-bath model has been widely used in renormalization group approaches. The transformation can be obtained by recursion relations or orthogonal polynomials. Based on a simple linear algebraic approach, we propose a bath partition strategy to reduce the system-bath coupling strength. As a result, the non-interacting star-bath is transformed into a set of weakly-coupled multiple parallel chains. The transformed bath model allows complex problems to be practically implemented on quantum simulators, and it can also be employed in various numerical simulations of open quantum dynamics.

preprint2014arXiv

Practical Witness for Electronic Coherences

The origin of the coherences in two-dimensional spectroscopy of photosynthetic complexes remains disputed. Recently it has been shown that in the ultrashort-pulse limit, oscillations in a frequency-integrated pump-probe signal correspond exclusively to electronic coherences, and thus such experiments can be used to form a test for electronic vs. vibrational oscillations in such systems. Here we demonstrate a method for practically implementing such a test, whereby pump-probe signals are taken at several different pulse durations and used to extrapolate to the ultrashort-pulse limit. We present analytic and numerical results determining requirements for pulse durations and the optimal choice of pulse central frequency, which can be determined from an absorption spectrum. Our results suggest that for numerous systems the required experiment could be implemented by many ultrafast spectroscopy laboratories using pulses of tens of femtoseconds in duration. Such experiments could resolve the standing debate over the nature of coherences in photosynthetic complexes.

preprint2014arXiv

Quantum nonlinear optics with polar J-aggregates in microcavities

We show that an ensemble of organic dye molecules with permanent electric dipole moments embedded in a microcavity can lead to strong optical nonlinearities at the single photon level. The strong long-range electrostatic interaction between chromophores due to their permanent dipoles introduces the desired nonlinearity of the light-matter coupling in the microcavity. We obtain the absorption spectra of a weak probe field under the influence of strong exciton-photon coupling with the cavity field. Using realistic parameters, we demonstrate that a single cavity photon can significantly modify the absorptive and dispersive response of the medium to a probe photon at a different frequency. Finally, we show that the system is in the regime of cavity-induced transparency with a broad transparency window for dye dimers. We illustrate our findings using pseudoisocyanine chloride (PIC) J-aggregates in currently-available optical microcavities.

preprint2014arXiv

Quantum Simulation of Helium Hydride in a Solid-State Spin Register

\emph{Ab initio} computation of molecular properties is one of the most promising applications of quantum computing. While this problem is widely believed to be intractable for classical computers, efficient quantum algorithms exist which have the potential to vastly accelerate research throughput in fields ranging from material science to drug discovery. Using a solid-state quantum register realized in a nitrogen-vacancy (NV) defect in diamond, we compute the bond dissociation curve of the minimal basis helium hydride cation, HeH$^+$. Moreover, we report an energy uncertainty (given our model basis) of the order of $10^{-14}$ Hartree, which is ten orders of magnitude below desired chemical precision. As NV centers in diamond provide a robust and straightforward platform for quantum information processing, our work provides several important steps towards a fully scalable solid state implementation of a quantum chemistry simulator.

preprint2014arXiv

Topologically protected excitons in porphyrin thin films

The control of exciton transport in organic materials is of fundamental importance for the development of efficient light-harvesting systems. This transport is easily deteriorated by traps in the disordered energy landscape. Here, we propose and analyze a system that supports topological Frenkel exciton edge states. Backscattering of these chiral Frenkel excitons is prohibited by symmetry, ensuring that the transport properties of such a system are robust against disorder. To implement our idea, we propose a two-dimensional periodic array of tilted porphyrins interacting with a homogenous magnetic field. This field serves to break time-reversal symmetry and results in lattice fluxes that that mimic the Aharonov-Bohm phase acquired by electrons. Our proposal is the first blueprint for realizing topological phases of matter in molecular aggregates and suggests a paradigm for engineering novel excitonic materials.

preprint2013arXiv

A variational eigenvalue solver on a quantum processor

Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the dimension of the problem space grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm can efficiently find the eigenvalue of a given eigenvector but requires fully coherent evolution. We present an alternative approach that greatly reduces the requirements for coherent evolution and we combine this method with a new approach to state preparation based on ansätze and classical optimization. We have implemented the algorithm by combining a small-scale photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry: calculating the ground state molecular energy for He-H+, to within chemical accuracy. The proposed approach, by drastically reducing the coherence time requirements, enhances the potential of the quantum resources available today and in the near future.

preprint2013arXiv

Atomistic study of energy funneling in the light-harvesting complex of green sulfur bacteria

Phototrophic organisms such as plants, photosynthetic bacteria and algae use microscopic complexes of pigment molecules to absorb sunlight. Within the light-harvesting complexes, which frequently have several functional and structural subunits, the energy is transferred in the form of molecular excitations with very high efficiency. Green sulfur bacteria are considered to be amongst the most efficient light-harvesting organisms. Despite multiple experimental and theoretical studies of these bacteria the physical origin of the efficient and robust energy transfer in their light-harvesting complexes is not well understood. To study excitation dynamics at the systems level we introduce an atomistic model that mimics a complete light-harvesting apparatus of green sulfur bacteria. The model contains approximately 4000 pigment molecules and comprises a double wall roll for the chlorosome, a baseplate and six Fenna-Matthews-Olson trimer complexes. We show that the fast relaxation within functional subunits combined with the transfer between collective excited states of pigments can result in robust energy funneling. Energy transfer is robust on the initial excitation conditions and temperature changes. Moreover, the same mechanism describes the coexistence of multiple timescales of excitation dynamics frequently observed in ultrafast optical experiments. While our findings support the hypothesis of supertransfer, the model reveals energy transport through multiple channels on different length scales.

preprint2013arXiv

Coherent exciton dynamics in supramolecular light-harvesting nanotubes revealed by ultrafast quantum process tomography

Long-lived exciton coherences have been recently observed in photosynthetic complexes via ultrafast spectroscopy, opening exciting possibilities for the study and design of coherent exciton transport. Yet, ambiguity in the spectroscopic signals has led to arguments for interpreting them in terms of the exciton dynamics, demanding more stringent tests. We propose a novel strategy, Quantum Process Tomography (QPT) for ultrafast spectroscopy, to reconstruct the evolving quantum state of excitons in double-walled supramolecular light-harvesting nanotubes at room temperature. The protocol calls for eight transient grating experiments with varied pulse spectra. Our analysis reveals unidirectional energy transfer from the outer to the inner wall excitons, absence of nonsecular processes, and an unexpected coherence between those two states lasting about 150 femtoseconds, indicating weak electronic coupling between the walls. Our work constitutes the first experimental QPT in a 'warm' and complex system, and provides an elegant scheme to maximize information from ultrafast spectroscopy experiments.

preprint2013arXiv

Construction of Energy Functions for Lattice Heteropolymer Models: A Case Study in Constraint Satisfaction Programming and Adiabatic Quantum Optimization

Optimization problems associated with the interaction of linked particles are at the heart of polymer science, protein folding and other important problems in the physical sciences. In this review we explain how to recast these problems as constraint satisfaction problems such as linear programming, maximum satisfiability, and pseudo-boolean optimization. By encoding problems this way, one can leverage substantial insight and powerful solvers from the computer science community which studies constraint programming for diverse applications such as logistics, scheduling, artificial intelligence, and circuit design. We demonstrate how to constrain and embed lattice heteropolymer problems using several strategies. Each strikes a unique balance between number of constraints, complexity of constraints, and number of variables. Finally, we show how to reduce the locality of couplings in these energy functions so they can be realized as Hamiltonians on existing quantum annealing machines. We intend that this review be used as a case study for encoding related combinatorial optimization problems in a form suitable for adiabatic quantum optimization.

preprint2013arXiv

Efficient Quantum Circuits for Diagonal Unitaries Without Ancillas

The accurate evaluation of diagonal unitary operators is often the most resource-intensive element of quantum algorithms such as real-space quantum simulation and Grover search. Efficient circuits have been demonstrated in some cases but generally require ancilla registers, which can dominate the qubit resources. In this paper, we point out a correspondence between Walsh functions and a basis for diagonal operators that gives a simple way to construct efficient circuits for diagonal unitaries without ancillas. This correspondence reduces the problem of constructing the minimal-depth circuit within a given error tolerance, for an arbitrary diagonal unitary $e^{if(\hat{x})}$ in the $|x>$ basis, to that of finding the minimal-length Walsh-series approximation to the function $f(x)$. We apply this approach to the quantum simulation of the classical Eckart barrier problem of quantum chemistry, demonstrating that high-fidelity quantum simulations can be achieved with few qubits and low depth.

preprint2013arXiv

Feynman's clock, a new variational principle, and parallel-in-time quantum dynamics

We introduce a new discrete-time variational principle inspired by the quantum clock originally proposed by Feynman, and use it to write down quantum evolution as a ground state eigenvalue problem. The construction allows one to apply ground state quantum many-body theory to quantum dynamics, extending the reach of many highly developed tools from this fertile research area. Moreover this formalism naturally leads to an algorithm to parallelize quantum simulation over time. We draw an explicit connection between previously known time-dependent variational principles and the new time embedded variational principle presented. Sample calculations are presented applying the idea to a Hydrogen molecule and the spin degrees of freedom of a model inorganic compound demonstrating the parallel speedup of our method as well as its flexibility in applying ground-state methodologies. Finally, we take advantage of the unique perspective of the new variational principle to examine the error of basis approximations in quantum dynamics.

preprint2013arXiv

Force-Field Functor Theory: Classical Force-Fields which Reproduce Equilibrium Quantum Distributions

Feynman and Hibbs were the first to variationally determine an effective potential whose associated classical canonical ensemble approximates the exact quantum partition function. We examine the existence of a map between the local potential and an effective classical potential which matches the exact quantum equilibrium density and partition function. The usefulness of such a mapping rests in its ability to readily improve Born-Oppenheimer potentials for use with classical sampling. We show that such a map is unique and must exist. To explore the feasibility of using this result to improve classical molecular mechanics, we numerically produce a map from a library of randomly generated one-dimensional potential/effective potential pairs then evaluate its performance on independent test problems. We also apply the map to simulate liquid para-hydrogen, finding that the resulting radial pair distribution functions agree well with path integral Monte Carlo simulations. The surprising accessibility and transferability of the technique suggest a quantitative route to adapting Born-Oppenheimer potentials, with a motivation similar in spirit to the powerful ideas and approximations of density functional theory.

preprint2013arXiv

More accurate and efficient bath spectral densities from super-resolution

Quantum transport and other phenomena are typically modeled by coupling the system of interest to an environment, or bath, held at thermal equilibrium. Realistic bath models are at least as challenging to construct as models for the quantum systems themselves, since they must incorporate many degrees of freedom that interact with the system on a wide range of timescales. Owing to computational limitations, the environment is often modeled with simple functional forms, with a few parameters fit to experiment to yield semi-quantitative results. Growing computational resources have enabled the construction of more realistic bath models from molecular dynamics (MD) simulations. In this paper, we develop a numerical technique to construct these atomistic bath models with better accuracy and decreased cost. We apply a novel signal processing technique, known as super-resolution, combined with a dictionary of physically-motivated bath modes to derive spectral densities from MD simulations. Our approach reduces the required simulation time and provides a more accurate spectral density than can be obtained via standard Fourier transform methods. Moreover, the spectral density is provided as a convenient closed-form expression which yields an analytic time-dependent bath kernel. Exciton dynamics of the Fenna-Matthews-Olsen light-harvesting complex are simulated with a second order time-convolutionless master equation, and spectral densities constructed via super-resolution are shown to reproduce the dynamics using only a quarter of the amount of MD data.

preprint2013arXiv

Photonics meets excitonics: natural and artificial molecular aggregates

Organic molecules store the energy of absorbed light in the form of charge-neutral molecular excitations -- Frenkel excitons. Usually, in amorphous organic materials, excitons are viewed as quasiparticles, localized on single molecules, which diffuse randomly through the structure. However, the picture of incoherent hopping is not applicable to some classes of molecular aggregates -- assemblies of molecules that have strong near field interaction between electronic excitations in the individual subunits. Molecular aggregates can be found in nature, in photosynthetic complexes of plants and bacteria, and they can also be produced artificially in various forms including quasi-one dimensional chains, two-dimensional films, tubes, etc. In these structures light is absorbed collectively by many molecules and the following dynamics of molecular excitation possesses coherent properties. This energy transfer mechanism, mediated by the coherent exciton dynamics, resembles the propagation of electromagnetic waves through a structured medium on the nanometer scale. The absorbed energy can be transferred resonantly over distances of hundreds of nanometers before exciton relaxation occurs. Furthermore, the spatial and energetic landscape of molecular aggregates can enable the funneling of the exciton energy to a small number of molecules either within or outside the aggregate. In this review we establish a bridge between the fields of photonics and excitonics by describing the present understanding of exciton dynamics in molecular aggregates.

preprint2013arXiv

Real-space density functional theory on graphical processing units: computational approach and comparison to Gaussian basis set methods

We discuss the application of graphical processing units (GPUs) to accelerate real-space density functional theory (DFT) calculations. To make our implementation efficient, we have developed a scheme to expose the data parallelism available in the DFT approach; this is applied to the different procedures required for a real-space DFT calculation. We present results for current-generation GPUs from AMD and Nvidia, which show that our scheme, implemented in the free code Octopus, can reach a sustained performance of up to 90 GFlops for a single GPU, representing a significant speed-up when compared to the CPU version of the code. Moreover, for some systems our implementation can outperform a GPU Gaussian basis set code, showing that the real-space approach is a competitive alternative for DFT simulations on GPUs.

preprint2013arXiv

Resource Efficient Gadgets for Compiling Adiabatic Quantum Optimization Problems

We develop a resource efficient method by which the ground-state of an arbitrary k-local, optimization Hamiltonian can be encoded as the ground-state of a (k-1)-local optimization Hamiltonian. This result is important because adiabatic quantum algorithms are often most easily formulated using many-body interactions but experimentally available interactions are generally 2-body. In this context, the efficiency of a reduction gadget is measured by the number of ancilla qubits required as well as the amount of control precision needed to implement the resulting Hamiltonian. First, we optimize methods of applying these gadgets to obtain 2-local Hamiltonians using the least possible number of ancilla qubits. Next, we show a novel reduction gadget which minimizes control precision and a heuristic which uses this gadget to compile 3-local problems with a significant reduction in control precision. Finally, we present numerics which indicate a substantial decrease in the resources required to implement randomly generated, 3-body optimization Hamiltonians when compared to other methods in the literature.

preprint2013arXiv

Solving systems of linear equations on a quantum computer

Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers, making for one of the most promising applications of quantum computation. Here, we demonstrate this quantum algorithm by implementing various instances on a photonic quantum computing architecture. Our implementation involves the application of two consecutive entangling gates on the same pair of polarisation-encoded qubits. We realize two separate controlled-NOT gates where the successful operation of the first gate is heralded by a measurement of two ancillary photons. Our work thus demonstrates the implementation of a quantum algorithm with high practical significance as well as an important technological advance which brings us closer to a comprehensive control of photonic quantum information.

preprint2013arXiv

Thermodynamics of quantum coherence

Quantum decoherence is seen as an undesired source of irreversibility that destroys quantum resources. Quantum coherences seem to be a property that vanishes at thermodynamic equilibrium. Away from equilibrium, quantum coherences challenge the classical notions of a thermodynamic bath in a Carnot engines, affect the efficiency of quantum transport, lead to violations of Fourier's law, and can be used to dynamically control the temperature of a state. However, the role of quantum coherence in thermodynamics is not fully understood. Here we show that the relative entropy of a state with quantum coherence with respect to its decohered state captures its deviation from thermodynamic equilibrium. As a result, changes in quantum coherence can lead to a heat flow with no associated temperature, and affect the entropy production rate. From this, we derive a quantum version of the Onsager reciprocal relations that shows that there is a reciprocal relation between thermodynamic forces from coherence and quantum transport. Quantum decoherence can be useful and offers new possibilities of thermodynamic control for quantum transport.

preprint2012arXiv

A witness for coherent electronic oscillations in ultrafast spectroscopy

We report a conceptually straightforward witness that isolates coherent electronic oscillations from their vibronic counterparts in nonlinear optical spectra of molecular aggregates: Coherent oscillations as a function of waiting time in broadband pump/broadband probe spectra correspond to coherent electronic oscillations. Oscillations in individual peaks of 2D electronic spectra do not necessarily yield this conclusion. Our witness is simpler to implement than quantum process tomography and potentially resolves a long-standing controversy on the character of oscillations in ultrafast spectra of photosynthetic light harvesting systems.

preprint2012arXiv

Demon-like Algorithmic Quantum Cooling and its Realization with Quantum Optics

The simulation of low-temperature properties of many-body systems remains one of the major challenges in theoretical and experimental quantum information science. We present, and demonstrate experimentally, a universal cooling method which is applicable to any physical system that can be simulated by a quantum computer. This method allows us to distill and eliminate hot components of quantum states, i.e., a quantum Maxwell's demon. The experimental implementation is realized with a quantum-optical network, and the results are in full agreement with theoretical predictions (with fidelity higher than 0.978). These results open a new path for simulating low-temperature properties of physical and chemical systems that are intractable with classical methods.

preprint2012arXiv

Environment-assisted quantum transport in ordered systems

Noise-assisted transport in quantum systems occurs when quantum time-evolution and decoherence conspire to produce a transport efficiency that is higher than what would be seen in either the purely quantum or purely classical cases. In disordered systems, it has been understood as the suppression of coherent quantum localisation through noise, which brings detuned quantum levels into resonance and thus facilitates transport. We report several new mechanisms of environment-assisted transport in ordered systems, in which there is no localisation to overcome and where one would naively expect that coherent transport is the fastest possible. Although we are particularly motivated by the need to understand excitonic energy transfer in photosynthetic light-harvesting complexes, our model is general---transport in a tight-binding system with dephasing, a source, and a trap---and can be expected to have wider application.

preprint2012arXiv

Exciton transport in thin-film cyanine dye J-aggregates

We present a theoretical model for the study of exciton dynamics in J-aggregated monolayers of fluorescent dyes. The excitonic evolution is described by a Monte-Carlo wave function approach which allows for a unified description of the quantum (ballistic) and classical (diffusive) propagation of an exciton on a lattice in different parameter regimes. The transition between the ballistic and diffusive regime is controlled by static and dynamic disorder. As an example, the model is applied to three cyanine dye J-aggregates: TC, TDBC, and U3. Each of the molecule-specific structure and excitation parameters are estimated using time-dependent density functional theory. The exciton diffusion coefficients are calculated and analyzed for different degrees of film disorder and are correlated to the physical properties and the structural arrangement of molecules in the aggregates. Further, exciton transport is anisotropic and dependent on the initial exciton energy. The upper-bound estimation of the exciton diffusion length in the TDBC thin-film J-aggregate is of the order of hundreds of nanometers, which is in good qualitative agreement with the diffusion length estimated from experiments.

preprint2012arXiv

Finding low-energy conformations of lattice protein models by quantum annealing

Lattice protein folding models are a cornerstone of computational biophysics. Although these models are a coarse grained representation, they provide useful insight into the energy landscape of natural proteins. Finding low-energy three-dimensional structures is an intractable problem even in the simplest model, the Hydrophobic-Polar (HP) model. Exhaustive search of all possible global minima is limited to sequences in the tens of amino acids. Description of protein-like properties are more accurately described by generalized models, such as the one proposed by Miyazawa and Jernigan (MJ), which explicitly take into account the unique interactions among all 20 amino acids. There is theoretical and experimental evidence of the advantage of solving classical optimization problems using quantum annealing over its classical analogue (simulated annealing). In this report, we present a benchmark implementation of quantum annealing for a biophysical problem (six different experiments up to 81 superconducting quantum bits). Although the cases presented here can be solved in a classical computer, we present the first implementation of lattice protein folding on a quantum device under the Miyazawa-Jernigan model. This paves the way towards studying optimization problems in biophysics and statistical mechanics using quantum devices.

preprint2012arXiv

Multipartite Quantum Entanglement Evolution in Photosynthetic Complexes

We investigate the evolution of entanglement in the Fenna-Matthew-Olson (FMO) complex based on simulations using the scaled hierarchy equation of motion (HEOM) approach. We examine the role of multipartite entanglement in the FMO complex by direct computation of the convex roof optimization for a number of measures, including some that have not been previously evaluated. We also consider the role of monogamy of entanglement in these simulations. We utilize the fact that the monogamy bounds are saturated in the single exciton subspace. This enables us to compute more measures of entanglement exactly and also to validate the evaluation of the convex roof. We then use direct computation of the convex roof to evaluate measures that are not determined by monogamy. This approach provides a more complete account of the entanglement in these systems than has been available to date. Our results support the hypothesis that multipartite entanglement is maximum primary along the two distinct electronic energy transfer pathways.

preprint2012arXiv

On the alternatives for bath correlators and spectral densities from mixed quantum-classical simulations

We investigate on the procedure of extracting a "spectral density" from mixed QM/MM calculations and employing it in open quantum systems models. In particular, we study the connection between the energy gap correlation function extracted from ground state QM/MM and the bath spectral density used as input in open quantum system approaches. We introduce a simple model which can give intuition on when the ground state QM/MM propagation will give the correct energy gap. We also discuss the role of higher order correlators of the energy-gap fluctuations which can provide useful information on the bath. Further, various semiclassical corrections to the spectral density, are applied and investigated. Finally, we apply our considerations to the photosynthetic Fenna-Matthews-Olson complex. For this system, our results suggest the use of the Harmonic prefactor for the spectral density rather than the Standard one, which was employed in the simulations of the system carried out to date.

preprint2012arXiv

Path integral Monte Carlo with importance sampling for excitons interacting with an arbitrary phonon bath

The reduced density matrix of excitons coupled to a phonon bath at a finite temperature is studied using the path integral Monte Carlo method. Appropriate choices of estimators and importance sampling schemes are crucial to the performance of the Monte Carlo simulation. We show that by choosing the population-normalized estimator for the reduced density matrix, an efficient and physically-meaningful sampling function can be obtained. In addition, the nonadiabatic phonon probability density is obtained as a byproduct during the sampling procedure. For importance sampling, we adopted the Metropolis-adjusted Langevin algorithm. The analytic expression for the gradient of the target probability density function associated with the population-normalized estimator cannot be obtained in closed form without a matrix power series. An approximated gradient that can be efficiently calculated is explored to achieve better computational scaling and efficiency. Application to a simple one-dimensional model system from the previous literature confirms the correctness of the method developed in this manuscript. The displaced harmonic model system within the single exciton manifold shows the numerically exact temperature dependence of the coherence and population of the excitonic system. The sampling scheme can be applied to an arbitrary anharmonic environment, such as multichromophoric systems embedded in the protein complex. The result of this study is expected to stimulate further development of real time propagation methods that satisfy the detailed balance condition for exciton populations.

preprint2012arXiv

Positivity in the presence of initial system-environment correlation

The constraints imposed by the initial system-environment correlation can lead to nonpositive Dynamical maps. We find the conditions for positivity and complete positivity of such dynamical maps by using the concept of an assignment map. Any initial system-environment correlations make the assignment map nonpositive, while the positivity of the dynamical map depends on the interplay between the assignment map and the system-environment coupling. We show how this interplay can reveal or hide the nonpositivity of the assignment map. We discuss the role of this interplay in Markovian models.

preprint2012arXiv

Quantum simulator of an open quantum system using superconducting qubits: exciton transport in photosynthetic complexes

Open quantum system approaches are widely used in the description of physical, chemical and biological systems. A famous example is electronic excitation transfer in the initial stage of photosynthesis, where harvested energy is transferred with remarkably high efficiency to a reaction center. This transport is affected by the motion of a structured vibrational environment, which makes simulations on a classical computer very demanding. Here we propose an analog quantum simulator of complex open system dynamics with a precisely engineered quantum environment. Our setup is based on superconducting circuits, a well established technology. As an example, we demonstrate that it is feasible to simulate exciton transport in the Fenna-Matthews-Olson photosynthetic complex. Our approach allows for a controllable single-molecule simulation and the investigation of energy transfer pathways as well as non-Markovian noise-correlation effects.

preprint2012arXiv

Simulating chemistry efficiently on fault-tolerant quantum computers

Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm [C.M. Dawson and M.A. Nielsen, \emph{Quantum Inf. Comput.}, \textbf{6}:81, 2006]. For a given approximation error $ε$, arbitrary single-qubit gates can be produced fault-tolerantly and using a limited set of gates in time which is $O(\log ε)$ or $O(\log \log ε)$; with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for Lithium hydride.

preprint2012arXiv

Unification of witnessing initial system-environment correlations and witnessing non-Markovianity

We show the connection between a witness that detects dynamical maps with initial system-environment correlations and a witness that detects non-Markovian open quantum systems. Our analysis is based on studying the role that state preparation plays in witnessing violations of contractivity of open quantum system dynamics. Contractivity is a property of some quantum processes where the trace distance of density matrices decrease with time. From this, we show how a witness of initial-correlations is an upper bound to a witness of non-Markovianity. We discuss how this relationship shows further connections between initial system-environment correlations and non-Markovianity at an instance of time in open quantum systems.

preprint2011arXiv

Conformation of self-assembled porphyrin dimers in liposome vesicles by phase-modulation 2D fluorescence spectroscopy

By applying a phase-modulation fluorescence approach to 2D electronic spectroscopy, we studied the conformation-dependent exciton-coupling of a porphyrin dimer embedded in a phospholipid bilayer membrane. Our measurements specify the relative angle and separation between interacting electronic transition dipole moments, and thus provide a detailed characterization of dimer conformation. Phase-modulation 2D fluorescence spectroscopy (PM-2D FS) produces 2D spectra with distinct optical features, similar to those obtained using 2D photon-echo spectroscopy (2D PE). Specifically, we studied magnesium meso tetraphenylporphyrin dimers, which form in the amphiphilic regions of 1,2-distearoyl-sn-glycero-3-phosphocholine liposomes. Comparison between experimental and simulated spectra show that while a wide range of dimer conformations can be inferred by either the linear absorption spectrum or the 2D spectrum alone, consideration of both types of spectra constrains the possible structures to a "T-shaped" geometry. These experiments establish the PM-2D FS method as an effective approach to elucidate chromophore dimer conformation.

preprint2011arXiv

Digital Quantum Simulation of the Statistical Mechanics of a Frustrated Magnet

Many interesting problems in physics, chemistry, and computer science are equivalent to problems of interacting spins. However, most of these problems require computational resources that are out of reach by classical computers. A promising solution to overcome this challenge is to exploit the laws of quantum mechanics to perform simulation. Several "analog" quantum simulations of interacting spin systems have been realized experimentally. However, relying on adiabatic techniques, these simulations are limited to preparing ground states only. Here we report the first experimental results on a "digital" quantum simulation on thermal states; we simulated a three-spin frustrated magnet, a building block of spin ice, with an NMR quantum information processor, and we are able to explore the phase diagram of the system at any simulated temperature and external field. These results serve as a guide for identifying the challenges for performing quantum simulation on physical systems at finite temperatures, and pave the way towards large scale experimental simulations of open quantum systems in condensed matter physics and chemistry.

preprint2011arXiv

Exciton-phonon information flow in the energy transfer process of photosynthetic complexes

Non-Markovian and non-equilibrium phonon effects are believed to be key ingredients in the energy transfer in photosynthetic complexes, especially in complexes which exhibit a regime of intermediate exciton-phonon coupling. In this work, we utilize a recently-developed measure for non-Markovianity to elucidate the exciton-phonon dynamics in terms of the information flow between electronic and vibrational degrees of freedom. We study the measure in the hierarchical equation of motion approach which captures strong system-bath coupling effects and non-equilibrium molecular reorganization. We propose an additional trace-distance measure for the information flow that could be extended to other master equations. We find that for a model dimer system and the Fenna-Matthews-Olson complex that non-Markovianity is significant under physiological conditions.

preprint2011arXiv

Modified-scaled hierarchical equation of motion approach for the study of quantum coherence in photosynthetic complexes

We present a detailed theoretical study of the transfer of electronic excitation energy through the Fenna-Matthews-Olson (FMO) pigment-protein complex, using the new developed modified scaled hierarchical approach [Shi Q. et al, J Chem Phys 2009, 130, 084105]. We show that this approach is computationally more efficient than the original hierarchical approach. The modified approach reduces the truncation levels of the auxiliary density operators and the correlation function. We provide a systematic study of how the number of auxiliary density operators and the higher-order correlation functions affect the exciton dynamics. The time scales of the coherent beating are consistent with experimental observations. Furthermore, our theoretical results exhibit population beating at physiological temperature. Additionally, the method does not require a low-temperature correction to obtain the correct thermal equilibrium at long times.

preprint2011arXiv

Nonradiative lifetimes in intermediate band materials - absence of lifetime recovery

Intermediate band photovoltaics hold the promise of being highly efficient and cost effective photovoltaic cells. Intermediate states in the band gap, however, are known to facilitate nonradiative recombination. Much effort has been dedicated to producing metallic intermediate bands in hopes of producing lifetime recovery -- an increase in carrier lifetime as doping levels increase. We show that lifetime recovery induced by the insulator-to-metal transition will not occur, because the metallic extended states will be localised by phonons during the recombination process. Only trivial forms of lifetime recovery, e.g., from an overall shift in intermediate levels, are possible. Future work in intermediate band photovoltaics must focus on optimizing subgap optical absorption and minimizing recombination, but not via lifetime recovery.

preprint2011arXiv

Observation of topologically protected bound states in a one dimensional photonic system

One of the most striking features of quantum mechanics is the appearance of phases of matter with topological origins. These phases result in remarkably robust macroscopic phenomena such as the edge modes in integer quantum Hall systems, the gapless surface states of topological insulators, and elementary excitations with non-abelian statistics in fractional quantum Hall systems and topological superconductors. Many of these states hold promise in the applications to quantum memories and quantum computation. Artificial quantum systems, with their precise controllability, provide a versatile platform for creating and probing a wide variety of topological phases. Here we investigate topological phenomena in one dimension, using photonic quantum walks. The photon evolution simulates the dynamics of topological phases which have been predicted to arise in, for example, polyacetylene. We experimentally confirm the long-standing prediction of topologically protected localized states associated with these phases by directly imaging their wavefunctions. Moreover, we reveal an entirely new topological phenomenon: the existence of a topologically protected pair of bound states which is unique to periodically driven systems. Our experiment demonstrates a powerful new approach for controlling topological properties of quantum systems through periodic driving.

preprint2011arXiv

Prediction of the derivative discontinuity in density functional theory from an electrostatic description of the exchange and correlation potential

We propose a new approach to approximate the exchange and correlation (XC) functional in density functional theory. The XC potential is considered as an electrostatic potential, generated by a fictitious XC density, which is in turn a functional of the electronic density. We apply the approach to develop a correction scheme that fixes the asymptotic behavior of any approximated XC potential for finite systems. Additionally, the correction procedure gives the value of the derivative discontinuity; therefore it can directly predict the fundamental gap as a ground-state property.

preprint2011arXiv

Probing biological light-harvesting phenomena by optical cavities

We propose a driven optical cavity quantum electrodynamics (QED) set up aimed at directly probing energy transport dynamics in photosynthetic biomolecules. We show that detailed information concerning energy transfer paths and delocalization of exciton states can be inferred (and exciton energies estimated) from the statistical properties of the emitted photons. This approach provides us with a novel spectroscopic tool for the interrogation of biological systems in terms of quantum optical phenomena which have been usually studied for atomic or solid-state systems, e.g. trapped atoms and semiconductor quantum dots.

preprint2011arXiv

Quantum process tomography of molecular dimers from two-dimensional electronic spectroscopy I: General theory and application to homodimers

Is it possible to infer the time evolving quantum state of a multichromophoric system from a sequence of two-dimensional electronic spectra (2D-ES) as a function of waiting time? Here we provide a positive answer for a tractable model system: a coupled dimer. After exhaustively enumerating the Liouville pathways associated to each peak in the 2D-ES, we argue that by judiciously combining the information from a series of experiments varying the polarization and frequency components of the pulses, detailed information at the amplitude level about the input and output quantum states at the waiting time can be obtained. This possibility yields a quantum process tomography (QPT) of the single-exciton manifold, which completely characterizes the open quantum system dynamics through the reconstruction of the process matrix. This is the first of a series of two articles. In this manuscript, we specialize our results to the case of a homodimer, where we prove that signals stemming from coherence to population transfer and viceversa vanish upon isotropic averaging, and therefore, only a partial QPT is possible in this case. However, this fact simplifies the spectra, and it follows that only two polarization controlled experiments (and no pulse-shaping requirements) suffice to yield the elements of the process matrix which survive under isotropic averaging. The angle between the two site transition dipole moments is self-consistently obtained from the 2D-ES. Model calculations are presented, as well as an error analysis in terms of the angle between the dipoles and peak overlap. In the second article accompanying this study, we numerically exemplify the theory for heterodimers and carry out a detailed error analysis for such case. This investigation provides an important benchmark for more complex proposals of quantum process tomography (QPT) via multidimensional spectroscopic experiments.

preprint2011arXiv

Quantum State and Process Tomography of Energy Transfer Systems via Ultrafast Spectroscopy

The description of excited state dynamics in multichromophoric systems constitutes both a theoretical and experimental challenge in modern physical chemistry. An experimental protocol which can systematically characterize both coherent and dissipative processes at the level of the evolving quantum state of the chromophores is desired. In this article, we show that a carefully chosen set of polarization controlled two-color heterodyned photon-echo experiments can be used to reconstruct the time-evolving density matrix of the one-exciton manifold of a heterodimer. This possibility in turn allows for a complete description of the excited state dynamics via quantum process tomography (QPT). Calculations on the dimer show that QPT can reveal rich information about system-bath interactions, which otherwise appear nontrivially hidden in the polarization monitored in standard four-wave mixing experiments. Our study presents a novel method for analyzing condensed phase experiments with a quantum information processing perspective.

preprint2011arXiv

Relaxation and dephasing in open quantum systems time-dependent density functional theory: Properties of exact functionals from an exactly-solvable model system

The dissipative dynamics of many-electron systems interacting with a thermal environment has remained a long-standing challenge within time-dependent density functional theory (TDDFT). Recently, the formal foundations of open quantum systems time-dependent density functional theory (OQS-TDDFT) within the master equation approach were established. It was proven that the exact time-dependent density of a many-electron open quantum system evolving under a master equation can be reproduced with a closed (unitarily evolving) and non-interacting Kohn-Sham system. This potentially offers a great advantage over previous approaches to OQS-TDDFT, since with suitable functionals one could obtain the dissipative open-systems dynamics by simply propagating a set of Kohn-Sham orbitals as in usual TDDFT. However, the properties and exact conditions of such open-systems functionals are largely unknown. In the present article, we examine a simple and exactly-solvable model open quantum system: one electron in a harmonic well evolving under the Lindblad master equation. We examine two different representitive limits of the Lindblad equation (relaxation and pure dephasing) and are able to deduce a number of properties of the exact OQS-TDDFT functional. Challenges associated with developing approximate functionals for many-electron open quantum systems are also discussed.

preprint2011arXiv

Scaling and localization lengths of a topologically disordered system

We consider a noninteracting disordered system designed to model particle diffusion, relaxation in glasses, and impurity bands of semiconductors. Disorder originates in the random spatial distribution of sites. We find strong numerical evidence that this model displays the same universal behavior as the standard Anderson model. We use finite-size-scaling to find the localization length as a function of energy and density, including localized states away from the delocalization transition. Results at many energies all fit onto the same universal scaling curve.

preprint2011arXiv

Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance

Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating the ground state is available, as often happens for many problems in physics and chemistry, a quantum computer could employ this trial wavefunction to project the ground state by means of the phase estimation algorithm (PEA). We performed an experimental realization of this idea by implementing a variational-wavefunction approach to solve the ground-state problem of the Heisenberg spin model with an NMR quantum simulator. Our iterative phase estimation procedure yields a high accuracy for the eigenenergies (to the 10^-5 decimal digit). The ground-state fidelity was distilled to be more than 80%, and the singlet-to-triplet switching near the critical field is reliably captured. This result shows that quantum simulators can better leverage classical trial wavefunctions than classical computers.

preprint2010arXiv

A Quantum-Quantum Metropolis Algorithm

Recently, the idea of classical Metropolis sampling through Markov chains has been generalized for quantum Hamiltonians. However, the underlying Markov chain of this algorithm is still classical in nature. Due to Szegedy's method, the Markov chains of classical Hamiltonians can achieve a quadratic quantum speedup in the eigenvalue gap of the corresponding transition matrix. A natural question to ask is whether Szegedy's quantum speedup is merely a consequence of employing classical Hamiltonians, where the eigenstates simply coincide with the computational basis, making cloning of the classical information possible. We solve this problem by introducing a quantum version of the method of Markov-chain quantization combined with the quantum simulated annealing (QSA) procedure, and describe explicitly a novel quantum Metropolis algorithm, which exhibits a quadratic quantum speedup in the eigenvalue gap of the corresponding Metropolis Markov chain for any quantum Hamiltonian. This result provides a complete generalization of the classical Metropolis method to the quantum domain.

preprint2010arXiv

A study of heuristic guesses for adiabatic quantum computation

Adiabatic quantum computation (AQC) is a universal model for quantum computation which seeks to transform the initial ground state of a quantum system into a final ground state encoding the answer to a computational problem. AQC initial Hamiltonians conventionally have a uniform superposition as ground state. We diverge from this practice by introducing a simple form of heuristics: the ability to start the quantum evolution with a state which is a guess to the solution of the problem. With this goal in mind, we explain the viability of this approach and the needed modifications to the conventional AQC (CAQC) algorithm. By performing a numerical study on hard-to-satisfy 6 and 7 bit random instances of the satisfiability problem (3-SAT), we show how this heuristic approach is possible and we identify that the performance of the particular algorithm proposed is largely determined by the Hamming distance of the chosen initial guess state with respect to the solution. Besides the possibility of introducing educated guesses as initial states, the new strategy allows for the possibility of restarting a failed adiabatic process from the measured excited state as opposed to restarting from the full superposition of states as in CAQC. The outcome of the measurement can be used as a more refined guess state to restart the adiabatic evolution. This concatenated restart process is another heuristic that the CAQC strategy cannot capture.

preprint2010arXiv

Characterization and quantification of the role of coherence in ultrafast quantum biological experiments using quantum master equations, atomistic simulations, and quantum process tomography

Long-lived electronic coherences in various photosynthetic complexes at cryogenic and room temperature have generated vigorous efforts both in theory and experiment to understand their origins and explore their potential role to biological function. The ultrafast signals resulting from the experiments that show evidence for these coherences result from many contributions to the molecular polarization. Quantum process tomography (QPT) was conceived in the context of quantum information processing to characterize and understand general quantum evolution of controllable quantum systems, for example while carrying out quantum computational tasks. We introduce our QPT method for ultrafast experiments, and as an illustrative example, apply it to a simulation of a two-chromophore subsystem of the Fenna-Matthews-Olson photosynthetic complex, which was recently shown to have long-lived quantum coherences. Our Fenna-Matthews-Olson model is constructed using an atomistic approach to extract relevant parameters for the simulation of photosynthetic complexes that consists of a quantum mechanics/molecular mechanics approach combined with molecular dynamics and the use of state-of-the-art quantum master equations. We provide a set of methods that allow for quantifying the role of quantum coherence, dephasing, relaxation and other elementary processes in energy transfer efficiency in photosynthetic complexes, based on the information obtained from the atomistic simulations, or, using QPT, directly from the experiment. The ultimate goal of the combination of this diverse set of methodologies is to provide a reliable way of quantifying the role of long-lived quantum coherences and obtain atomistic insight of their causes.

preprint2010arXiv

Engineering directed excitonic energy transfer

We provide an intuitive platform for engineering exciton transfer dynamics. We show that careful consideration of the spectral density, which describes the system-bath interaction, leads to opportunities to engineer the transfer of an exciton. Since excitons in nanostructures are proposed for use in quantum information processing and artificial photosynthetic designs, our approach paves the way for engineering a wide range of desired exciton dynamics. We carefully describe the validity of the model and use experimentally relevant material parameters to show counter-intuitive examples of a directed exciton transfer in a linear chain of quantum dots.

preprint2010arXiv

Simulating chemistry using quantum computers

The difficulty of simulating quantum systems, well-known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.

preprint2010arXiv

Simulation of Classical Thermal States on a Quantum Computer: A Transfer Matrix Approach

We present a hybrid quantum-classical algorithm to simulate thermal states of a classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one at a time. We identify a class of classical models for which our method is efficient and avoids potential exponential overheads encountered by Grover-like or quantum Metropolis schemes. Our algorithm also gives an exponential advantage for 2D Ising models with magnetic field on a square lattice, compared with the previously known Zalka's algorithm.

preprint2010arXiv

Simulation of Electronic Structure Hamiltonians Using Quantum Computers

Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient methods for the exact simulation of quantum systems on classical computers presents a limitation of current computational approaches. We report, in detail, how a set of pre-computed molecular integrals can be used to explicitly create a quantum circuit, i.e. a sequence of elementary quantum operations, that, when run on a quantum computer, to obtain the energy of a molecular system with fixed nuclear geometry using the quantum phase estimation algorithm. We extend several known results related to this idea and discuss the adiabatic state preparation procedure for preparing the input states used in the algorithm. With current and near future quantum devices in mind, we provide a complete example using the hydrogen molecule, of how a chemical Hamiltonian can be simulated using a quantum computer.

preprint2010arXiv

Time-Dependent Density Functional Theory of Open Quantum Systems in the Linear-Response Regime

Time-Dependent Density Functional Theory (TDDFT) has recently been extended to describe many-body open quantum systems (OQS) evolving under non-unitary dynamics according to a quantum master equation. In the master equation approach, electronic excitation spectra are broadened and shifted due to relaxation and dephasing of the electronic degrees of freedom by the surrounding environment. In this paper, we develop a formulation of TDDFT linear-response theory (LR-TDDFT) for many-body electronic systems evolving under a master equation, yielding broadened excitation spectra. This is done by mapping an interacting open quantum system onto a non-interacting open Kohn-Sham system yielding the correct non-equilibrium density evolution. A pseudo-eigenvalue equation analogous to the Casida equations of usual LR-TDDFT is derived for the Redfield master equation, yielding complex energies and Lamb shifts. As a simple demonstration, we calculate the spectrum of a C$^{2+}$ atom in an optical resonator interacting with a bath of photons. The performance of an adiabatic exchange-correlation kernel is analyzed and a first-order frequency-dependent correction to the bare Kohn-Sham linewidth based on Gorling-Levy perturbation theory is calculated.

preprint2009arXiv

Linear Assignment Maps for Correlated System-Environment States

An assignment map is a mathematical operator that describes initial system-environment states for open quantum systems. We reexamine the notion of assignments, introduced by Pechukas, and show the conditions assignments can account for correlations between the system and the environment, concluding that assignment maps can be made linear at the expense of positivity or consistency is more reasonable. We study the role of other conditions, such as consistency and positivity of the map, and show the effects of relaxing these. Finally, we establish a connection between the violation of positivity of linear assignments and the no-broadcasting theorem.

preprint2009arXiv

Quantum Algorithm for Molecular Properties and Geometry Optimization

It is known that quantum computers, if available, would allow an exponential decrease in the computational cost of quantum simulations. We extend this result to show that the computation of molecular properties (energy derivatives) could also be sped up using quantum computers. We provide a quantum algorithm for the numerical evaluation of molecular properties, whose time cost is a constant multiple of the time needed to compute the molecular energy, regardless of the size of the system. Molecular properties computed with the proposed approach could also be used for the optimization of molecular geometries or other properties. For that purpose, we discuss the benefits of quantum techniques for Newton's method and Householder methods. Finally, global minima for the proposed optimizations can be found using the quantum basin hopper algorithm, which offers an additional quadratic reduction in cost over classical multi-start techniques.

preprint2009arXiv

Quantum stochastic walks: A generalization of classical random walks and quantum walks

We introduce the quantum stochastic walk (QSW), which determines the evolution of generalized quantum mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all possible quantum, classical and quantum-stochastic transitions from a vertex as defined by its connectivity. We show how the family of possible QSWs encompasses both the classical random walk (CRW) and the quantum walk (QW) as special cases, but also includes more general probability distributions. As an example, we study the QSW on a line, the QW to CRW transition and transitions to genearlized QSWs that go beyond the CRW and QW. QSWs provide a new framework to the study of quantum algorithms as well as of quantum walks with environmental effects.

preprint2009arXiv

Time-Dependent Density Functional Theory for Open Quantum Systems with Unitary Propagation

We extend the Runge-Gross theorem for a very general class of Markovian and non-Markovian open quantum systems under weak assumptions about the nature of the bath and its coupling to the system. We show that for Kohn-Sham (KS) Time-Dependent Density Functional Theory, it is possible to rigorously include the effects of the environment within a bath functional in the KS potential, thus placing the interactions between the particles of the system and the coupling to the environment on the same footing. A Markovian bath functional inspired by the theory of nonlinear Schrodinger equations is suggested, which can be readily implemented in currently existing real-time codes. Finally, calculations on a helium model system are presented.

preprint2009arXiv

Towards Quantum Chemistry on a Quantum Computer

The fundamental problem faced in quantum chemistry is the calculation of molecular properties, which are of practical importance in fields ranging from materials science to biochemistry. Within chemical precision, the total energy of a molecule as well as most other properties, can be calculated by solving the Schrodinger equation. However, the computational resources required to obtain exact solutions on a conventional computer generally increase exponentially with the number of atoms involved. This renders such calculations intractable for all but the smallest of systems. Recently, an efficient algorithm has been proposed enabling a quantum computer to overcome this problem by achieving only a polynomial resource scaling with system size. Such a tool would therefore provide an extremely powerful tool for new science and technology. Here we present a photonic implementation for the smallest problem: obtaining the energies of H2, the hydrogen molecule in a minimal basis. We perform a key algorithmic step - the iterative phase estimation algorithm - in full, achieving a high level of precision and robustness to error. We implement other algorithmic steps with assistance from a classical computer and explain how this non-scalable approach could be avoided. Finally, we provide new theoretical results which lay the foundations for the next generation of simulation experiments using quantum computers. We have made early experimental progress towards the long-term goal of exploiting quantum information to speed up quantum chemistry calculations.