Asa273 at 17:22, 23 November 2020

2020-11-23T17:22:59Z

← Older revision		Revision as of 13:22, 23 November 2020
Line 1:		Line 1:
			== Introduction ==

	Quantum computing (QC) is the next frontier in computation and has attracted a lot of attention from the scientific community in recent years. QC provides a novel approach to help solve some of the most complex optimization problems while offering an essential speed advantage over classical methods. <ref> M. A. Nielsen and I. L. Chuang, ''Quantum Computation and Quantum Information'' Cambridge University Press, 2010, p. 702.</ref> This is evident from QC techniques like Shor’s algorithm for integer factorization, <ref> P. W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring," presented at the Proceedings 35th Annual Symposium on ''Foundations of Computer Science'', 1994. </ref> and Grover's search algorithm for unstructured databases. <ref> L. K. Grover, [https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.79.325 "Quantum Mechanics Helps in Searching for a Needle in a Haystack]," ''Physical Review Letters'', vol. 79, pp. 325-328, 1997. </ref> Quantum adiabatic algorithms too are efficient optimization strategies that quickly search over the solution space. Quantum computers perform computation by inducing quantum speedups whose scaling far exceeds the capability of the most powerful classical computers. QC’s major applications can be perceived in areas of optimization, machine learning, cryptography, and quantum chemistry. <ref> J. Preskill, [https://ui.adsabs.harvard.edu/abs/2018arXiv180100862P "Quantum Computing in the NISQ era and beyond"] </ref> Despite the contrasting views on QC’s viability and performance, there is no doubt that QC holds great promise to open up a new era of computing.		Quantum computing (QC) is the next frontier in computation and has attracted a lot of attention from the scientific community in recent years. QC provides a novel approach to help solve some of the most complex optimization problems while offering an essential speed advantage over classical methods. <ref> M. A. Nielsen and I. L. Chuang, ''Quantum Computation and Quantum Information'' Cambridge University Press, 2010, p. 702.</ref> This is evident from QC techniques like Shor’s algorithm for integer factorization, <ref> P. W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring," presented at the Proceedings 35th Annual Symposium on ''Foundations of Computer Science'', 1994. </ref> and Grover's search algorithm for unstructured databases. <ref> L. K. Grover, [https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.79.325 "Quantum Mechanics Helps in Searching for a Needle in a Haystack]," ''Physical Review Letters'', vol. 79, pp. 325-328, 1997. </ref> Quantum adiabatic algorithms too are efficient optimization strategies that quickly search over the solution space. Quantum computers perform computation by inducing quantum speedups whose scaling far exceeds the capability of the most powerful classical computers. QC’s major applications can be perceived in areas of optimization, machine learning, cryptography, and quantum chemistry. <ref> J. Preskill, [https://ui.adsabs.harvard.edu/abs/2018arXiv180100862P "Quantum Computing in the NISQ era and beyond"] </ref> Despite the contrasting views on QC’s viability and performance, there is no doubt that QC holds great promise to open up a new era of computing.

Asa273: Created page with "Quantum computing (QC) is the next frontier in computation and has attracted a lot of attention from the scientific community in recent years. QC provides a novel approach to..."

2020-11-23T17:16:15Z

Created page with "Quantum computing (QC) is the next frontier in computation and has attracted a lot of attention from the scientific community in recent years. QC provides a novel approach to..."

New page

Quantum computing (QC) is the next frontier in computation and has attracted a lot of attention from the scientific community in recent years. QC provides a novel approach to help solve some of the most complex optimization problems while offering an essential speed advantage over classical methods. <ref> M. A. Nielsen and I. L. Chuang, ''Quantum Computation and Quantum Information'' Cambridge University Press, 2010, p. 702.</ref> This is evident from QC techniques like Shor’s algorithm for integer factorization, <ref> P. W. Shor, "Algorithms for quantum computation: discrete logarithms and factoring," presented at the Proceedings 35th Annual Symposium on ''Foundations of Computer Science'', 1994. </ref> and Grover's search algorithm for unstructured databases. <ref> L. K. Grover, [https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.79.325 "Quantum Mechanics Helps in Searching for a Needle in a Haystack]," ''Physical Review Letters'', vol. 79, pp. 325-328, 1997. </ref> Quantum adiabatic algorithms too are efficient optimization strategies that quickly search over the solution space. Quantum computers perform computation by inducing quantum speedups whose scaling far exceeds the capability of the most powerful classical computers. QC’s major applications can be perceived in areas of optimization, machine learning, cryptography, and quantum chemistry. <ref> J. Preskill, [https://ui.adsabs.harvard.edu/abs/2018arXiv180100862P "Quantum Computing in the NISQ era and beyond"] </ref> Despite the contrasting views on QC’s viability and performance, there is no doubt that QC holds great promise to open up a new era of computing.

== References ==
<references />

Quantum computing for optimization - Revision history

Asa273 at 17:22, 23 November 2020

Asa273: Created page with "Quantum computing (QC) is the next frontier in computation and has attracted a lot of attention from the scientific community in recent years. QC provides a novel approach to..."