journal article·2024-12-01Open access

Chemical reaction simulator on quantum computers by first quantization—Basic treatment: Theoretical

Tatsuya Tomaru, Hideo Takahashi, Toshiyuki Hirano, Saisei Tahara, Fumitoshi Sato

AIP Advances· Volume 14· Issue 12

Abstract

Quantum computers can potentially simulate quantum-mechanical phenomena, so chemical reactions are a potential application of them. In particular, the time evolution of the wavefunctions should be simulated because chemical reactions are accompanied by structural changes. In this study, to pave the way to achieving such wavefunction simulations, we decompose chemical reactions into their main parts and comprehensively show the minimum essential circuits for simulating each part. An antisymmetrized initial state is constructed using ancillae. Chemical reactions should be simulated in two different ways, where the difference is whether the ancillae are released or not. When they are released, the whole electronic system is simulated. When they are not released, orbital information is obtained. These ways are hence complementary.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Center for Exploratory Research, Research and Development Group, Hitachi, Ltd. 1 , Kokubunji, Tokyo 185-8601,

Department of Mechanical Engineering, School of Engineering, The University of Tokyo 2 , 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656,

Institute of Industrial Science, The University of Tokyo 3 , 4-6-1 Komaba Meguro-ku, Tokyo 153-8505,

References (83)

