Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
95 tokens/sec
Gemini 2.5 Pro Premium
32 tokens/sec
GPT-5 Medium
18 tokens/sec
GPT-5 High Premium
18 tokens/sec
GPT-4o
97 tokens/sec
DeepSeek R1 via Azure Premium
87 tokens/sec
GPT OSS 120B via Groq Premium
475 tokens/sec
Kimi K2 via Groq Premium
259 tokens/sec
2000 character limit reached

Tensor Quantum Programming (2403.13486v1)

Published 20 Mar 2024 in quant-ph

Abstract: Running quantum algorithms often involves implementing complex quantum circuits with such a large number of multi-qubit gates that the challenge of tackling practical applications appears daunting. To date, no experiments have successfully demonstrated a quantum advantage due to the ease with which the results can be adequately replicated on classical computers through the use of tensor network algorithms. Additionally, it remains unclear even in theory where exactly these advantages are rooted within quantum systems because the logarithmic complexity commonly associated with quantum algorithms is also present in algorithms based on tensor networks. In this article, we propose a novel approach called Tensor Quantum Programming, which leverages tensor networks for hybrid quantum computing. Our key insight is that the primary challenge of algorithms based on tensor networks lies in their high ranks (bond dimensions). Quantum computing offers a potential solution to this challenge, as an ideal quantum computer can represent tensors with arbitrarily high ranks in contrast to classical counterparts, which indicates the way towards quantum advantage. While tensor-based vector-encoding and state-readout are known procedures, the matrix-encoding required for performing matrix-vector multiplications directly on quantum devices remained unsolved. Here, we developed an algorithm that encodes Matrix Product Operators into quantum circuits with a depth that depends linearly on the number of qubits. It demonstrates effectiveness on up to 50 qubits for several matrices frequently encountered in differential equations, optimization problems, and quantum chemistry. We view this work as an initial stride towards the creation of genuinely practical quantum algorithms.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (84)
  1. Hybrid quantum-classical algorithms and quantum error mitigation. Journal of the Physical Society of Japan, 90(3):032001, 2021.
  2. Practical application-specific advantage through hybrid quantum computing. arXiv preprint arXiv:2205.04858, 2022.
  3. Variational quantum algorithms. Nature Reviews Physics, 3(9):625–644, Aug 2021.
  4. Quantum machine learning. Nature, 549(7671):195–202, 2017.
  5. Towards quantum machine learning with tensor networks. Quantum Science and Technology, 4(2):024001, 2019.
  6. Scott Aaronson. Read the fine print. Nature Physics, 11(4):291–293, 2015.
  7. Ewin Tang. Dequantizing algorithms to understand quantum advantage in machine learning. Nature Reviews Physics, 4(11):692–693, 2022.
  8. Grand unification of quantum algorithms. PRX Quantum, 2(4):040203, 2021.
  9. Solving large-scale linear systems of equations by a quantum hybrid algorithm. Annalen der Physik, 534(7):2200082, May 2022.
  10. Leigh Lapworth. A Hybrid Quantum-Classical CFD Methodology with Benchmark HHL Solutions. arXiv preprint arXiv:2206.00419, 2022.
  11. Minimal universal two-qubit controlled-NOT-based circuits. Phys. Rev. A, 69:062321, Jun 2004.
  12. Synthesis of quantum-logic circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 25(6):1000–1010, Jun 2006.
  13. Efficient decomposition of unitary matrices in quantum circuit compilers. Applied Sciences, 12(2), 2022.
  14. Approaching the theoretical limit in quantum gate decomposition. Quantum, 6:710, May 2022.
  15. Quantum-state preparation with universal gate decompositions. Physical Review A, 83(3):032302, 2011.
  16. Quantum state estimation, volume 649. Springer Science & Business Media, 2004.
  17. Ivan V Oseledets. Tensor-train decomposition. SIAM Journal on Scientific Computing, 33(5):2295–2317, 2011.
  18. Román Orús. A practical introduction to tensor networks: Matrix product states and projected entangled pair states. Annals of Physics, 349:117–158, Oct 2014.
  19. Sequential Generation of Entangled Multiqubit States. Phys. Rev. Lett., 95:110503, Sep 2005.
  20. Shi-Ju Ran. Encoding of matrix product states into quantum circuits of one- and two-qubit gates. Phys. Rev. A, 101:032310, Mar 2020.
  21. Automatically differentiable quantum circuit for many-qubit state preparation. Phys. Rev. A, 104:042601, Oct 2021.
  22. Decomposition of matrix product states into shallow quantum circuits. arXiv preprint arXiv:2209.00595, 2022.
  23. Quantum machine learning: from physics to software engineering. Advances in Physics: X, 8(1):2165452, 2023.
  24. Simulating quantum computation by contracting tensor networks. SIAM Journal on Computing, 38(3):963–981, 2008.
  25. Cross tensor approximation for image and video completion, 2022.
  26. Adam Holmes and AY Matsuura. Efficient quantum circuits for accurate state preparation of smooth, differentiable functions. In 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 169–179. IEEE, 2020.
  27. Ivan Oseledets. Constructive representation of functions in low-rank tensor formats. Constructive Approximation, 37, 09 2010.
  28. Low-rank explicit QTT representation of the Laplace operator and its inverse. SIAM journal on matrix analysis and applications, 33(3):742–758, 2012.
  29. QPrep: Library for quantum state preparation using tensor networks.
  30. PastaQ: A package for simulation, tomography and analysis of quantum computers, 2020.
  31. Efficient quantum state tomography. Nature communications, 1(1):1–7, 2010.
  32. Numerical solution of the incompressible navier-stokes equations for chemical mixers via quantum-inspired tensor train finite element method. arXiv preprint arXiv:2305.10784, 2023.
  33. Why are big data matrices approximately low rank? SIAM Journal on Mathematics of Data Science, 1(1):144–160, 2019.
  34. Bounds on the singular values of matrices with displacement structure. SIAM Review, 61(2):319–344, 2019.
  35. Quantum Fourier transform has small entanglement. PRX Quantum, 4(4):040318, 2023.
  36. Quantum-state preparation with universal gate decompositions. Phys. Rev. A, 83:032302, Mar 2011.
  37. Efficient amplitude encoding of polynomial functions into quantum computers. arXiv preprint arXiv:2307.10917, 2023.
  38. Data is often loadable in short depth: Quantum circuits from tensor networks for finance, images, fluids, and proteins. arXiv preprint arXiv:2309.13108, 2023.
  39. Computational complexity of isometric tensor network states, 2024.
  40. Block encoding of matrix product operators, 2023.
  41. Riemannian optimization of isometric tensor networks. SciPost Phys., 10:040, 2021.
  42. Riemannian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies. New Journal of Physics, 23(7):073006, Jul 2021.
  43. W. Hackbusch and B. N. Khoromskij. Low-rank Kronecker-product approximation to multi-dimensional nonlocal operators. II. HKT representation of certain operators. Computing, 76(3-4):203–225, 2006.
  44. L. Grasedyck. Existence and computation of low Kronecker-rank approximations for large systems in tensor product structure. Computing, 72:247–265, 2004.
  45. Exact NMR simulation of protein-size spin systems using tensor train formalism. Phys. Rev. B, 90:085139, 2014.
  46. Quantum computation and quantum information, 2002.
  47. QGOpt: Riemannian optimization for quantum technologies. SciPost Phys., 10:079, 2021.
  48. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980, 2014.
  49. Riemannian adaptive optimization methods. arXiv preprint arXiv:1810.00760, 2018.
  50. Open quantum systems, volume 10. Springer, 2012.
  51. Antonio Anna Mele. Introduction to Haar Measure Tools in Quantum Information: A Beginner’s Tutorial, 2024.
  52. Numerical treatment of partial differential equations, volume 154. Springer, 2007.
  53. Variational quantum algorithm for the Poisson equation. Phys. Rev. A, 104:022418, Aug 2021.
  54. Quantum fast Poisson solver: the algorithm and complete and modular circuit design. Quantum Information Processing, 19(6):1–25, 2020.
  55. Finding entries of maximum absolute value in low-rank tensors. arXiv preprint arXiv:1912.02072, 2019.
  56. Lov K Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 212–219, 1996.
  57. Peter W Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review, 41(2):303–332, 1999.
  58. Quantum algorithm for linear systems of equations. Physical Review Letters, 103(15), Oct 2009.
  59. Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM Journal on Computing, 46(6):1920–1950, 2017.
  60. On the CNOT-cost of Toffoli gates. arXiv preprint arXiv:0803.2316, 2008.
  61. Asymptotically improved Grover’s algorithm in any dimensional quantum system with novel decomposed n-qudit Toffoli gate. arXiv preprint arXiv:2012.04447, 2020.
  62. Decomposing the generalized Toffoli gate with qutrits. Phys. Rev. A, 105:032621, Mar 2022.
  63. Evidence for the utility of quantum computing before fault tolerance. Nature, 618(7965):500–505, 2023.
  64. Predicting many properties of a quantum system from very few measurements. Nature Physics, 16(10):1050–1057, 2020.
  65. Reconstructing quantum states with generative models. Nature Machine Intelligence, 1(3):155–161, Mar 2019.
  66. Jens Eisert. Entanglement and tensor network states. arXiv preprint arXiv:1308.3318, 2013.
  67. Expressive power of recurrent neural networks. arXiv preprint arXiv:1711.00811, 2017.
  68. TT-cross approximation for multidimensional arrays. Linear Algebra and its Applications, 432(1):70–88, 2010.
  69. Sebastian Ruder. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747, 2017.
  70. NISQ-compatible approximate quantum algorithm for unconstrained and constrained discrete optimization. Quantum, 7:1186, 2023.
  71. Hybrid quantum ResNet for car classification and its hyperparameter optimization. Quantum Machine Intelligence, 5:38, 2023.
  72. Optimization of chemical mixers design via tensor trains and quantum computing. arXiv preprint arXiv:2304.12307, 2023.
  73. Protein-protein docking using a tensor train black-box optimization method. arXiv preprint arXiv:2302.03410, 2023.
  74. PROTES: Probabilistic Optimization with Tensor Sampling. arXiv preprint arXiv:2301.12162, 2023.
  75. Optimization of functions given in the tensor train format. arXiv preprint arXiv:2209.14808, 2022.
  76. Quantum power optimization algorithm via tensor network representations. Manuscript in Preparation, 2024.
  77. Tetra-AML: automatic machine learning via tensor networks. arXiv preprint arXiv:2303.16214, 2023.
  78. Comparison between tensor networks and variational quantum classifier. arXiv preprint arXiv:2311.15663, 2023.
  79. TQCompressor: improving tensor decomposition methods in neural networks via permutations. arXiv preprint arXiv:2401.16367, 2024.
  80. Molecular electronic-structure theory. John Wiley & Sons, 2013.
  81. Garnet Kin-Lic Chan and Sandeep Sharma. The density matrix renormalization group in quantum chemistry. Annual review of physical chemistry, 62:465–481, 2011.
  82. Matrix product operators, matrix product states, and ab initio density matrix renormalization group algorithms. The Journal of chemical physics, 145(1), 2016.
  83. Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry. Nature Communications, 14(1):1952, 2023.
  84. Multi-scale tensor network architecture for machine learning. Machine Learning: Science and Technology, 2(3):035036, 2021.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets