Skip to main content# Inspiring Quantum Data Analysts

**Abstract**

# Media Summary

# 1. Introduction

# 2. Quantum Inspired

# 3. Quantum Metrics and Benchmarks

# Acknowledgment

# Disclosure Statement

# References

##### Connections

1 of 5

Published onJan 27, 2022

Inspiring Quantum Data Analysts

The quantum revolution has swept into data analytics with quantum computers promising better algorithms for machine learning, optimization, and other techniques. In this commentary to Prof. Yazhen Wang’s (2021) article on making data science quantum, I note that it may be some time before quantum computers mature enough for data analytics to come online. Nevertheless, there are quantum explorations appropriate for even today’s data analysts. Here I outline two possibilities, looking at quantum-inspired algorithms and information technologies and formulating benchmarks for quantum technologies.

**Keywords**: quantum-inspired algorithms, quantum machine learning, quantum benchmarks, quantum metrics

The fusing of quantum computers and data analytics promises a revolution in machine learning and other optimization and related computational capabilities. However, there are no quantum computers currently capable of outperforming their conventional counterparts for these applications. Here I suggest two areas of exploration for today’s data analysts interested in quantum: quantum-inspired analytics, viewing information technologies from the vantage point of quantum in order to make gains in conventional systems, and benchmarking quantum technologies.

In a concluding proposal to develop quantum data analytics, professor Yazhen Wang (2021) identifies major areas in which quantum computers can revolutionize data science. These areas include machine learning, games, and data augmentation. Wang also notes that data analytics is vital in exploring the question of thermal-based classical annealing versus tunneling-based quantum annealing. Given these already identified areas, Wang called for continued identification and analysis of areas of overlap as quantum computers mature.

The major drawback of these ideas forwarded by Wang is the lack of a fully mature quantum computer. To this point, there have only been three demonstrations of so-called quantum supremacy (Arute et al., 2019; Wu et al., 2021; Zhong et al., 2020), where a quantum computer is shown to clearly outperform the fastest of today’s supercomputers. The problems solved in those demonstrations are tailor-designed for the quantum computer and without practical application. We still await a demonstration of a quantum advantage for a useful application. Not surprisingly, there are contradictory opinions as to when a quantum computer of sufficient maturity will come online. The recent in-depth evaluation by Sevilla and Reidel (2020) predicted with 50% confidence that there will not be a quantum computer capable of breaking the 2048-bit version of the public key Rivest-Shamir-Adelman (RSA) cryptosystem until 2050. If so, to what end are studies of quantum data science if there is no quantum computer?

One may counter that there is a vast difference between RSA, which is broken with Shor’s algorithm, and machine learning or optimization. The argument would go as follows. Factoring and similar problems have one solution. There is no utility in coming close to the correct answer. One either gets the answer or not. Optimization, however, may have an optimal solution but also many suboptimal solutions. Though today’s quantum computers, defined by Preskill (2018) as noisy, intermediate-scale quantum (NISQ) computers, may not be able to identify the optimal solution due to noise and errors, those errors will merely push the computation to a suboptimal, but still useful, solution and do so more quickly than conventional computers. In response to this argument, it could be pointed out that in a typical quantum computing architecture there is no a priori reason that errors should act in a way to lead to a suboptimal solution rather than completely disrupting the computation.

Thus, we are left with the question: Is there a short-term gain in exploring quantum data analysis?

Here I would like to suggest two positive answers to this question. First, quantum data analytics may provide a new perspective to classic problems. That perspective opens the door for solutions that exploit quantum phenomena but has also inspired new ideas that emulate, rather than exploit, such phenomena. Second, data analytics can be used to formulate metrics and benchmarks for emerging quantum computers and other quantum technologies. For reason of cross-platform comparison and the identification of trends to make predictions, metrics and benchmarks have an important role to play even today, when quantum computers cannot, with rare exception, outperform conventional devices.

Six years ago, Kerendis and Prakash (2016) released a paper on “Quantum Recommendation Systems,” demonstrating an exponential speedup for quantum computers over their classical counterparts for a machine learning application. Less than three years later, Tang (2019) presented a conventional algorithm, only polynomially slower than the quantum algorithm. Tang’s algorithm was quantum inspired, meaning that the conventional computer attempts to emulate certain aspects of quantum mechanics to gain a computational advantage. To date, there have been quite a few quantum-inspired algorithms tackling problems of optimization (Cai et al., 2021), machine learning (Ding et al., 2021), and linear algebra (Chakhmakhchyan et al., 2017) (the references provide only a few examples). In addition, the Fujitsu Digital Annealer (Aramon et al., 2019) is a classical analog of quantum annealers such as those produced by D-Wave.

Quantum inspiration is not limited to computing. Utilizing quantum information theory, Tsang et al. (2016) demonstrates the ability to improve imaging systems, specifically the ability to resolve two objects that are in close proximity to each other. It had been generally assumed that two objects were unresolvable if they violated the Rayleigh criterion, meaning that the two objects were close enough that their Airy discs (proportional to the wavelength of the light divided by the size of the sensing aperture) overlapped. However, Tsang et al. demonstrated that this criterion is irrelevant if only one approached the problem from a quantum information standpoint. No part of the novel sensing system proposed by Tsang et. al, requires quantum mechanics. All that changed was that they had taken a quantum perspective.

Today’s data analysts looking to expand into the area of quantum may want to build on any of the above-mentioned work or explore new areas looking to be quantum inspired. One area that may hold promise is quantum-inspired games, such as discussed in Khan et al. (2018). Wang (2021) in his article already used a quantum game to show the utility of quantum information. Is there a path for quantum-inspired games that achieve similar results when sampling over a large ensemble or via some other method? Another area is quantum networks and communication systems, as discussed by Pirandola et al. (2017). These fields have borrowed heavily from their classical counterparts. Are there techniques that can go the other way?

In summary, though there is no quantum computer yet capable of implementing quantum data analytics, there is a large space for the quantum data analyst to continue to explore.

As quantum technologies mature, there is a need to understand what applications are enabled as new versions of the technologies are developed. In addition, the field is looking for ways to identify trends and make predictions as to future capabilities. To that end, proper metrics and benchmarks are needed. Here I define a metric as a number gauging some aspect of a quantum technology while a benchmark is a method used to determine a metric.

An example of a metric for quantum computers is number of quantum bits (or qubits). The advantage of number of qubits as a metric is that it is easy to determine how many qubits are in the computer (the benchmarking process is straightforward) and since it is generally known how many qubits are necessary to accomplish certain tasks, such as determined in Roetteler et al. (2017) for breaking RSA encryption, the number of qubits gives an idea as to the potential power of the quantum computer. The weakness of employing number of qubits as a metric is that it does not account for inaccuracies in the operation of the qubits. No qubit today is perfect. Some measure of imperfection would be useful in gauging the actual capability of a quantum computer.

In response to this issue, Cross et al. (2019) defined an alternate metric known as quantum volume (QV). The QV accounts for both the number of qubits and their ability to implement gates accurately. Effectively it represents the largest square circuit (number of qubits by number of time steps where gates are implemented) that can be implemented by the quantum computer. One drawback of the QV is the difficulty in determining its value. This is because it is necessary to test the accuracy of gates between every possible pair of qubits. However, current qubit architecture, where qubits are arranged in a square or other type of lattice, does not allow for easy implementation of two-qubit gates between any pair.

Other metrics and benchmarks have been devised to determine the accuracy or power of quantum computers. However, the goal of this commentary is not to review current metrics and benchmarks but to inspire data analysts to formulate new ones. What data is needed, what benchmarks are useful, how can the power of a quantum computer, or a quantum network, or any of the emerging quantum technologies be communicated in a straightforward fashion? These are the questions I would like to place in front of today’s enterprising data analysts.

The author would like to thank The MITRE Corporation for continued support.

©2021 The MITRE Corporation. All rights reserved.

Approved for public release. Distribution unlimited 21-03350-2.

Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., & Katzgraber, H. G. (2019). Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. *Frontiers in Physics, 7*, Article 48. https://doi.org/10.3389/fphy.2019.00048

Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., Burkett, B., Chen, Y., Chen, Z., Chiaro, B., Collins, R., Courtney, W., Dunsworth, A., Farhi, E., Foxen, B., . . . Martinis, J. M. (2019). Quantum supremacy using a programmable superconducting processor. *Nature, 574*(7779), 505–510. https://doi.org/10.1038/s41586-019-1666-5

