Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914281745809408 |
|---|---|
| author | Schleich, Philipp Kristensen, Lasse Bjørn Angulo, Jorge A. Campos Gonzalez Avagliano, Davide Bagherimehrab, Mohsen Aldossary, Abdulrahman Gorgulla, Christoph Fitzsimons, Joe Aspuru-Guzik, Alán |
| author_facet | Schleich, Philipp Kristensen, Lasse Bjørn Angulo, Jorge A. Campos Gonzalez Avagliano, Davide Bagherimehrab, Mohsen Aldossary, Abdulrahman Gorgulla, Christoph Fitzsimons, Joe Aspuru-Guzik, Alán |
| contents | Simulating chemical systems is highly sought after and computationally challenging, as the number of degrees of freedom increases exponentially with the size of the system. Quantum computers have been proposed as a computational means to overcome this bottleneck , thanks to their capability of representing this amount of information efficiently. Most efforts so far have been centered around determining the ground states of chemical systems. However, hardness results and the lack of theoretical guarantees for efficient heuristics for initial-state generation shed doubt on the feasibility. Here, we propose a heuristically guided approach that is based on inherently efficient routines to solve chemical simulation problems, requiring quantum circuits of size scaling polynomially in relevant system parameters. If a set of assumptions can be satisfied, our approach finds good initial states for dynamics simulation by assembling them in a scattering tree. In particular, we investigate a scattering-based state preparation approach within the context of mergo-association. We discuss a variety of quantities of chemical interest that can be measured after the quantum simulation of a process, e.g., a reaction, following its corresponding initial state preparation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_09268 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer Schleich, Philipp Kristensen, Lasse Bjørn Angulo, Jorge A. Campos Gonzalez Avagliano, Davide Bagherimehrab, Mohsen Aldossary, Abdulrahman Gorgulla, Christoph Fitzsimons, Joe Aspuru-Guzik, Alán Quantum Physics Computational Complexity Chemical Physics Simulating chemical systems is highly sought after and computationally challenging, as the number of degrees of freedom increases exponentially with the size of the system. Quantum computers have been proposed as a computational means to overcome this bottleneck , thanks to their capability of representing this amount of information efficiently. Most efforts so far have been centered around determining the ground states of chemical systems. However, hardness results and the lack of theoretical guarantees for efficient heuristics for initial-state generation shed doubt on the feasibility. Here, we propose a heuristically guided approach that is based on inherently efficient routines to solve chemical simulation problems, requiring quantum circuits of size scaling polynomially in relevant system parameters. If a set of assumptions can be satisfied, our approach finds good initial states for dynamics simulation by assembling them in a scattering tree. In particular, we investigate a scattering-based state preparation approach within the context of mergo-association. We discuss a variety of quantities of chemical interest that can be measured after the quantum simulation of a process, e.g., a reaction, following its corresponding initial state preparation. |
| title | Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer |
| topic | Quantum Physics Computational Complexity Chemical Physics |
| url | https://arxiv.org/abs/2401.09268 |