Home > Articles > Impact of AI in Other Emerging Technologies

Impact of AI in Other Emerging Technologies

AI in Quantum Computing

In Chapter 3, “Securing the Digital Frontier: AI’s Role in Cybersecurity,” we explored how quantum computing, and particularly post-quantum cryptography with quantum key distribution (QKD), represents a cutting-edge field of study that leverages the principles of quantum physics to enable secure communication. AI can enhance quantum cryptography, such as in QKD, by optimizing protocols and improving security against quantum attacks. In addition to enhancing quantum cryptography like QKD, AI can contribute to quantum computing in the following areas (among others):

  • Quantum algorithm development

  • Quantum hardware optimization

  • Simulation and modeling

  • Control and operation

  • Data analysis and interpretation

  • Resource optimization

  • Quantum machine learning

Let’s explore these in more detail.

Quantum Algorithm Development

Quantum algorithms promise groundbreaking advancements in a variety of domains, including cryptography, materials science, and optimization problems. However, the design and optimization of these algorithms remain a significant challenge. This is where AI can provide some value added and benefits. With their ability to analyze complex systems and optimize parameters, AI implementations can become a pivotal player in the field of quantum algorithm development.

Quantum computing algorithms offer unique advantages over their classical counterparts in solving specific problems. Although the field is continually evolving, some algorithms have already gained prominence due to their innovative capabilities. The following are some of the most common and historical quantum computing algorithms:

  • Shor’s algorithm: Developed by Peter Shor, this algorithm is known for its ability to factorize large composite numbers exponentially faster than the best-known classical algorithms. Its efficiency poses a significant threat to RSA encryption in modern cryptography. The original paper describing Shor’s algorithm can be found at https://arxiv.org/abs/quant-ph/9508027.

  • Grover’s algorithm: Invented by Lov Grover, this algorithm provides a quadratic improvement over classical algorithms for unsorted database searching. You can learn more about the original research into Grover’s algorithm at https://arxiv.org/abs/quant-ph/9605043. You can interact with a demonstration of how a quantum circuit is implementing Grover’s search algorithm at https://demonstrations.wolfram.com/QuantumCircuitImplementingGroversSearchAlgorithm.

    Figure 7-1 demonstrates how the quantum circuit changes when a Grover’s iteration is added. The diagram in Figure 7-1 illustrates a quantum memory register containing four qubits, where three qubits are originally prepared in the state |0〉 and one ancillary qubit is in the state |1〉. (You can interact with this illustration at wolfram.com.)

  • Quantum Fourier transform (QFT): QFT is a quantum analog of the classical fast Fourier transform (FFT). It serves as a subroutine in several other quantum algorithms, most notably in Shor’s algorithm. You can learn more about the QFT algorithm at https://demonstrations.wolfram.com/QuantumFourierTransformCircuit/.

  • Variational quantum eigensolver (VQE): This algorithm is useful for solving problems related to finding ground states in quantum systems. It is often used in chemistry simulations to understand molecular structures. The VQE paper can be found at https://arxiv.org/abs/2111.05176. You can also access a detailed explanation of VQE at https://community.wolfram.com/groups/-/m/t/2959959.

  • Quantum approximate optimization algorithm (QAOA): An algorithm developed for solving combinatorial optimization problems, QAOA has applications in logistics, finance, and ML. It approximates the solution for problems where finding the exact solution is computationally expensive. The QAOA original research paper can be found at https://arxiv.org/abs/1411.4028.

  • Quantum phase estimation: This algorithm estimates the eigenvalue of a unitary operator, given one of its eigenstates. It serves as a component (a subroutine) in other algorithms, such as Shor’s Algorithm, and quantum simulations. You can obtain additional information about the quantum phase estimation implementation at https://quantumalgorithmzoo.org/#phase_estimation.

    Figure 7-1

    Figure 7-1 A Demonstration of Grover’s Search Algorithm

  • Quantum walk algorithms: Quantum walks are the quantum analogs of classical random walks and serve as a foundational concept for constructing various quantum algorithms. Quantum walks can be used in graph problems, element distinctness problems, and more. You can access the quantum walk algorithm original paper at: https://arxiv.org/abs/quant-ph/0302092.

  • BB84 protocol: Although it’s primarily known as a quantum cryptography protocol rather than a computation algorithm, BB84 is important because it provides a basis for QKD, securing communications against eavesdropping attacks, even those using quantum capabilities. A detailed explanation of the BB84 protocol can be found at https://medium.com/quantum-untangled/quantum-key-distribution-and-bb84-protocol-6f03cc6263c5.

  • Quantum error-correction codes: Although not algorithms in the traditional sense, quantum error-correction codes like the Toric code and the Cat code are essential for creating fault-tolerant quantum computers, mitigating the effects of decoherence and other errors. The quantum error-correction codes research paper can be accessed at https://arxiv.org/abs/1907.11157.

  • Quantum machine learning algorithms: This class of algorithms is designed to speed up classical ML tasks using quantum computing. Although this field is still in a nascent stage, it has garnered considerable interest for its potential to disrupt traditional ML techniques. You can access a research paper that surveys quantum ML algorithms at https://arxiv.org/abs/1307.0411.

Quantum computing operates on entirely different principles than classical computing, utilizing quantum bits or “qubits” instead of binary bits. While quantum computers promise to perform certain tasks exponentially faster, they come with their own set of challenges, such as error rates and decoherence. Additionally, the quantum world abides by different rules, making it inherently challenging to develop algorithms that can leverage the full potential of quantum processors.

Algorithmic Tuning and Automated Circuit Synthesis

Traditional quantum algorithms like Shor’s algorithm for factorization or Grover’s algorithm for search are efficient but often rigid in their construction. AI can offer dynamic tuning of these algorithms by optimizing the parameters to adapt to specific problems or hardware configurations. This level of customization can pave the way for more robust and versatile quantum algorithms, making quantum computing more accessible and applicable in real-world scenarios.

One of the most promising opportunities for applying AI in quantum computing is automated circuit synthesis. AI can assist researchers in finding the most efficient way to arrange the gates and qubits in a quantum circuit. For example, ML algorithms can analyze different circuit designs and suggest improvements that can result in faster and more reliable quantum computations. This task would be practically impossible for humans to perform at the same rate and level of complexity.

Hyperparameter Optimization, Real-Time Adaptation, and Benchmarking for Performance Analysis

Like their classical counterparts, quantum algorithms have hyperparameters that need fine-tuning to ensure their optimal performance. AI-driven optimization techniques such as grid search, random search, or even more advanced methods like Bayesian optimization can be used to find the optimal set of hyperparameters for a given quantum algorithm. This fine-tuning can result in significantly faster computational speeds and more accurate results.

In a quantum environment, system conditions can change rapidly due to factors like external noise or decoherence. AI models trained on monitoring quantum systems can adapt their algorithms in real time to account for these changes. These AI-driven adaptive algorithms can make quantum computing systems more resilient and consistent in performance.

AI can also assist in the comparative analysis and benchmarking of different quantum algorithms. By training ML models on a range of metrics such as speed, reliability, and resource utilization, it becomes easier to evaluate the efficiency of different algorithms, thereby guiding further research and development efforts.

3. How AI Can Revolutionize Quantum Hardware Optimization | Next Section Previous Section

Cisco Press Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from Cisco Press and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about Cisco Press products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites; develop new products and services; conduct educational research; and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@ciscopress.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by Cisco Press. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.ciscopress.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020