Home Community Unveiling the Quantum-Machine Learning Conundrum: Can Barren Plateau-Free Models in Quantum Computing Be Efficiently Simulated Classically?

Unveiling the Quantum-Machine Learning Conundrum: Can Barren Plateau-Free Models in Quantum Computing Be Efficiently Simulated Classically?

Unveiling the Quantum-Machine Learning Conundrum: Can Barren Plateau-Free Models in Quantum Computing Be Efficiently Simulated Classically?

Quantum machine learning and variational quantum algorithms were formerly hot topics, however the desert plateau event dampened their initial excitement. For example, the loss function landscapes of many quantum learning architectures show an exponential convergence towards their mean value because the system size increases and gains increasingly attention. As a result of the exponential training resources required, variational quantum algorithms are usually not scalable in such settings.

Consequently, there was lots of interest in studying training approaches and architectures that don’t produce empty plateaus. Nonetheless, the elemental structure of the issue is utilized by each of those approaches in some manner.

A classical technique in polynomial time can simulate the lack of landscapes that don’t probably have barren plateaus. Using parameterized quantum circuits or hybrid quantum-classical optimization loops on a quantum device is unnecessary for this simulation. Nonetheless, early data collection should still necessitate a quantum computer. One possible reading of those arguments is that they dequantize the information-processing capabilities of variational quantum circuits in empty, plateau-free spaces.

A brand new evaluation of popular tactics supports the premise that each one strategies for avoiding barren plateaus could also be successfully duplicated using traditional methods. The incontrovertible fact that there aren’t any empty plateaus allowed them to seek out the polynomially-sized subspaces that contain the relevant a part of the calculation. Using this information, one can find the set of expectation values that should be calculated (either classically or quantumly) to enable classical simulations.

This study was done by a bunch of researchers from Los Alamos National Laboratory, Quantum Science Center, California Institute of Technology, Chulalongkorn University, Vector Institute, University of Waterloo, Donostia International Physics Center, Ecole Polytechnique Fédérale de Lausanne (EPFL), Quantum Science Center, Universidad Nacional de La Plata, and University of Strathclyde. 

Since the researcher’s claims may very well be misunderstood, they’ve clarified them of their paper as follows: 

  1. They argue for widely used models and methods that use a loss function defined because the expected value of an observable for a state created by a parametrized quantum circuit and more general versions that use these measurements with classical post-processing. Amongst the numerous popular quantum designs that fall inside this category are several models for quantum machine learning, probably the most typical variational quantum algorithms, and families of quantum-generating schemes. It is just not exhaustive of all possible quantum learning mechanisms.
  2. Even when it is possible for all case studies, the team still hasn’t proven that it will possibly reliably discover the components needed for simulation. As mentioned of their paper, they don’t know how one can replicate it, although, in theory, there could be models without landscape desolate plateaus. When the small subspace is otherwise unknown, or the issue is very structured but stays in your complete exponential space, this might occur for sub-regions of a landscape which might be explorable using smart initialization strategies.

Having taken note of those cautions, the team presents recent opportunities and potential avenues for further research based on their results. They concentrate on the probabilities presented by warm starts. The computational cost could be too high even for polynomial-time classical simulation; this may lead to polynomial advantages when applying the variational quantum computing scheme on a quantum computer. Using the structure of traditional fault-tolerant quantum algorithms, the researchers suggest that highly structured variational architectures with superpolynomial quantum advantages, that are more exotic, are still possible.

Take a look at the Paper. All credit for this research goes to the researchers of this project. Also, don’t forget to hitch our 34k+ ML SubReddit, 41k+ Facebook Community, Discord Channel, and Email Newsletter, where we share the most recent AI research news, cool AI projects, and more.

In the event you like our work, you’ll love our newsletter..


” data-medium-file=”https://www.marktechpost.com/wp-content/uploads/2022/11/20221028_101632-Dhanshree-Shenwai-169×300.jpg” data-large-file=”https://www.marktechpost.com/wp-content/uploads/2022/11/20221028_101632-Dhanshree-Shenwai-576×1024.jpg”>

Dhanshree Shenwai is a Computer Science Engineer and has an excellent experience in FinTech firms covering Financial, Cards & Payments and Banking domain with keen interest in applications of AI. She is smitten by exploring recent technologies and advancements in today’s evolving world making everyone’s life easy.

🐝 [Featured Premium Article] Rask AI Breaks Latest Ground with Modern Lip-Sync Multi-Speaker Feature: A Leap Forward in Digital Communication


Please enter your comment!
Please enter your name here