Artificial Intelligence | News | Insights | AiThority
[bsfp-cryptocurrency style=”widget-18″ align=”marquee” columns=”6″ coins=”selected” coins-count=”6″ coins-selected=”BTC,ETH,XRP,LTC,EOS,ADA,XLM,NEO,LTC,EOS,XEM,DASH,USDT,BNB,QTUM,XVG,ONT,ZEC,STEEM” currency=”USD” title=”Cryptocurrency Widget” show_title=”0″ icon=”” scheme=”light” bs-show-desktop=”1″ bs-show-tablet=”1″ bs-show-phone=”1″ custom-css-class=”” custom-id=”” css=”.vc_custom_1523079266073{margin-bottom: 0px !important;padding-top: 0px !important;padding-bottom: 0px !important;}”]

With New Quantum Algorithm, Simple Photonic Machines Can Now Verify Quantum Advantage Exponentially Faster Than a Classical Supercomputer

Milestone experiment paves the way for verifying quantum solutions for significant industry applications

CNRS (Centre National de Recherche Scientifique / The French National Center for Scientific Research) announced that scientists from CNRS, the University of Edinburgh, and QC Ware have successfully demonstrated that a quantum machine using a new quantum algorithm can verify quantum advantage in seconds, while a classical computer can take thousands of years to perform the same task.

Iordanis Kerenidis, Senior Researcher, CNRS, and Head of Algorithms – International, QC Ware, is co-author of the research paper. The leading quantum algorithms expert conceived the project, designed the algorithm, and analyzed its performance.

Recommended AI News: Sweet Launches Broad-Scale NFT Solution for Leading Entertainment and Consumer Brands in Partnership With Bitcoin.com

The announcement is timed with the publication of the research paper “Experimental demonstration of quantum advantage for NP verification with limited information” in the February 8, 2021 issue of Nature Communications. The research paper details the verification protocol for quantum advantage and the results of the landmark experiment.

Related Posts
1 of 15,158

The experiment focused on verifying NP-complete problems using only a small and unverified slice of information. It implemented Kerenidis’ complex, interactive, algorithm which enabled a great reduction in quantum hardware requirements and the use of a simple, experimental, photonic system comprising two laser sources, a single-beam splitter, and two detectors.

Recommended AI News: FYX announces Blockchain Based Competitive eSports Platform

NP-complete problems refer to a large variety of the most significant computational problems in industry in a range of fields including manufacturing optimization, machine learning, server-client quantum computing, authentication systems, and blockchain technologies.

The top-speed quantum verification of such problems can open the way for trusted quantum cloud computing. Without gaining insight into a cloud quantum provider’s full quantum solutions, clients can verify or validate claims such as portfolio optimization with much higher returns or machine learning models with much higher accuracy.

“The verification algorithm shows that a client with a rudimentary quantum machine can verify claims, in seconds, without the quantum cloud provider having to reveal their full solution. Any classical computer that receives the same amount of limited information would take exponentially longer to do the same task,” said Kerenidis. “What the team has achieved is a quantum algorithm that further advances quantum application development.”

Recommended AI News: Urbint and National Grid Work Towards Preventing Serious Injuries or Fatalities to Utility Workers in the Field

Leave A Reply

Your email address will not be published.