Cai, X., Zhao, H., Shang, S., Zhou, Y., Deng, W., Chen, H., & Deng, W. (2021). An improved quantum-inspired cooperative co-evolution algorithm with muli-strategy and its application. *Expert Systems with Applications,* *171*, Article 114629. https://doi.org/10.1016/j.eswa.2021.114629

Chakhmakhchyan, L., Cerf, N. J., & Garcia-Patron, R. (2017). Quantum-inspired algorithm for estimating the permanent of positive semidefinite matrices. *Physics Review A, 96*(2), Article 022329. https://doi.org/ 10.1103/PhysRevA.96.022329

Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta J. M. (2019). Validating quantum computers using randomized model circuits. *Physics Review A, 100*(3), Article 032328. https://doi.org/10.1103/PhysRevA.100.032328

Ding, C., Bao, T.-Y., & Huang, H.-L. (2021). Quantum-inspired support vector machine. *IEEE Transactions on Neural Networks and Learning Systems*. Advance online publication. https://doi.org/10.1109/TNNLS.2021.3084467

Kerendis, I., & Prakash, A. (2016). Quantum recommendation systems. In C. H. Papadimitrou (Ed.), *Proceedings of the 8th Innovations in Theoretical Computer Science Conference (*Article 49). Leibniz International Proceedings in Informatics. Dagstuhl Publishing. https://drops.dagstuhl.de/opus/volltexte/2017/8154/pdf/LIPIcs-ITCS-2017-49.pdf

Khan, F. S., Solmeyer, N., Balu, R., & Humble, T. S. (2018). Quantum games: A review of the history, current state, and interpretation. *Quantum Information Processing, 17*(11), Article 309. https://doi.org/10.1007/s11128-018-2082-8

Pirandola, S., Laurenza, R., Ottaviani, C., & Banchi, L. (2017). Fundamental limits of repeaterless quantum communications. *Nature Communications, 8*(1), Article 15043. https://doi.org/10.1038/ncomms15043

Preskill, J. (2018). Quantum computing in the NISQ era and beyond. *Quantum, 2*, 79. https://doi.org/10.22331/q-2018-08-06-79

Roetteler, M., Naehrig, M., Svore, K. M., & Lauter, K. (2017) Quantum resource estimates for computing elliptic curve discrete logarithms. In T. Takagi & T. Peyrin (Eds.), *Lecture notes in computer science: Vol. 10625. Advances in cryptology – ASIACRYPT 2017* (pp. 241–270). Springer. https://doi.org/10.1007/978-3-319-70697-9_9

Sevilla, J., & Reidel, C. J. (2020). Forecasting timelines of quantum computing. *arXiv*. https://doi.org/10.48550/arXiv.2009.05045

Tang, E. (2019). A quantum-inspired classical algorithm for recommendation systems. In *Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing *(pp. 217–228). Association for Computing Machinery. https://doi.org/10.1145/3313276.3316310

Tsang, M., Nair, R., & Lu, X.-M. (2016). Quantum theory of superresolution for two incoherent optical point sources. *Physical Review X, 6*(3), Article 031033. https://doi.org/10.1103/PhysRevX.6.031033

Wang, Y. (2021). When quantum computation meets data science: Making data science quantum. *Harvard Data Science Review, 4*(1). https://doi.org/10.1162/99608f92.ef5d8928

Wu, Y., Bao, W.-S., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., Gong, M., Guo, C., Guo, C., Guo, S., Han, L., Hong, L., Huang, H.-L., Huo, Y.-H., Li, L., . . . Pan, J.-W. (2021). Strong quantum computational advantage using a superconducting quantum processor. *Physical Review Letters, 127*(18), Article 180501. https://doi.org/10.1103/PhysRevLett.127.180501

Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., Hu, P., Yang, X.-Y., Zhang, W.-J., Li, H., Li, Y., Jiang, X., Gan, L., Yang, G., You, L., . . . Pan, J.-W. (2020). Quantum computational advantage using photons. *Science, 370*(6523), 1460–1463. https://doi.org/10.1126/science.abe8770

©2021 The MITRE Corporation. All rights reserved.

Approved for public release. Distribution unlimited 21-03350-2.