Granted Patent
B2
US 12,718,129 · App. 17/686,068 · Granted Aug 25, 2026
Classically-boosted variational quantum eigensolver
View Patent ↗
Loading inventors, assignments & file history…
Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST
Recorded May 12, 2022
From: RADIN, MAXWELL D.; JOHNSON, PETER DOUGLAS
To: ZAPATA COMPUTING, INC.
Reel/Frame 060050/0471 →
Continuity (3)
Provisional Application
63197819
· Jun 7, 2021
Provisional Application
63157069
· Mar 5, 2021
References Cited (352)
US 7353148B1
· Meyers
· 2008
[cited by applicant]
US 20070239366A1
· Hilton
· 2007
[cited by applicant]
US 20160004972A1
· Alboszta et al.
· 2016
[cited by applicant]
US 20180232649A1
· Wiebe
· 2018
[cited by applicant]
US 20180246851A1
· Zaribafiyan
· 2018
[cited by applicant]
US 20210232963A1
· Gimeno-Segovia et al.
· 2021
[cited by applicant]
US 20210271731A1
· Stobinska et al.
· 2021
[cited by applicant]
US 20220292385A1
· Sauvage
· 2022
[cited by applicant]
US 20220335325A1
· Dallaire-Demers
· 2022
[cited by applicant]
US 20230081927A1
· Zhang
· 2023
[cited by applicant]
CA 3151055C
· 2022
[cited by applicant]
CA 3133917C
· 2023
[cited by applicant]
CN 114223003A
· 2022
[cited by applicant]
EP 3983961A1
· 2022
[cited by applicant]
EP 4022530A1
· 2022
[cited by applicant]
EP 4026066A1
· 2022
[cited by applicant]
EP 4042338A1
· 2022
[cited by applicant]
EP 4052194A0
· 2022
[cited by applicant]
EP 4154193A1
· 2023
[cited by applicant]
JP 7223174B2
· 2023
[cited by applicant]
KR 20160132943A
· 2016
[cited by applicant]
TW 201723935A
· 2017
[cited by applicant]
TW 764348B
· 2022
[cited by applicant]
WO 2015069625A1
· 2015
[cited by applicant]
WO 2017001404A1
· 2017
[cited by applicant]
WO 2017027185A1
· 2017
[cited by applicant]
WO 2018064535A1
· 2018
[cited by applicant]
WO 2018212789A1
· 2018
[cited by applicant]
WO 2019050555A1
· 2019
[cited by applicant]
WO 2019055843A1
· 2019
[cited by applicant]
WO 2019104443A1
· 2019
[cited by applicant]
WO 2019126644A1
· 2019
[cited by applicant]
WO 2019150090A1
· 2019
[cited by applicant]
WO 2019220122A1
· 2019
[cited by applicant]
WO 2020146794A1
· 2020
[cited by applicant]
WO 2020168158A1
· 2020
[cited by applicant]
WO 2020214910A1
· 2020
[cited by applicant]
WO 2021087206A1
· 2021
[cited by applicant]
WO 2022087143A1
· 2022
[cited by applicant]
WO 2022187503A1
· 2022
[cited by applicant]
WO 2022192525A1
· 2022
[cited by applicant]
WO 2023043996A1
· 2023
[cited by applicant]
Zhang, et al., Collective Optimization for Variational Quantum Eigensolvers, arXiv:1910.14030v1 [quant-ph], Oct. 30, 2019, pp. 1-9 ( Year: 2019).
[cited by examiner]
Dumitrescu, E., et al., “Tensor Network Benchmarking for Quantum Computing”, Beyond CMOS Computing Workshop: The Interconnect Challenge, Session 1, Talk 4, pp. 1-25 (2017).
[cited by applicant]
Eddins, A., et al., “Doubling the Size of Quantum Simulators by Entanglement Forging,” Quantum Physics, arXiv:2104.10220, pp. 1-17 (Apr. 20, 2021).
[cited by applicant]
Endo, S., et al., “Variational quantum algorithms for discovering Hamiltonian spectra”, Physical Review A, arXiv preprint arXiv:1806.05707, pp. 1-9 (2018).
[cited by applicant]
Essler, F. H. L., et al., “The one-dimensional Hubbard model”, Cambridge University Press, pp. 1-753. (Dec. 11, 2003).
[cited by applicant]
Esslinger, T., “Fermi-Hubbard physics with atoms in an optical lattice”, arXiv: 1007.0012v1, pp. 1-29 (Jun. 30, 2010).
[cited by applicant]
Examination Report mailed Dec. 22, 2021, in Canadian patent application No. 3,133,917, 5 pages.
[cited by applicant]
Farhi, E., et al., “A quantum approximate optimization algorithm”, Quantum Physics, arXiv:1411.4028v1, pp. 1-16 (Nov. 14, 2014).
[cited by applicant]
Fedorov, A., et al., “Implementation of a Toffoli Gate with Superconducting Circuits”, arXiv: 1108.3966v1, pp. 1-5 (Aug. 19, 2011).
[cited by applicant]
Ferrie, C., et al., “How to Best Sample a Periodic Probability Distribution, or on the Accuracy of Hamiltonian Finding Strategies”, Quantum Information Processing, arXiv:1110.3067v1, pp. 1-8 (Oct. 13, 2011).
[cited by applicant]
Figgat, C., et al., “Complete 3-Qubit Grover search on a programmable quantum computer”, Nature Communications, vol. 8, Article No. 1918, pp. 1-9 (2017).
[cited by applicant]
Finn, C., and Levine, S., “Meta-learning and universality: Deep representations and gradient descent can approximate any learning algorithm,” arXiv: 1710.11622, pp. 1-20 (Feb. 14, 2018).
[cited by applicant]
First Office Action mailed May 14, 2021, in Taiwan patent application No. 109139876, 9 pages (English translation Included).
[cited by applicant]
First Office Action mailed Oct. 8, 2021, in Taiwan patent application No. 109137856, 5 pages.
[cited by applicant]
Garcia-Saez, A., et al., “Addressing Hard Classical Problems with Adiabatically Assisted Variational Quantum Eigensolvers”, Quantum Physics, arXiv preprint arXiv:1806.02287, pp. 1-7 (2018).
[cited by applicant]
Ge, Y., et al., “Faster Ground State Preparation and High-Precision Ground Energy Estimation with Fewer Qubits,” Journal of Mathematical Physics, vol. 60, No. 2,: arXiv:1712.03193, 1-25 (Feb. 2, 2018).
[cited by applicant]
Gentini, L., et al., “Noise-Assisted Variational Hybrid Quantum-Classical Optimization”, arXiv:1912.06744, pp. 1-8 (Dec. 13, 2019).
[cited by applicant]
Ghamami, S., and Zhang, B., et al., “Efficient Monte Carlo Counterparty Credit Risk Pricing and Measurement”, Journal of Credit Risk, vol. 10, No. 3, pp. 1-42 (Jul. 23, 2014).
[cited by applicant]
Gharibian, S., et al., “Oracle Complexity Classes and Local Measurements on Physical Hamiltonians,” In 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Schloss Dagstuhl-Leibniz-Zentr…
[cited by applicant]
Gharibian, S., et al., “The complexity of simulating local measurements on quantum systems,” Quantum, 3:189, 2019. arXiv:1606.05626, pp. 1-38 (Apr. 7, 2020).
[cited by applicant]
Gilyén, A., et al., “Quantum Singular Value Transformation and Beyond: Exponential Improvements for Quantum Matrix Arithmetics,” In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 193-204…
[cited by applicant]
Goemans, M.X., et al., “Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming”, Journal of the Acm (Jacm), vol. 42, No. 6, pp. 1115-1145 (Nov. 1995).
[cited by applicant]
Gokhale, P., and Chong, F.T., “O(N3) Measurement Cost for Variational Quantum Eigensolver on Molecular Hamiltonians”, arXiv: 1908.11857v1, pp. 1-5 (Aug. 30, 2019).
[cited by applicant]
Gokhale, P., et al., “Minimizing state preparations in variational quantum eigensolver by partitioning into commuting families”, Quantum Physics, arXiv:1907.13623v1, pp. 1-23 (Jul. 31, 2019).
[cited by applicant]
Gonthier, J., et al., “Identifying challenges towards practical quantum advantage through resource estimation: the measurement roadblock in the variational quantum eigensolver,” Quantum Physics, arXiv:2012.04001, pp. 1-…
[cited by applicant]
Grant, E., et al., “An initialization strategy for addressing barren plateaus in parametrized quantum circuits,” Quantum 3, 214, pp. 1-9 (Nov. 28, 2019).
[cited by applicant]
Grimsley, H.R., et al., “An adaptive variational algorithm for exact molecular simulations on a quantum computer,” Nature Communications 10, 3007, pp. 1-9 (2019).
[cited by applicant]
Grover, L.K., “A fast quantum mechanical algorithm for database search,” arXiv preprint quant-ph/9605043, pp. 1-8 (May 1996).
[cited by applicant]
Grover, L.K., “A fast quantum mechanical algorithm for database search”, STOC '96: Proceedings of the twenty- eighth annual ACM symposium on Theory of Computing, pp. 1-8 (Jul. 1996).
[cited by applicant]
Handy, N.C., et al., “Size-consistent Brueckner theory limited to double substitutions”, Chemical Physics Letters, vol. 164, No. 2-3, pp. 185-192 (Dec. 8, 1989).
[cited by applicant]
Harrow, A. W., et al., “Quantum algorithm for linear systems of equations”, Phys. Rev. Lett., vol. 103, No. 15, 1-15 (2009).
[cited by applicant]
He, M., et al., “Quantum Gaussian filter for exploring ground-state properties,” arXiv preprint arXiv:2112.06026, pp. 1-7 (Dec. 11, 2021).
[cited by applicant]
Helgaker T. et al., “Molecular Electronic-Structure Theory”, Book published by John Wiley & Sons, pp. 1-908 (2000).
[cited by applicant]
Heya, K., et al., “Variational Quantum Gate Optimization”, Quantum Physics, arXiv:1810.12745v1, pp. 1-10 (Oct. 30, 2018).
[cited by applicant]
Higgott, O., et al., “Variational Quantum Computation of Excited States,” Quantum, vol. 3, pp. 1-11 (Jun. 28, 2019).
[cited by applicant]
Hospedales. T., et al., “Meta-Learning in Neural Networks: A Survey,” arXiv e-prints , arXiv:2004.05439, pp. 1-20 (Nov. 7, 2020).
[cited by applicant]
Hoyer, P., et al., “On Arbitrary Phases in Quantum Amplitude Amplification”, arXiv:quant-ph/0006031v1, pp. 1-6 (Jun. 7, 2000).
[cited by applicant]
Huang, H., et al., “Near-term quantum algorithms for linear systems of equations,” arXiv preprint arXiv: 1909.07344, pp. 1-22 (Dec. 16, 2019).
[cited by applicant]
Huggins, W. J., et al., “Efficient and noise resilient measurements for quantum chemistry on near-term quantum computers”, Quantum Physics, arXiv:1907.13117v3, pp. 1-10 (Sep. 23, 2019).
[cited by applicant]
International Search Report & Written Opinion mailed Dec. 11, 2020, in international patent application No. PCT/US2020/049605, 14 pages.
[cited by applicant]
International Search Report & Written Opinion mailed Feb. 18, 2021, in international patent application No. PCT/US2020/058119, 7 pages.
[cited by applicant]
International Search Report & Written Opinion mailed Jan. 5, 2021, in international patent application No. PCT/US2020/052958, 7 pages.
[cited by applicant]
International Search Report & Written Opinion mailed Jul. 27, 2020, in international patent application No. PCT/US2020/028670, 7 pages.
[cited by applicant]
International Search Report & Written Opinion mailed May 11, 2020, in International Patent Application No. PCT/US2020/013181, 11 pages.
[cited by applicant]
International Search Report & Written Opinion mailed Nov. 6, 2020, in international patent application No. PCT/US2020/044615, 8 pages.
[cited by applicant]
International Search Report & Written Opinion mailed Sep. 6, 2021, in international patent application PCT/US2021/033089, 8 pages.
[cited by applicant]
International Search Report and Written Opinion mailed Dec. 6, 2019 in PCT International Patent Application No. PCT/US2019/046895, 9 pages.
[cited by applicant]
International Search Report and Written Opinion mailed Feb. 4, 2022, in International Patent Application No. PCT/US2021/055867, 6 pages.
[cited by applicant]
International Search Report and Written Opinion mailed Mar. 15, 2021, in International Patent Application No. PCT/US2020/061631, 7 pages.
[cited by applicant]
International Search Report and Written Opinion mailed Sep. 21, 2020, in international patent application No. PCT/US2020/037655, pp. 1-8.
[cited by applicant]
Izmaylov, A. F., et al., “Unitary Partitioning Approach to the Measurement Problem in the Variational Quantum Eigensolver Method”, Quantum Physics, arXiv: 1907.09040v2, pp. 1-7 (Oct. 18, 2019).
[cited by applicant]
Albash, T., et al., “Adiabatic quantum computation,” Rev. Mod. Phys. 90, 015002, pp. 1-71 (2018).
[cited by applicant]
Amaro, D., et al., “Filtering variational quantum algorithms for combinatorial optimization,” arXiv preprint arXiv:2106.10055, pp. 1-14 (Feb. 10, 2022).
[cited by applicant]
Ambainis, A., “On physical problems that are slightly more difficult than QMA,” In 2014 IEEE 29th Conference on Computational Complexity (CCC), pp. 1-12 (2014).
[cited by applicant]
Andersen, C.K., et al., “Entanglement Stabilization using Parity Detection and Real-Time Feedback in Superconducting Circuits”, arXiv:1902.06946v2, pp. 1-12 (Feb. 20, 2019).
[cited by applicant]
Arute, F., et al., “Quantum supremacy using a programmable superconducting processor”, Nature, vol. 574, pp. 505-510 (Oct. 23, 2019).
[cited by applicant]
Aspuru-Guzik, A., et al., “Simulated Quantum Computation of Molecular Energies”, Science, Quantum Physics, vol. 309, No. 5741, pp. 1-21 (Sep. 9, 2005).
[cited by applicant]
Atia, Y., and Aharonov, D., “Fast-Forwarding of Hamiltonians and Exponentially Precise Measurements,” Nature communications, vol. 8, No. 1, pp. 1-9 (Nov. 17, 2017).
[cited by applicant]
Babbush, R., et al., “Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity,” Physical Review X, vol. 8, No. 4, 041015, pp. 1-39 (Sep. 19, 2018).
[cited by applicant]
Bach, V., et al., “Generalized Hartree-Fock Theory and the Hubbard Model”, Journal of Statistical Physics, vol. 76 (1-2):3-89, pp. 1-68 (Nov. 25, 1993).
[cited by applicant]
Baekkegaard, T., et al., “Realization of efficient quantum gates with a superconducting qubit-qutrit circuit”, Scientific Reports, vol. 9, Article No. 13389, pp. 1-10 (Sep. 16, 2019).
[cited by applicant]
Baker, J.M., et al., “Decomposing Quantum Generalized Toffoli with an Arbitrary Number of Ancilla”, arXiv: 1904.01671v1, pp. 1-10 (Apr. 2, 2019).
[cited by applicant]
Balu, R., and Borle, A., “Bayesian Networks based Hybrid Quantum-Classical Machine Learning Approach to Elucidate Gene Regulatory Pathways”, arXiv:1901.10557v1, pp. 1-9 (Jan. 23, 2019).
[cited by applicant]
Bao, N., et al., “Universal Quantum Computation by Scattering in the Fermi-Hubbard model”, arXiv: 1409.3585v2, pp. 1-9 (Sep. 15, 2014).
[cited by applicant]
Barenco, A., et al., “Elementary Gates for Quantum Computation”, Physical review A, vol. 52, Issue No. 5, pp. 1-31 (Mar. 23, 1995).
[cited by applicant]
Barenco, A., et al., “Elementary Gates for Quantum Computation”, arXiv:quant-ph/9503016v1, Mar. 23, 1995, pp. 1-31.
[cited by applicant]
Barkoutsos, P. K., et al., “Quantum Algorithms for Electronic Structure Calculations: Particle-Hole Hamiltonian and Optimized Wave-Function Expansions,” Phys. Rev. A 98, 022322, pp. 1-14 (May 11, 2018).
[cited by applicant]
Bedürftig, G., and Frahm, H., “Spectrum of boundary states in the open Hubbard chain”, arXiv:cond-mat.9702227v1, pp. 1-14 (Feb. 26, 1997).
[cited by applicant]
Benedetti, M., et al., “A generative modeling approach for benchmarking and training shallow quantum circuits”, arXiv preprint arXiv: 1801.07686v4, pp. 1-16 (Jun. 2, 2019).
[cited by applicant]
Bergholm, V., et al., “Pennylane: Automatic differentiation of hybrid quantum-classical computations,” arXiv preprint arXiv: 1811.04968, pp. 1-15 (Feb. 14, 2020).
[cited by applicant]
Bishop, L., et al., “Quantum Volume”, Technical report, IBM T.J. Watson, pp. 1-5 (Mar. 4, 2017).
[cited by applicant]
Bogoljubov, N.N., “A New Method in the Theory of Superconductivity”, Soviet Physics JETP, vol. 34, No. 7, pp. 41-46 (Jul. 1958).
[cited by applicant]
Bonet-Monroig, “Comparison of Error itigation Strategies in a Hydrogen Molecule Quantum Simulation”, Master hesis. Leiden University, pp. 1-52 (May 29, 2018).
[cited by applicant]
Bonet-Monroig, X., et al., “Nearly optimal measurement scheduling for partial tomography of quantum states”, Quantum Physics, arXiv:1908.05628v2, pp. 1-9 (Sep. 6, 2019).
[cited by applicant]
Bonet-Monroig, X., et al., “Performance comparison of optimization methods on variational quantum algorithms,” arXiv preprint arXiv:2111.13454, pp. 1-12 (Dec. 14, 2021).
[cited by applicant]
Bookatz, A. D., et al., “Error Suppression in Hamiltonian Based Quantum Computation Using Energy Penalties”, arXiv:1407.1485v1, pp. 1-26 (Jul. 6, 2014).
[cited by applicant]
Brandao, F.G., et al., “For fixed control parameters the quantum approximate optimization algorithm's objective function value concentrates for typical instances,” arXiv preprint arXiv:1812.04170, pp. 1-16 (2018).
[cited by applicant]
Brassard, G., et al., “Quantum Amplitude Amplification and Estimation”, arXiv:quant-ph/0005055v1, pp. 1-22 (May 15, 2000).
[cited by applicant]
Bravo-Prieto, C., et al., “Variational Quantum Linear Solver,” Quantum Physics, arXiv: 1909.05820, pp. 1-21 (Sep. 12, 2019).
[cited by applicant]
Bravyi, L. D., et al., “Fermionic Quantum Computation”, Annals of Physics, vol. 298, No. 1, pp. 210-226 (2002).
[cited by applicant]
Bravyi, S., “Lagrangian Representation for Fermionic Linear Optics”, arXiv:quant-ph/0404180v2, pp. 1-12 (Sep. 20, 2004).
[cited by applicant]
Broughton, M., et al., “Tensorflow quantum: A software framework for quantum machine learning,” arXiv preprint arXiv:2003.02989, pp. 1-56 (Aug. 26, 2021).
[cited by applicant]
Cao, Y., et al., “Implementation of a Toffoli gate using an array of coupled cavities in a single step”, Scientific Reports, vol. 8, Article No. 5813, pp. 1-10 (Apr. 11, 2018).
[cited by applicant]
Cao, Y., et al., “Potential of Quantum Computing for Drug Discovery,” IBM Journal of Research and Development, vol. 62, Issue 6, p. 6:1-6:20, (Dec. 2018).
[cited by applicant]
Cao, Y., et al., “Quantum Chemistry in the Age of Quantum Computing”, Quantum Physics, arXiv: 1812.09976v2, pp. 1-194 (Dec. 28, 2018).
[cited by applicant]
Cerezo, M., et al., “Cost function-dependent barren plateaus in shallow quantum neural networks,” arXiv preprint arXiv:2001.00550, pp. 1-39 (Mar. 20, 2021).
[cited by applicant]
Cervera-Lierta, A., et al., “The meta-variational quantum eigensolver (meta-vqe): Learning energy profiles of parameterized hamiltonians for quantum simulation,” arXiv:2009.13545, pp. 1-11 (May 28, 2021).
[cited by applicant]
Chakraborty, S., et al., “The Power of Blockencoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation,” arXiv preprint arXiv:1804.01973, pp. 1-58 (Sep. 3, 2018).
[cited by applicant]
Childs, A. M. et al., “Hamiltonian simulation using linear combinations of unitary operations”, Quantum Information and Computation, vol. 12, pp. 901-924 (2012).
[cited by applicant]
Childs, A. M., et al., “Quantum algorithm for systems of linear equations with exponentially improved dependence on precision”, arXiv:1511.02306v2, pp. 1-31 (2017).
[cited by applicant]
Chiles, R.A., et al., “An electron pair operator approach to coupled cluster wave functions. application to He2, Be2, and Mg2 and comparison with CEPA methods”, The Journal of Chemical Physics, vol. 74, No. 8, pp. 4544-…
[cited by applicant]
Colless, J.I., et al., “Computation of Molecular Spectra on a Quantum Processor with an Error-Resilient Algorithm”, Physical Review X, vol. 8, No. 1, pp. 011021-011027 (2018).
[cited by applicant]
Cramer, M., et al., “Efficient Quantum State Tomography”, Nature communications, 1(149), pp. 1-7 (Dec. 21, 2010).
[cited by applicant]
Crawford, O., et al., “Efficient quantum measurement of Pauli operators in the presence of finite sampling error”, Quantum Physics, arXiv:1908.06942v2, pp. 1-17 (Apr. 21, 2020).
[cited by applicant]
Crooks, G.E., “Performance of the quantum approximate optimization algorithm on the maximum cut problem,” arXiv preprint arXiv: 1811.08419, pp. 1-6 (2018).
[cited by applicant]
Dallaire-Demers, P.L., et al., “An application benchmark for fermionic quantum simulations”, arXiv:2003.01862v1, pp. 1-14 (Mar. 4, 2020).
[cited by applicant]
Dallaire-Demers, P.L., and Killoran, N., “Quantum generative adversarial networks”, arXiv:1804.08641v2, Phys. Rev. A, vol. 98, 012324, pp. 1-10 (Apr. 30, 2018).
[cited by applicant]
Dallaire-Demers, P.L., et al., “Low-depth circuit ansatz for preparing correlated fermionic states on a quantum computer”, Quantum Physics, arXiv:1801.01053v1 , pp. 1-15 (Jan. 3, 2018).
[cited by applicant]
Dallaire-Demers, P.L., et al., “Quantum Generative Adversarial Networks,” Physical Review A, vol. 98, No. 1, 6.012324, pp. 1-10 (Apr. 30, 2018).
[cited by applicant]
Dallaire-Demers, P.L., et al., “Quantum Generative Adversarial Networks”, Quantum Physics, Apr. 30, 2018, pp. 1-10.
[cited by applicant]
Decision of Grant mailed Jan. 20, 2022, in Taiwan patent application No. 109137856, 5 pages.
[cited by applicant]
Andersen, C.K., et al., “Entanglement stabilization using ancilla-based parity detection and real-time feedback in superconducting circuits,” npj Quantum Information, vol. 5, No. 1, pp. 1-7 pages. XP055810501, DOI: 10.1…
[cited by applicant]
Azad, U., and Singh, H., “Quantum Chemistry Calculations using Energy Derivatives on Quantum Computers,” arXiv:2106.06463v1. pp. 1-12 (Jun. 10, 2021) [retrieved on Jan. 3, 2023]. Retrieved from <URL: https://arxiv.org/p…
[cited by applicant]
Bækkegaard, T., et al., “Realization of efficient quantum gates with a superconducting qubit-qutrit circuit,” arXiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Feb. 12, 2018, 2…
[cited by applicant]
Cai, X., et al., “Quantum computation of molecular response properties,” Physical Review Research, pp. 1-7 (Aug. 27, 2020).
[cited by applicant]
Decision to Grant mailed Jan. 17, 2023, in Japanese patent application No. 2021-571623, 5 pages.
[cited by applicant]
Endo, S., et al., “Hybrid Quantum-Classical Algorithms and Quantum Error Mitigation,” Journal of the Physical Society of Japan 90, pp. 1-33 (Feb. 1, 2021).
[cited by applicant]
Extended European Search Report mailed Dec. 22, 2022, in European patent application No. 20890215.5, 10 pages.
[cited by applicant]
Extended European Search Report mailed Jan. 12, 2023, in European Patent Application No. 20882002.7, 10 pages.
[cited by applicant]
Extended European Search Report mailed Oct. 27, 2022, in European patent application No. 20868114.8, 10 pages.
[cited by applicant]
First Office Action mailed Dec. 29, 2022, in Canadian patent application No. 3,141,547, 4 pages.
[cited by applicant]
International Search Report and Written Opinion mailed Jan. 5, 2023, in international patent application No. PCT/US2022/043793, 8 pages.
[cited by applicant]
Jansen, K., and Hartung, T., “Zeta-regularized vacuum expectation values from quantum computing simulations,” arXiv: 1912.01276v1. pp 1-14. (Dec. 3, 2019) [retrieved on Jan. 3, 2023]. Retrieved from <URL: https://arxiv.…
[cited by applicant]
Liu, Z., et al., “Some ground-state expectation values for the free parafermion Z(N) spin chain,” arXiv:1905.08384v3. pp. 1-17 (Oct. 14, 2019) [retrieved on Jan. 3, 2023]. Retrieved from <URL: https://arxiv.org/pdf/1905…
[cited by applicant]
Mcardle, S., et al., “Quantum computational chemistry,” arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, pp. 1-59 XP081585393 (Aug. 30, 2018).
[cited by applicant]
Non-Final Office Action mailed Dec. 6, 2022, in U.S. Appl. No. 16/543,165 of Peter D. Johnson, filed Aug. 16, 2019, 23 pages.
[cited by applicant]
Non-Final Office Action mailed Dec. 8, 2022 for U.S. Appl. No. 16/740,177, of Maxwell D. Radin, filed Jan. 10, 2020, 85 pages.
[cited by applicant]
Notice of Allowance mailed Dec. 22, 2022, in U.S. Appl. No. 16/900,947 of Guoming Wang, filed Jun. 14, 2020, 32 pages.
[cited by applicant]
Notice of Allowance mailed Jan. 19, 2023, in Canadian patent application No. 3,133,917, 1 page.
[cited by applicant]
Notice of Allowance mailed Mar. 30, 2023, in Canadian patent application No. 3,155,085, 1 page.
[cited by applicant]
Pranav Gokhale et al., “Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines,” MICRO-52, Oct. 12-16, 2019, Columbus, OH, USA, 13 pages. XP 58476958A. Available online at <https://d…
[cited by applicant]
Ryan Babbush et al., “Low Depth Quantum Simulation of Electronic Structure,” Phys. Rev. X 8, 011044 (2018) 37 pages. Available online at <https://arxiv.org/pdf/1706.00023v2.pdf>.
[cited by applicant]
Second Office Action mailed Apr. 6, 2022, in Taiwan patent application No. 109139876, 3 pages (English translation included).
[cited by applicant]
Notice of Allowance mailed May 18, 2022, in Canadian patent application No. 3,151,055, 1 page.
[cited by applicant]
Official Action mailed Sep. 29, 2022, in Canadian patent application No. 3,157,270, 5 pages.
[cited by applicant]
Anirban Narayan Chowdhury et al., “Improved implementation of reflection operators”, researchgate.net, Mar. 6, 2018, 12 pages. Available online at https://www.researchgate.net/publication/323627065_Improved_implementati…
[cited by applicant]
Extended European Search Report mailed Sep. 20, 2022, in European patent application No. 20738886.9, 10 pages.
[cited by applicant]
A. Shabani et al., “Efficient measurement of quantum dynamics via compressive sensing,” arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Oct. 28, 2009, XP080374481, DOI: 10.11…
[cited by applicant]
M Mohseni et al., “Quantum Process Tomography: Resource Analysis of Different Strategies,” arxiv.org, Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, Feb. 13, 2007, XP080275525, DOI: 10…
[cited by applicant]
First Examination Report mailed Oct. 28, 2022, in Australian patent application No. 2020292425, 3 pages.
[cited by applicant]
Official Action mailed May 16, 2023, in Canadian patent application No. 3,157,270, 4 pages.
[cited by applicant]
Szabo, A. and Ostlund, N.S., “Modern quantum chemistry: introduction to advanced electronic structure theory,” Courier Corporation, 2012. pp . 1-479 (2012).
[cited by applicant]
Takeshita, T., et al., “Increasing the Representation Accuracy of Quantum Simulations of Chemistry without Extra Quantum Resources,” Phys. Rev. X, vol. 10, No. 1, pp. 1-9 (Jan. 7, 2020).
[cited by applicant]
Temme, K., et al., “Error Mitigation for Short-Depth Quantum Circuits”, Physical review letters, vol. 119, No. 18, 180509, pp. 1-15 (2017).
[cited by applicant]
Torlai, G., et al., “Neural-Network Quantum State Tomography”, Nature Physics, vol. 14, No. 5, pp. 1-6 (Feb. 2018).
[cited by applicant]
Tubman, N. M., et al., “Postponing the Orthogonality Catastrophe: Efficient State Preparation for Electronic Structure Simulations on Quantum Devices,” Quantum Physics, arXiv: 1809.05523, pp. 1-13, (Sep. 14, 2018).
[cited by applicant]
Urbanek, M., et al., “Chemistry on Quantum Computers with Virtual Quantum Subspace Expansion,” Journal of Chemical Theory and Computation 16.9, pp. 5425-5431. doi: 10.1021/acs.jctc.0c00447. (Feb. 28, 2020).
[cited by applicant]
Verdon, G., et al., “Learning to learn with quantum neural networks via classical neural networks,” arXiv:1907.05415, pp. 1-12 (Jul. 11, 2019).
[cited by applicant]
Verstraete, F., et al., “Quantum Circuits for Strongly Correlated Quantum Systems”, arXiv:0804.1888v1, pp. 1-5 (Apr. 11, 2008).
[cited by applicant]
Verteletskyi, V., et al., “Measurement optimization in the variational quantum eigensolver using a minimum clique cover”, Quantum Physics, arXiv:1907.03358v4, pp. 1-7 (Mar. 26, 2020).
[cited by applicant]
Wang, D., et al., “Accelerated Variational Quantum Eigensolver”, arXiv:1802.00171v3, pp. 1-11 (Mar. 25, 2019).
[cited by applicant]
Wang, G., et al., “Bayesian Inference with Engineered Likelihood Functions for Robust Amplitude Estimation”, arXiv:2006.09350v2, pp. 1-62 (Jun. 26, 2020).
[cited by applicant]
Wang, G., et al., “Minimizing Estimation Runtime on Noisy Quantum Computers,” PRX Quantum 2.1 pp. 010346-1-010346-49 (2021).
[cited by applicant]
Watson, J.D., et al., “The complexity of translationally invariant problems beyond ground state energies”, arXiv preprint arXiv:2012.12717, pp. 1-58 (Dec. 23, 2020).
[cited by applicant]
Wecker, D., et al., “Solving strongly correlated electron models on a quantum computer”, Physical Review A, vol. 92, No. 6, pp. 1-27 (2015).
[cited by applicant]
Wecker, D., et al., “Progress towards practical quantum variational algorithms”, Phys. Rev. A 92, 042303, pp. 1-11 (Sep. 8, 2015).
[cited by applicant]
Wecker, D., et al., “Towards Practical Quantum Variational Algorithms”, Physical Review A, vol. 92, No. 4, 042303, pp. 1-11 (Sep. 8, 2015).
[cited by applicant]
Wiebe, N., and Granade, C., “Efficient Bayesian Phase Estimation”, arXiv:1508.00869v1, pp. 1-12 (Aug. 4, 2015).
[cited by applicant]
Wiebe, N., et al., “Higher Order Decompositions of Ordered Operator Exponentials”, Mathematical Physics, arXiv:0812.0562v3, pp. 1-16 (Dec. 4, 2008).
[cited by applicant]
William J. Huggins et al., “Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers,” Quantum Physics, arXiv:1907.13117, Jul. 2019, 17 pages.
[cited by applicant]
Willsch, M., et al., “Benchmarking the quantum approximate optimization algorithm,” Quantum Information Processing 19, 197, pp. 1-24 (2020).
[cited by applicant]
Wilson, M., et al., “Optimizing quantum heuristics with meta-learning,” arXiv:1908.03185, pp. 1-13 (Aug. 8, 2019).
[cited by applicant]
Wootton, J. R., “Benchmarking of quantum processors with random circuits”, arXiv: Quantum Physics, arXiv:1806.02736v1, pp. 1-15 (Jun. 7, 2018).
[cited by applicant]
Yen, T., et al., “Measuring all Compatible Operators in One Series of Single-Qubit Measurements Using Unitary Transformations,” Journal of Chemical Theory and Computation, vol. 16, No. 4, pp. 1-12 (Mar. 14, 2020.) arXiv…
[cited by applicant]
Yoder, T.J., et al., “Fixed-point quantum search with an optimal number of queries,” Physical review letters, vol. 113, No. 21, pp. 210501-210505 (Nov. 21, 2014).
[cited by applicant]
Zhao, A., et al., “Measurement reduction in variational quantum algorithms”, Quantum Physics, arXiv:1908.08067v2, pp. 1-21 (Dec. 16, 2019).
[cited by applicant]
Zhou, L., et al., “Quantum approximate optimization algorithm: Performance, mechanism, and implementation on hear-term devices,” Phys. Rev. X, vol. 10, pp. 1-23 (2020).
[cited by applicant]
Zhukov, A. A., et al., “Quantum communication protocols as a benchmark for quantum computers”, arXiv: 1812.00587v1, pp. 1-25 (Dec. 3, 2018).
[cited by applicant]
Johnson, P. D., et al., “QVECTOR: an algorithm for device-tailored quantum error correction”, arXiv preprint arXiv:1711.02249v1, pp. 1-16 (Nov. 7, 2017).
[cited by applicant]
Johnson, P.D., et al., “A Method for Improving Quantum Optimization Algorithms: The Marginals Optimization Procedure”, ICE 5th Conference on Quantum Information, Spain, (May 28-31, 2019), Book of Abstracts p. 59.
[cited by applicant]
Jones T., and Benjamin S. C., et al., “Quantum compilation and circuit optimisation via energy dissipation”, arXiv:1811.03147, pp. 1-13 (Dec. 19, 2018).
[cited by applicant]
Jordan, P., et al., “In The Collected Works of Eugene Paul Wigner: Part A: The Scientific Papers—Chapter: Über das Paulische Äquivalenzverbot”, pp. 109-129. Springer (1993).
[cited by applicant]
Kandala, A., et al., “Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets”, Nature 549, pp. 1-24 (Oct. 13, 2017).
[cited by applicant]
Kandala, A., et al., “Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets”, Nature, vol. 549, pp. 1-24 (2017).
[cited by applicant]
Kassal, I., et al., “Polynomial-time quantum algorithm for the simulation of chemical dynamics,” Proceedings of the National Academy of Sciences, vol. 105, No. 48, pp. 1-6 (2008).
[cited by applicant]
Kaushal, V., et al., “Shuttling-based trapped-ion quantum information processing”, AVS Quantum Science, vol. 2, No. 1, pp. 1-25 (2020).
[cited by applicant]
Kingma, D.P., and Ba, J.L., “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980, pp. 1-15 (2014).
[cited by applicant]
Kirby, W.M., and Love, P.J., “Classical simulation of noncontextual Pauli Hamiltonians,” Physical Review A, vol. 102, No. 3, pp. 1-15 (Sep. 24, 2020).
[cited by applicant]
Kirby, W.M., et al., “Contextual Subspace Variational Quantum Eigensolver,” Quantum, vol. 5, pp. 1-18 (May 12, 2021).
[cited by applicant]
Kirby, W.M., et al., “Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers,” Physical review letters, vol. 123, No. 20, pp. 1-14 (Feb. 7, 2020).
[cited by applicant]
Kitaev, A.Y., “Quantum Measurements and the Abelian Stabilizer Problem”, arXiv preprint quant-ph/9511026, pp. 1-22 (Nov. 20, 1995).
[cited by applicant]
Kitaev, A.Y., et al., “Classical and quantum computation,” Graduate Studies in Mathematics, vol. 47, 2002, 24 pages. Editorial Committee: Steven G. Krantz, David Saltman, David Sattinger and Ronald Stern, American Mathe…
[cited by applicant]
Kivlichan, I. D., et al., “Quantum Simulation of Electronic Structure with Linear Depth and Connectivity”, Phys. Rev. Lett. 120, arXiv:1711.04789v2, pp. 1-6 (Mar. 13, 2018).
[cited by applicant]
Naergaard, M., et al., “Superconducting Qubits: Current State of Play”, arXiv:1905.13641v2, pp. 1-28 (Jul. 26, 2019).
[cited by applicant]
Knill, E., et al., “Optimal Quantum Measurements of Expectation Values of Observables,” Physical Review A, 7(1), , p. 012328, pp. 1-22 (Jul. 3, 2006).
[cited by applicant]
Knill, E., et al., “Optimal Quantum Measurements of Expectation Values of Observables”, arXiv quant-ph/0607019v1, pp. 1-22 (Jul. 3, 2006).
[cited by applicant]
Kottmann, J.S., et al., “Reducing qubit requirements while maintaining numerical precision for the variational quantum eigensolver: A basis-set-free approach,” The Journal of Physical Chemistry Letters 12.1, arXiv:2008.…
[cited by applicant]
Kottmann, J.S., et al., “Reducing Qubit Requirements while Maintaining Numerical Precision for the Variational Quantum Eigensolver: A Basis-Set-Free Approach,” The Journal of Physical Chemistry Letters, vol. 12, No. 1, …
[cited by applicant]
Krantz, P., et al., “A Quantum Engineer's Guide to Superconducting Qubits”, Applied Physics Reviews, vol. 6, No. 2, 021318, pp. 1-59 (2019).
[cited by applicant]
Kuhn, M., et al., “Accuracy and Resource Estimations for Quantum Chemistry on a Near-Term Quantum Computer,” Journal of Chemical Theory and Computation 15.9, pp. 1-26. arXiv: 1812.06814 (Aug. 14, 2019).
[cited by applicant]
Kyriienko, O., “Quantum inverse iteration algorithm for programmable quantum simulators,” arXiv preprint arXiv: 1901.09988, pp. 1-16 (Sep. 30, 2019).
[cited by applicant]
Lee, S.J.R., et al., “Analytical Gradients for Projection-Based Wavefunction-in-DFT Embedding”, arXiv:1903.05830v3, pp. 1-15 (Aug. 19, 2019).
[cited by applicant]
Lemke, C., et al., “Metalearning: a survey of trends and technologies,” Artificial Intelligence Review 44, 117 pp. 1-17 (2015).
[cited by applicant]
Li, Z., et al., “Meta-sgd: Learning to learn quickly for few-shot learning,” arXiv preprint arXiv:1707.09835, pp. 1-11 (Sep. 28, 2017).
[cited by applicant]
Lieb, E.H., and WU,F.Y., “The one-dimensional Hubbard model: a reminiscence,” Physica A: Statistical Mechanics and its Applications 321, 1, arXiv:0207529, pp. 1-33 (2002).
[cited by applicant]
Lin, L, and Tong, Y., “Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers,” arXiv preprint arXiv:2102.11340, pp. 1-24 (Feb. 22, 2021).
[cited by applicant]
Lin, L, and Tong, Y., “Near-optimal ground state preparation,” Quantum, 4:372,arXiv:2002.12508, pp. 1-22 (Dec. 6, 2020).
[cited by applicant]
Liu, J., and Wang, L., “Differentiable learning of quantum circuit Born machines”, Phys. Rev. A 98, 062324, pp. 1-9 (2018).
[cited by applicant]
Liu, Y., “The Complexity of the Consistency and N-Representability Problems for Quantum States”, Quantum Physics, arXiv preprint arXiv:0712.3041, pp. 1-89 (2007).
[cited by applicant]
Liu, Y., et al., “Quantum computational complexity of the N-representability problem: QMA complete”, Physical review letters, vol. 98, No. 11, pp. 1-6 (2007).
[cited by applicant]
Long, G.L., et al., “Phase Matching in Quantum Searching”, arXiv:quant-ph/9906020v1, pp. 1-13 (Jun. 5, 1999).
[cited by applicant]
Low, G.H., and Chuang, I.L., “Optimal Hamiltonian Simulation by Quantum Signal Processing”, arXiv: 1606.02685v2, pp. 1-6 (Dec. 20, 2016).
[cited by applicant]
Low, G.H., et al., “Methodology of Resonant Equiangular Composite Quantum Gates”, Physical Review X, vol. 6, No. 4, pp. 1-13 (2016).
[cited by applicant]
Manby, F.R., et al., “A simple, exact density-functional-theory embedding scheme”, Journal of Chemical Theory and Computation, 8 (8), pp. 2564-2568 (Jul. 17, 2012).
[cited by applicant]
Manrique, D.Z., et al., “Momentum-Space Unitary Coupled Cluster and Translational Quantum Subspace Expansion for Periodic Systems on Quantum Computers,” arXiv: 2008.08694 [quant-ph], pp. 1-31 (2021).
[cited by applicant]
Mari, A., et al., “Estimating the gradient and higher order derivatives on quantum hardware,” Phys. Rev. A 103, 012405, pp. 1-17 (Feb. 26, 2021).
[cited by applicant]
Maslov, D., “Basic Circuit Compilation Techniques for an Ion-Trap Quantum Machine”, https://arxiv.org/pdf/1603.07678v4, pp. 1-18 (Feb. 21, 2017).
[cited by applicant]
Mcardle, S., et al., “Digital quantum simulation of molecular vibrations,” Chemical science, 10(22):5725-5735, 2019. arXiv:1811.04069, pp. 1-14 (Jan. 23, 2020).
[cited by applicant]
Mcardle, S., et al., “Variational ansatz-based quantum simulation of imaginary time evolution,” Nature Partner Journals: Quantum Information, vol. 5, No. 1, pp. 1-6 (2019).
[cited by applicant]
Mcclean, J. R., et al., “The theory of variational hybrid quantum-classical algorithms”, New Journal of Physics, vol. 18, pp. 1-22 (Feb. 5, 2016).
[cited by applicant]
McClean, J.R., et al., “Barren plateaus in quantum neural network training landscapes,” Nature communications, arXiv: 1803.11173, pp. 1-6 (2018).
[cited by applicant]
Mcclean, J.R., et al., “Decoding quantum errors with subspace expansions,” Nat. Comm. 11, p. 636. doi: 10.1038/s41467-020-14341—pp. 1-9 (2020).
[cited by applicant]
Mcclean, J.R., et al., “Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States”, Physical Review A, vol. 95, No. 4, pp. 1-10 (2017).
[cited by applicant]
Mcclean, J.R., et al., “OpenFermion: the electronic structure package for quantum computers”, Quantum Science and Technology 5.3, p. 034014, pp. 1-22 (2020).
[cited by applicant]
Mcclean, J.R., et al., “The theory of variational hybrid quantum-classical algorithms,” New Journal of Physics, vol. 18, No. 2, arXiv:1509.04279, pp. 1-20 (Sep. 14, 2015).
[cited by applicant]
Meir, Y., and Wingreen., “Landauer formula for the current through an interacting electron region,” Physical review etters, vol. 68, No. 16, pp. 2512-2516, (Apr. 20, 1992).
[cited by applicant]
Michielsen, K., et al., “Benchmarking gate-based quantum computers”, Quantum Physics, arXiv:1706.04341, vol. 220 pp. 1-33 (Jun. 14, 2017).
[cited by applicant]
Mølmer, K., and Sørensen, A., “Multiparticle entanglement of hot trapped ions”, arXiv:quant-ph/9810040v2, pp. 1-4 (Jan. 26, 1999).
[cited by applicant]
Mostafa H., and Wang X., et al., “Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterization”, arXiv:1902.05967v3, pp. 1-18 (May 13, 2019).
[cited by applicant]
Motta, M., et al., “Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution,” Nature Physics, vol. 16, No. 2, pp. 1-18 (Feb. 16, 2020).
[cited by applicant]
Motta, M., et al., “Low rank representations for quantum simulation of electronic structure”, Computational Physics, Quantum Physics, arXiv:1808.02625v2, pp. 1-8 (Aug. 9, 2018).
[cited by applicant]
Nakanishi, K.M., et al., “Subspace-search variational quantum eigensolver for excited states,” Phys. Rev. Research 1, p. 033062. doi: 10.1103/PhysRevResearch. 1.033062-1-7 (Oct. 3, 2019).
[cited by applicant]
Nelder, J. A., and Mead, R., “A simplex method for function minimization”, The Computer Journal, vol. 7, Issue. 4, pp. 308-313 (Jan. 1965).
[cited by applicant]
Nichol, A., et al., “On first-order metal-earning algorithms,” arXiv:1803.02999, pp. 1-15 (Oct. 22, 2018).
[cited by applicant]
Nielsen, M. A., and Chuang, I. L., “Quantum Computation and Quantum Information”, Cambridge University Press, pp. 1-704 (2000).
[cited by applicant]
Nielsen, M.A., et al, “Quantum Computation as Geometry”, arXiv:quant-ph/0603161v2, pp. 1-13 (Mar. 21, 2006).
[cited by applicant]
Non-Final Office Action mailed Jun. 10, 2021, in U.S. Appl. No. 17/084,990 of Sukin Sim, filed Oct. 30, 2020, 20 pages.
[cited by applicant]
Notice of Allowance mailed Aug. 12, 2021, in U.S. Appl. No. 17/084,990 of Sukin Sim, filed Oct. 30, 2020, 5 pages.
[cited by applicant]
Notice of Allowance mailed Aug. 27, 2021, in U.S. Appl. No. 17/084,990 of Sukin Sim, filed Oct. 30, 2020, 5 pages.
[cited by applicant]
Notice of Allowance mailed Jun. 28, 2021, for U.S. Appl. No. 17/033,727 of Pierre-Luc Dallaire-Demers, filed Sep. 26, 2020, 32 pages.
[cited by applicant]
O'brien, T. E., et al., “Calculating energy derivatives for quantum chemistry on a quantum computer,” NPJ Quantum Information, vol. 5, No. 1, pp. 1-12 (2019).
[cited by applicant]
O'gorman, B., et al., Generalized swap networks for near-term quantum computing, arXiv: 1905.05118 [quant-ph]., pp. 1-16 (May 13, 2019).
[cited by applicant]
Parrish, R.M., et al., “Quantum Computation of Electronic Transitions Using a Variational Quantum Eigensolver,” Physical Review Letters, vol. 122, No. 23, pp. 1-13 (Apr. 10, 2019).
[cited by applicant]
Peruzzo, A., et al., “A variational eigenvalue solver on a photonic quantum processor”, Nature Communications, vol. 5, Article No. 4213, pp. 1-7 (2014).
[cited by applicant]
Peruzzo, A., et al., “A variational eigenvalue solver on a quantum processor”, Quantum Physics, arXiv:1304.3061v1, pp. 1-10 (Apr. 10, 2013).
[cited by applicant]
Pino, J.M., et al., “Demonstration of the QCCD trapped-ion quantum computer architecture”, arXiv:2003.01293, pp. 1-11 (Sep. 26, 2020).
[cited by applicant]
Potthoff, M., “Chapter 1: Self-energy-functional theory”, arXiv:1108.2183, pp. 1-38 (Aug. 10, 2011).
[cited by applicant]
Poulin, D., and Wocjan, P., “Preparing ground states of quantum many-body systems on a quantum computer,” Physical review letters, vol. 102, No. 13, 130503, pp. 1-7 (Sep. 16, 2008).
[cited by applicant]
Powell, M. J. D., “A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation”, In: Gomez S., Hennart JP. (eds) Advances in Optimization and Numerical Analysis. Mathem…
[cited by applicant]
Purvis, G.D., et al., “A full coupled-cluster singles and doubles model: The inclusion of disconnected triples”, The Journal of Chemical Physics, vol. 76, No. 4, pp. 1910-1918 (Feb. 15, 1982).
[cited by applicant]
R. L. Fox et al., “Rates of change of eigenvalues and eigenvectors,” AIAA Journal 6.12 (1968), pp. 2426-2429.
[cited by applicant]
Reiher, M., et al., “Elucidating Reaction Mechanisms on Quantum Computers”, PNAS, vol. 114, No. 29, pp. 1-28 (2016).
[cited by applicant]
Rice, J.E., et al., “Quantum computation of dominant products in lithium-sulfur batteries,” The Journal of Chemical Physics, 154(13): 134115, 2021. arxiv2001.01120, pp. 1-7 (Jan. 4, 2020).
[cited by applicant]
Robbins, K., and Love, P.J., “Benchmarking VQE with the LMG model,” arXiv: 2105.06761 [quant-ph]. pp. 1-15 (Aug. 2, 2021).
[cited by applicant]
Robert M. Parrish et al., “Psi4 1.1: An Open-Source Electronic Structure Program Emphasizing Automation, Advanced Libraries, and Interoperability,” J. Chem. Theory Comput. 13.7 (2017), pp. 3185-3197. doi: 10.1021/acs.jc…
[cited by applicant]
Rodriguez-Lujan, I., et al., “Quadratic Programming Feature Selection”, The Journal of Machine Learning Research, vol. 11, pp. 1491-1516 (2010).
[cited by applicant]
Romero et al., “Quantum autoencoders for efficient compression of quantum data”, arXiv:1612.02806v2, Feb. 10, 2017, 11 pages. . [retrieved on Jan. 20, 2020]. Retrieved from <https://arxiv.org/abs/1612.02806>.
[cited by applicant]
Romero, J., and Aspuru-Guzik, A., “Variational quantum generators: Generative adversarial quantum machine earning for continuous distributions”, Quantum Physics, arXiv:1901.00848 [quant-ph], pp. 1-15 (Jan. 3, 2019).
[cited by applicant]
Romero, J., et al., “Quantum autoencoders for efficient compression of quantum data”, Quantum Science and Technology, vol. 2 (4):045001, Feb. 10, 2017, pp. 1-10.
[cited by applicant]
Romero, J., et al., “Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz”, arXiv: 1701.02691v2 [quant-ph], vol. 4, No. 4, pp. 1-18 (Feb. 10, 2018).
[cited by applicant]
Rubin, N. C., et al., “Application of Fermionic Marginal Constraints to Hybrid Quantum Algorithms”, New Journal of Physics, vol. 20, No. 5, 053020, pp. 1-21 (2018).
[cited by applicant]
Rubin, N.C., “A Hybrid Classical/Quantum Approach for Large-Scale Studies of Quantum Systems with Density Matrix Embedding Theory”, Quantum Physics, arXiv: 1610.06910 [quant-ph], pp. 1-10, (2016).
[cited by applicant]
Rusu, A. A., et al., “Meta-learning with latent embedding optimization,” arXiv:1807.05960, pp. 1-17 (Mar. 26, 2019).
[cited by applicant]
Sarma, S.D., et al., “Majorana Zero Modes and Topological Quantum Computation”, arXiv: 1501.02813v2, pp. 1-16, May 14, 2015 (retrieved on Nov. 17, 2019). Retrieved from <https://arxiv.org/abs/1501.02813>.
[cited by applicant]
Schlittgen, B., et al., “Low-Energy Effective Theories of Quantum Spin and Quantum Link Models”, Physical Review D, vol. 63. No. 8, pp. 1-29 (Mar. 19, 2001).
[cited by applicant]
Schuch, N. and Verstraete, F., “Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory”, Nature Physics, DOI: 10.1038/NPHYS1370, pp. 732-735 (Aug. 23, 2009).
[cited by applicant]
Schuld, M., et al., “Circuit-centric quantum classifiers”, arXiv:1804.00633v1, pp. 1-17 (Apr. 2, 2018).
[cited by applicant]
Seeley, J.T., et al., “The Bravyi-Kitaev transformation for quantum computation of electronic structure,” The Journal of chemical physics, 137(22):224109, 2012. arXiv: 1208.5986, pp. 1-38 (Aug. 29, 2012).
[cited by applicant]
Sepiol, M.A., “A High-Fidelity Microwave Driven Two-Qubit Quantum Logic Gate in 43Ca+”, pp. 1-197 (2016).
[cited by applicant]
Sergeevich, A., et al., “Characterization of a Qubit Hamiltonian Using Adaptive Measurements in a Fixed Basis”, arXiv: 1102.3700v2, pp. 1-6 (Nov. 23, 2011).
[cited by applicant]
Sim, S., et al., “Adaptive pruning-based optimization of parameterized quantum circuits,” Quantum Science and Technology 10.1088/2058-9565/abe107 (2021) pp. 1-24, arXiv:2010.00629.
[cited by applicant]
Skolik, A., et al., “Layerwise learning for quantum neural networks,” arXiv:2006.14904, vol. 3, No. 5 pp. 1-11 (Jun. 26, 2020).
[cited by applicant]
Somma, R. D., “Quantum eigenvalue estimation via time series analysis,” New Journal of Physics, 21(12):123025, 2019. arXiv:1907.11748, pp. 1-10 (Sep. 4, 2020).
[cited by applicant]
Somma, R. D., et al., “Spectral gap amplification,” SIAM Journal on Computing, 42(2):593-610, 2013. arXiv:1110.2494, Mar. 30, 2012, 14 pages.
[cited by applicant]
Steane, A., “Multiple Particle Interference and Quantum Error Correction”, Proceedings of the Royal Society A, The royal Society, vol. 452, Issue. 1954, pp. 2551-2577 (Nov. 8, 1996).
[cited by applicant]
Subasi, Y., et al., “Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing,” Physical review letters, vol. 122, No. 6, pp. 1-9 (Nov. 29, 2018).
[cited by applicant]
Sunkin Sim et al., “Expressibility and Entangling Capability of Parameterized Quantum Circuits for Hybrid Quantum-Classical Algorithms”, arXiv: 1905.10876v1, May 25, 2019, 18 pages. Available online at <URL: https://arx…
[cited by applicant]
Swarnadeep Majumder et al., “Real-time calibration with spectator qubits”, npj Quantum Information, vol. 6, Retrieved from: <URL: https://www.nature.com/articles/s41534-020-0251-y>, Feb. 7, 2020, 9 pages.
[cited by applicant]
“Quantum Computing: Progress and Prospects” National Academies of Sciences, Engineering, and Medicine, pp. 1-273 (2019).
[cited by applicant]
Benedetti, M., et al., “Parameterized quantum circuits as machine learning models,” arXiv: 1906.07682v2, pp. 1-18 (Oct. 10, 2019). Available online at <https://arxiv.org/abs/1906.07682v2>.
[cited by applicant]
Colless, J.I., et al., “Robust determination of molecular spectra on a quantum processor,” arxiv.org. Cornell University Library, 201 Olin Library Cornell University Ithaca, NY 14853, XP081278642, DOI: 10.1103/physrevx.…
[cited by applicant]
Dyakonov, M., “The case against Quantum Computing”, IEEE Spectrum, pp. 1-5 (Nov. 15, 2018).
[cited by applicant]
Endo, S., et al., “Hybrid quantum-classical algorithms and quantum error mitigation,” arXiv.2011.01382v1, pp. 1-39 (Nov. 2, 2020) Available online at [https://arxiv.org/abs/2011.01382].
[cited by applicant]
Extended European Search Report mailed Jun. 22, 2022, in European patent application No. 20791186.8, 8 pages.
[cited by applicant]
Extended European Search Report mailed May 19, 2022, in European patent application No. 19850377.3, 10 pages.
[cited by applicant]
Hempel, C. et al., “Quantum chemistry calculations on a trapped-ion quantum simulator,” arxiv.org. Cornell University ibrary, 201 Olin Library Cornell University Ithaca, NY 14853, XP080859698, pp. 1-21 (Mar. 27, 2018).
[cited by applicant]
Horgan, J., “Will Quantum Computing Ever Live Up to Its Hype?”, Quantum Computing, Scientific American, pp. 6 (Apr. 20, 2021).
[cited by applicant]
Huang, C., et al., “Classical Simulation of Quantum Supremacy Circuits,” arXiv:2005.06787v1., pp. 1-28 (May 14, 2020) Available online at [https://arxiv.org/abs/2005.06787].
[cited by applicant]
International Search Report & Written Opinion mailed Jun. 15, 2022, in international patent application No. PCT/US2022/018727, 9 pages.
[cited by applicant]
International Search Report & Written Opinion mailed Jun. 28, 2022, in international patent application No. PCT/US2022/019724, 9 pages.
[cited by applicant]
Johnson, P.D., et al., “QVECTOR: an algorithm for device-tailored quantum error correction,” pp. 1-16, XP055553548, (Nov. 7, 2017) Retrieved from the Internet at <URL:https://arxiv.org/pdf/1711.02249.pdf.
[cited by applicant]
Moll, N., et al., “Quantum optimization using variational algorithms on near-term quantum devices,” Quantum Science and Technology, vol. 3, pp. 18 (Jun. 19, 2018) [retrieved on Nov. 25, 2019]. Retrieved from <https://io…
[cited by applicant]
Non-Final Office Action mailed May 11, 2022, in U.S. Appl. No. 16/543,165 of Peter D. Johnson, filed Aug. 16, 2019, 26 pages.
[cited by applicant]
Preskill, J., “Quantum Computing in the NISQ era and beyond”, pp. 1-20 (Jul. 31, 2018).
[cited by applicant]
Sauvage, F., et al., “FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits,” https://arxiv.org/abs/2103.08572v2, 15 pages, (May 5, 2021).
[cited by applicant]
Xia, R., and Kais, S., “Hybrid Quantum-Classical Neural Network for Calculating Ground State Energies of Molecules,” Entropy, vol. 22, No. 8, pp. 1-12 (Jul. 29, 2020) Available online at [https://doi.org/10.3390/e220808…
[cited by applicant]
Decision to Grant mailed Jul. 19, 2022, in Taiwan patent application No. 109139876, 5 pages.
[cited by applicant]
Examination Report mailed Aug. 24, 2022, in Canadian patent application No. 3, 155,085, 4 pages.
[cited by applicant]
Final Office Action mailed Aug. 25, 2022, in U.S. Appl. No. 16/543,165 of Peter D. Johnson, filed Aug. 16, 2019, 73 pages.
[cited by applicant]
Frank Jensen, “Introduction to computational chemistry,” John Wiley & Sons, Great Britain, 2017, 620 pages.
[cited by applicant]
Non-Final Office Action mailed Aug. 3, 2022, in U.S. Appl. No. 16/900,947 of Guoming Wang, filed Jun. 14, 2020, 82 pages.
[cited by applicant]
Second Examination Report mailed Aug. 2, 2022, in Canadian patent application No. 3,133,917, 3 pages.
[cited by applicant]