Show source-provided references
1. Simulating physics with computers10.1007/bf02650179 ↗
2. S. Wiesner , “Simulations of many-body quantum systems by a quantum computer,” arXiv:9603028 [quant-ph] (1996).
3. Efficient simulation of quantum systems by quantum computers10.1002/(sici)1521-3978(199811)46:6/8<877::aid-prop877>3.0.co;2-a ↗
4. Simulating quantum systems on a quantum computer10.1098/rspa.1998.0162 ↗
5. Quantum simulation of the single-particle Schrödinger equation10.1119/1.2894532 ↗
6. Polynomial-time quantum algorithm for the simulation of chemical dynamics10.1073/pnas.0808245105 ↗
7. Preparation of many-body states for quantum simulation10.1063/1.3115177 ↗
8. Bounding the costs of quantum simulation of many-body physics in real space10.1088/1751-8121/aa77b8 ↗
9. Nonadiabatic molecular quantum dynamics with quantum computers10.1103/physrevlett.125.260511 ↗
10. Grid-based methods for chemistry simulations on a quantum computer10.1126/sciadv.abo7484 ↗
11. Simulation of many-body Fermi systems on a universal quantum computer10.1103/physrevlett.79.2586 ↗
12. Improved techniques for preparing eigenstates of fermionic Hamiltonians10.1038/s41534-018-0071-5 ↗
13. The Bravyi-Kitaev transformation for quantum computation of electronic structure10.1063/1.4768229 ↗
14. The Bravyi-Kitaev transformation: Properties and applications10.1002/qua.24969 ↗
15. Hartree-Fock on a superconducting qubit quantum computer10.1126/science.abb9811 ↗
16. Quantum optimization using variational algorithms on near-term quantum devices10.1088/2058-9565/aab822 ↗
17. Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets10.1038/nature23879 ↗
18. Scalable quantum simulation of molecular energies10.1103/physrevx.6.031007 ↗
19. Low-depth quantum simulation of materials10.1103/physrevx.8.011044 ↗
20. Quantum computational chemistry10.1103/revmodphys.92.015003 ↗
21. B. Toloui and P. J.Love, “Quantum algorithms for quantum chemistry based on the sparsity of the CI-matrix,” arXiv:1312.2579 (2013).
22. A variational eigenvalue solver on a photonic quantum processor10.1038/ncomms5213 ↗
23. Variational quantum algorithms10.1038/s42254-021-00348-9 ↗
24. Quantum computing in the NISQ era and beyond10.22331/q-2018-08-06-79 ↗
25. Hybrid quantum-classical algorithms and quantum error mitigation10.7566/jpsj.90.032001 ↗
26. Quantum error mitigation10.1103/revmodphys.95.045005 ↗
27. 2000
28. Quantum measurements and the Abelian stabilizer problem
29. Quantum algorithms revisited10.1098/rspa.1998.0164 ↗
30. Simulated quantum computation of molecular energies10.1126/science.1113479 ↗
31. Chemical reaction simulator on quantum computers by first quantization (II)—Basic treatment: Implementation10.1021/acs.jctc.4c00708 ↗
32. Quantum algorithms for quantum chemistry and quantum materials science10.1021/acs.chemrev.9b00829 ↗
33. Quantum amplitude amplification and estimation10.1090/conm/305/05215 ↗
34. Exponential improvement in precision for simulating sparse Hamiltonians
35. R. Kothari , “Efficient algorithms in quantum query complexity,” Ph.D. thesis, University of Waterloo, Canada, 2014.
36. Encoding electronic spectra in quantum circuits with linear T complexity10.1103/physrevx.8.041015 ↗
37. Quantum mechanics helps in searching for a needle in a haystack10.1103/physrevlett.79.325 ↗
38. Quantum random access memory10.1103/physrevlett.100.160501 ↗
39. Architectures for a quantum random access memory10.1103/physreva.78.052310 ↗
40. Resilience of quantum random access memory to generic noise10.1103/prxquantum.2.020311 ↗
41. Systems architecture for quantum random access memory
42. Trading T gates for dirty qubits in state preparation and unitary synthesis10.22331/q-2024-06-17-1375 ↗
43. Quantum algorithm for approximating partition functions10.1103/physreva.80.022340 ↗
44. Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer10.1103/physrevlett.103.220502 ↗
45. Quantum algorithm for preparing thermal Gibbs states
46. Finding exponential product formulas of higher orders10.1007/11526216_2 ↗
47. Simulating Hamiltonian dynamics with a truncated Taylor series10.1103/physrevlett.114.090502 ↗
48. G. H. Low and N.Wiebe, “Hamiltonian simulation in the interaction picture,” arXiv:1805.00675 (2018).
49. Quantum simulation of chemistry with sublinear scaling in basis size10.1038/s41534-019-0199-y ↗
50. Quantum computation of stopping power for inertial fusion target design10.1073/pnas.2317772121 ↗
51. Compilation of fault-tolerant quantum heuristics for combinatorial optimization10.1103/prxquantum.1.020312 ↗
52. L. Grover and T.Rudolph, “Creating superpositions that correspond to efficiently integrable probability distributions,” arXiv:0208112 [quant-ph] (2002).
53. Universal quantum simulators10.1126/science.273.5278.1073 ↗
54. Quantum networks for elementary arithmetic operations10.1103/physreva.54.147 ↗
55. Circuit for Shor’s algorithm using 2n+3 qubits10.26421/qic3.2-8 ↗
56. T. G. Draper , “Addition on a quantum computer,” arXiv:0008033 [quant-ph] (2000).
57. S. A. Cuccaro , T. G.Draper, S. A.Kutin, and D. P.Moulton, “A new quantum ripple-carry addition circuit,” arXiv:0410184 [quant-ph] (2004).
58. A logarithmic-depth quantum carry-lookahead adder10.26421/qic6.4-5-4 ↗
59. Quantum arithmetic circuits: A survey10.1587/transfun.e92.a.1276 ↗
60. Halving the cost of quantum addition10.22331/q-2018-06-18-74 ↗
61. G. Florio and D.Picca, “Quantum implementation of elementary arithmetic operations,” arXiv:0403048 [quant-ph] (2004).
62. Optimized reversible multiplier circuit10.1142/s0218126609005083 ↗
63. Novel design of a fast reversible Wallace sign multiplier circuit in nanotechnology10.1016/j.mejo.2011.05.007 ↗
64. 2013 · 37
65. QLib: Quantum module library10.1145/2629430 ↗
66. 2014 · 545
67. Ancilla-input and garbage-output optimized design of a reversible quantum integer multiplier10.1007/s11227-016-1676-0 ↗
68. Quantum arithmetic with the quantum Fourier transform10.1007/s11128-017-1603-1 ↗
69. Design of parity-preserving reversible logic signed array multipliers10.5281/zenodo.1131179 ↗
70. Cost-efficient design of a quantum multiplier–accumulator unit10.1007/s11128-016-1455-0 ↗
71. Quantum circuit design of a T-count optimized integer multiplier10.1109/tc.2018.2882774 ↗
72. Quantum division circuit based on restoring division algorithm
73. Quantum circuit designs of integer division optimizing T-count and T-depth
74. Quantum circuit designs of integer division optimizing T-count and T-depth10.1109/tetc.2019.2910870 ↗
75. T-count optimized quantum circuit designs for single-precision floating-point division10.3390/electronics10060703 ↗
76. Efficient floating-point division quantum circuit using Newton-Raphson division10.1088/1742-6596/2335/1/012058 ↗
77. S. Wang , E.Lim, and A.Chattopadhyay, “Boosting the efficiency of quantum divider through effective design space exploration,” arXiv:2403.01206 (2024).10.1109/ISCAS58744.2024.10557991 ↗
78. An efficient design technique of a quantum divider circuit
79. A novel fault-tolerant quantum divider and its simulation10.1007/s11128-022-03523-8 ↗
80. Reversible implementation of square-root circuit
81. T-Count and qubit optimized quantum circuit design of the non-restoring square root algorithm10.1145/3264816 ↗
82. Efficient quantum circuits for square-root and inverse square-root
83. A novel and efficient square root computation quantum circuit for floating-point standard10.1007/s10773-022-05222-7 ↗