Difference between revisions of "Quantum"

From
Jump to: navigation, search
m
m
 
(196 intermediate revisions by the same user not shown)
Line 2: Line 2:
 
|title=PRIMO.ai
 
|title=PRIMO.ai
 
|titlemode=append
 
|titlemode=append
|keywords=artificial, intelligence, machine, learning, models, algorithms, data, singularity, moonshot, Tensorflow, Google, Nvidia, Microsoft, Azure, Amazon, AWS  
+
|keywords=ChatGPT, artificial, intelligence, machine, learning, GPT-4, GPT-5, NLP, NLG, NLC, NLU, models, data, singularity, moonshot, Sentience, AGI, Emergence, Moonshot, Explainable, TensorFlow, Google, Nvidia, Microsoft, Azure, Amazon, AWS, Hugging Face, OpenAI, Tensorflow, OpenAI, Google, Nvidia, Microsoft, Azure, Amazon, AWS, Meta, LLM, metaverse, assistants, agents, digital twin, IoT, Transhumanism, Immersive Reality, Generative AI, Conversational AI, Perplexity, Bing, You, Bard, Ernie, prompt Engineering LangChain, Video/Image, Vision, End-to-End Speech, Synthesize Speech, Speech Recognition, Stanford, MIT |description=Helpful resources for your journey with artificial intelligence; videos, articles, techniques, courses, profiles, and tools
|description=Helpful resources for your journey with artificial intelligence; videos, articles, techniques, courses, profiles, and tools  
+
 
 +
<!-- Google tag (gtag.js) -->
 +
<script async src="https://www.googletagmanager.com/gtag/js?id=G-4GCWLBVJ7T"></script>
 +
<script>
 +
  window.dataLayer = window.dataLayer || [];
 +
  function gtag(){dataLayer.push(arguments);}
 +
  gtag('js', new Date());
 +
 
 +
  gtag('config', 'G-4GCWLBVJ7T');
 +
</script>
 
}}
 
}}
[http://www.youtube.com/results?search_query=Quantum+machine+artificial+intelligence+deep+learning+simple YouTube search...]
+
[https://www.youtube.com/results?search_query=ai+Quantum YouTube search...]
[http://www.google.com/search?q=Quantum+deep+machine+learning+ML ...Google search]
+
[https://www.youtube.com/results?search_query=ai+Quantum YouTube]
 +
[https://www.quora.com/search?q=ai%20Quantum ... Quora]
 +
[https://www.google.com/search?q=ai+Quantum ...Google search]
 +
[https://news.google.com/search?q=ai+Quantum ...Google News]
 +
[https://www.bing.com/news/search?q=ai+Quantum&qft=interval%3d%228%22 ...Bing News]
  
 +
* [[Time]] ... [[Time#Positioning, Navigation and Timing (PNT)|PNT]] ... [[Time#Global Positioning System (GPS)|GPS]] ... [[Causation vs. Correlation#Retrocausality| Retrocausality]] ... [[Quantum#Delayed Choice Quantum Eraser|Delayed Choice Quantum Eraser]] ... [[Quantum]]
 +
* [[Telecommunications]] ... [[Computer Networks]] ... [[Telecommunications#5G|5G]] ... [[Satellite#Satellite Communications|Satellite Communications]] ... [[Quantum Communications]] ... [[Agents#Communication | Agents]] ... [[AI Generated Broadcast Content|AI Broadcast; Radio, Stream, TV]]
 
* News
 
* News
** [http://medium.com/quantum-tech Quantum Tech | Nathan Shammah]
+
** [https://medium.com/quantum-tech Quantum Tech | Nathan Shammah]
** [http://qutech.nl/news/ News | QuTech]
+
** [https://qutech.nl/news/ News | QuTech]
** [http://news.google.com/search?q=quantum%20machine%20learning&hl=en-US&gl=US&ceid=US%3Aen Google News]  
+
** [https://news.google.com/search?q=quantum%20machine%20learning&hl=en-US&gl=US&ceid=US%3Aen Google News]  
** [http://quantumweekly.com/ Quantum Weekly]
+
** [https://quantumweekly.com/ Quantum Weekly]
 
* [[Processing Units - CPU, GPU, APU, TPU, VPU, FPGA, QPU]]
 
* [[Processing Units - CPU, GPU, APU, TPU, VPU, FPGA, QPU]]
* [http://github.com/qosf/os_quantum_software Open-Source Quantum Software Projects | GitHub]
+
* [[Math for Intelligence]] ... [[Finding Paul Revere]] ... [[Social Network Analysis (SNA)]] ... [[Dot Product]] ... [[Kernel Trick]]
* [[Math for Intelligence]]
+
** [[Time#Quantum Sensors in Navigation|  Quantum Sensors in Navigation]]
* [[Time]]
 
 
* [[Bayes#Quantum Bayesianism|Quantum Bayesianism]]
 
* [[Bayes#Quantum Bayesianism|Quantum Bayesianism]]
* [http://blogs.scientificamerican.com/cross-check/quantum-computing-for-english-majors/ Quantum Computing for English Majors | John Horgan - Scientific American]
+
* [[Materials]]
* [http://www.technologyreview.com/s/612844/what-is-quantum-computing/ Explainer: What is a quantum computer? | MIT Technology Review]
+
* [https://github.com/qosf/os_quantum_software Open-Source Quantum Software Projects | GitHub]
* [http://betanews.com/2020/02/17/quantum-computing-encryption-cracking/ The $600 quantum computer that could spell the end for conventional encryption | Ian Barker - Betanews]
+
* [https://blogs.scientificamerican.com/cross-check/quantum-computing-for-english-majors/ Quantum Computing for English Majors | John Horgan - Scientific American]
 +
* [https://www.technologyreview.com/s/612844/what-is-quantum-computing/ Explainer: What is a quantum computer? | MIT Technology Review]
 +
* [https://betanews.com/2020/02/17/quantum-computing-encryption-cracking/ The $600 quantum computer that could spell the end for conventional encryption | Ian Barker - Betanews]
 
* Machine Learning to assist Quantum processing...
 
* Machine Learning to assist Quantum processing...
** [http://www.eurekalert.org/pub_releases/2019-09/sniu-mla092619.php Machine learning at the quantum lab | Swiss Nanoscience Institute, University of Basel] "For the first time, we've applied machine learning to perform efficient measurements in gallium arsenide quantum dots..."
+
** [https://www.eurekalert.org/pub_releases/2019-09/sniu-mla092619.php Machine learning at the quantum lab | Swiss Nanoscience Institute, University of Basel] "For the first time, we've applied machine learning to perform efficient measurements in gallium arsenide quantum dots..."
** [http://ai.googleblog.com/2019/10/improving-quantum-computation-with.html Improving Quantum Computation with Classical Machine Learning | Google] engineers have developed a reinforcement learning algorithm for something they call “quantum control optimization”.
+
** [https://ai.googleblog.com/2019/10/improving-quantum-computation-with.html Improving Quantum Computation with Classical Machine Learning | Google] engineers have developed a reinforcement learning algorithm for something they call “quantum control optimization”.
* [http://www.zapatacomputing.com/ ZapataComputing]
+
* [https://www.zapatacomputing.com/ ZapataComputing]
 +
* [https://theory.cs.princeton.edu/complexity/book.pdf Computational Complexity: A Modern Approach | Sanjeev Arora, Boaz Barak] ... describes achievements of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. ... [https://en.wikipedia.org/wiki/Randomized_algorithm#Derandomization Randomness can be viewed as a resource, like space and time.]
 +
* [https://www.zdnet.com/article/what-cios-need-to-know-about-quantum-computing-free-pdf/ The CIO's guide to quantum computing | ZDNet]
 
* Browser-based Sandboxes:
 
* Browser-based Sandboxes:
** [http://algassert.com/quirk Quirk]
+
** [https://algassert.com/quirk Quirk]
** [http://www.quantumplayground.net/#/home Quantum Computing Playground]
+
** [https://www.quantumplayground.net/#/home Quantum Computing Playground]
** [http://cnotmz.appspot.com/# Quantum in the Cloud | University of Bristol] - provides a free, open web interface to a small-scale quantum photonic chip
+
** [https://cnotmz.appspot.com/# Quantum in the Cloud | University of Bristol] - provides a free, open web interface to a small-scale quantum photonic chip
** [http://quantum-circuit.com/ Quantum Programming Studio] quantum programming IDE and simulator
+
** [https://quantum-circuit.com/ Quantum Programming Studio] quantum programming IDE and simulator
* [http://scitechdaily.com/how-a-quantum-physicist-invented-new-code-to-achieve-what-many-thought-was-impossible/ How a Quantum Physicist Invented New Code to Achieve What Many Thought Was Impossible | University of Sydney]
+
* [https://scitechdaily.com/how-a-quantum-physicist-invented-new-code-to-achieve-what-many-thought-was-impossible/ How a Quantum Physicist Invented New Code to Achieve What Many Thought Was Impossible | University of Sydney]
* [http://www.cnet.com/news/honeywell-says-its-got-the-fastest-quantum-computer-on-the-planet/ Honeywell says it's got the fastest quantum computer on the planet | Stephen Shankland - C/NET]
+
* [https://www.cnet.com/news/honeywell-says-its-got-the-fastest-quantum-computer-on-the-planet/ Honeywell says it's got the fastest quantum computer on the planet | Stephen Shankland - C/NET]
 +
* [https://www.youtube.com/shorts/9cExml-ue4E What Does An Electron Look Like | ActionLabShorts]  
  
  
 
<hr>
 
<hr>
  
<i>Every quantum computer is fundamentally a sampler that starts with a simple probability distribution over all possible measurement outcomes, computes a more complicated distribution, and samples an outcome via a measurement.</i> [http://medium.com/xanaduai/quantum-machine-learning-1-0-76a525c8cf69 Quantum Machine Learning 1.0 | Maria Schuld - Xanadu - Medium]
+
<i>Every quantum computer is fundamentally a sampler that starts with a simple probability distribution over all possible measurement outcomes, computes a more complicated distribution, and samples an outcome via a measurement.</i> [https://medium.com/xanaduai/quantum-machine-learning-1-0-76a525c8cf69 Quantum Machine Learning 1.0 | Maria Schuld - Xanadu - Medium]
  
  
 
<hr>
 
<hr>
  
<youtube>yhGATzzzQjM</youtube>
+
 
 +
<youtube>CMdHDHEuOUE</youtube>
 +
 
  
  
 
Quantum computing is a type of non-classical computing based on the quantum state of subatomic particles. It differs fundamentally from classic computers, which operate using binary bits. Basic properties of quantum world:  
 
Quantum computing is a type of non-classical computing based on the quantum state of subatomic particles. It differs fundamentally from classic computers, which operate using binary bits. Basic properties of quantum world:  
 +
 
* <span id="Superposition"></span><b><i>Superposition</i></b> -  quantum computing uses quantum bits, or [[Quantum#Qubit|Qubit]]s. One [[Quantum#Qubit|Qubit]] can represent a range of values, which is known as ‘superpositioning’; in addition the two states, 0 and 1, a quantum system can be in the two states at a time; the power to be a wave and a particle, at the same time.  
 
* <span id="Superposition"></span><b><i>Superposition</i></b> -  quantum computing uses quantum bits, or [[Quantum#Qubit|Qubit]]s. One [[Quantum#Qubit|Qubit]] can represent a range of values, which is known as ‘superpositioning’; in addition the two states, 0 and 1, a quantum system can be in the two states at a time; the power to be a wave and a particle, at the same time.  
<youtube>IrbJYsep45E</youtube>
+
<youtube>hkmoZ8e5Qn0</youtube>
 +
 
 
* <span id="Entanglement"></span><b><i>Entanglement</i></b> - a physical phenomenon whereby two particles remain interconnected, sharing physical traits regardless of how far apart they are from one another. [[Quantum#Qubit|Qubit]] can also be linked together (known as “entanglement”). Each entangled [[Quantum#Qubit|Qubit]] adds two additional dimensions to the system; the correlation of two or more system in a ensemble. Which means even if two two system are spatially separated the measurement of any observable will be effected by the other. Like having a twin where if one is affected then simultaneously so is the other.  <i>"Spooky action at a distance", Albert Einstein</i>
 
* <span id="Entanglement"></span><b><i>Entanglement</i></b> - a physical phenomenon whereby two particles remain interconnected, sharing physical traits regardless of how far apart they are from one another. [[Quantum#Qubit|Qubit]] can also be linked together (known as “entanglement”). Each entangled [[Quantum#Qubit|Qubit]] adds two additional dimensions to the system; the correlation of two or more system in a ensemble. Which means even if two two system are spatially separated the measurement of any observable will be effected by the other. Like having a twin where if one is affected then simultaneously so is the other.  <i>"Spooky action at a distance", Albert Einstein</i>
 
** [[Quantum#Quantum Teleportation|Quantum Teleportation]]
 
** [[Quantum#Quantum Teleportation|Quantum Teleportation]]
** [http://arstechnica.com/science/2020/02/researchers-entangle-quantum-memory-using-standard-optical-fiber/ Researchers entangle quantum memory at facilities over 50km apart | John Timmer - ars Technica]
+
** [https://arstechnica.com/science/2020/02/researchers-entangle-quantum-memory-using-standard-optical-fiber/ Researchers entangle quantum memory at facilities over 50km apart | John Timmer - ars Technica]
 +
** [https://www.popsci.com/technology/quantum-entanglement-nasa-demo/ NASA is launching a new quantum entanglement experiment in space | Charotte Hu - Popular Science] ... The researchers will test if their tech can produce and detect quantum entanglement on the International Space Station.
 +
** [https://arxiv.org/pdf/2112.07978.pdf Entanglement between superconducting qubits and a tardigrade | K. S. Lee, Y. P. Tan, L. H. Nguyen R. P. Budoyo, K. H. Park, C. Hufnagel, Y. S. Yap, N. Møbjerg, V. Vedral, T. Paterek, and R. Dumke1]
 +
*** [https://www.livescience.com/tardigrade-quantum-entangled-experiment Frozen tardigrade becomes first 'quantum entangled' animal in history, researchers claim | Brandon Spector - LiveScience]  ...Spooky action in a piglet
 +
** [https://www.tomshardware.com/news/record-on-quantum-entanglement-at-a-distance-broken-pulling-in-the-timeline-for-a-quantum-internet China Breaks Record for Quantum Memory Entanglement Distance | Francisco Pires - Tom's Hardware]... Two quantum memories were entangled while 12.5 km apart.
 +
 
 +
 
 +
https://upload.wikimedia.org/wikipedia/commons/0/08/Waterbear.jpg  [https://en.wikipedia.org/wiki/Tardigrade Wikipedia - Tardigrade]
 +
 
 
<youtube>tafGL02EUOA</youtube>
 
<youtube>tafGL02EUOA</youtube>
* [http://www.sciencealert.com/this-is-the-first-ever-photo-of-quantum-entanglement Looking Back on The First-Ever Photo of Quantum Entanglement | Fionia MacDonald - Science Alert]
+
 
 +
* [https://www.sciencealert.com/this-is-the-first-ever-photo-of-quantum-entanglement Looking Back on The First-Ever Photo of Quantum Entanglement | Fionia MacDonald - Science Alert]
  
  
 
= What Will We Do With Quantum Computing? =
 
= What Will We Do With Quantum Computing? =
A large-scale quantum computer would be able to solve problems that existing classical computers would take much longer than the age of the universe to solve. This would have dramatic implications for cryptography, chemistry, material science, nuclear physics and probably other areas that are still un- known. But what about quantum computers that will be available in the next few years? [http://www.youtube.com/watch?v=dU8_wSDhIFU&list=PLUyiJmJq9iUQUy_eDJ09RodJVyNoml6mz What Will We Do With Quantum Computing?]
 
  
[http://www.techradar.com/news/the-cios-guide-to-quantum-computing The CIO’s guide to quantum computing | TechRadar Pro] - Quantum computing could enable breakthroughs in:  
+
* [https://www.mckinsey.com/business-functions/mckinsey-digital/our-insights/quantum-computing-use-cases-are-getting-real-what-you-need-to-know Industry use cases Quantum computing use cases are getting real—what you need to know | McKinsey Report]
 +
 
 +
A large-scale quantum computer would be able to solve problems that existing classical computers would take much longer than the age of the universe to solve. This would have dramatic implications for cryptography, chemistry, material science, nuclear physics and probably other areas that are still un- known. But what about quantum computers that will be available in the next few years? [https://www.youtube.com/watch?v=dU8_wSDhIFU&list=PLUyiJmJq9iUQUy_eDJ09RodJVyNoml6mz What Will We Do With Quantum Computing?]
 +
 
 +
[https://www.techradar.com/news/the-cios-guide-to-quantum-computing The CIO’s guide to quantum computing | TechRadar Pro] - Quantum computing could enable breakthroughs in:  
 +
 
  
 
* Machine learning: Improved ML through faster structured prediction. Examples include Boltzmann machines, quantum Boltzmann machines, semi-supervised learning, unsupervised learning and deep learning;
 
* Machine learning: Improved ML through faster structured prediction. Examples include Boltzmann machines, quantum Boltzmann machines, semi-supervised learning, unsupervised learning and deep learning;
Line 68: Line 104:
 
* Computer science: Faster multidimensional search functions; for example, query optimization, mathematics and simulations.
 
* Computer science: Faster multidimensional search functions; for example, query optimization, mathematics and simulations.
  
=== Cryptography ===
 
If quantum computers became practical, they will destroy the security of our currently deployed public-key cryptographic solutions (such as RSA or ECDSA). The majority of our telecommunications channels make use of these encryption schemes to provide confidentiality, authentication and integrity.
 
  
* [http://www.idquantique.com/nist-standardisation-of-post-quantum-cryptography/ NIST Standardisation of Post-Quantum Cryptography | IDQ]
+
Source: [https://www.mckinsey.com/ McKinsey & Company]  [https://www.zdnet.com/article/quantum-computers-are-coming-get-ready-for-them-to-change-everything/ Quantum computers are coming. Get ready for them to change everything | Daphne Leprince-Ringuet - ZDNet]
 +
 
 +
https://zdnet2.cbsistatic.com/hub/i/2020/10/21/8a707441-0784-48bd-9075-a735fff0538f/mckinsey-quantum-infographic.png
 +
 
 +
<youtube>Y6ZaeNlVRsE</youtube>
 +
<youtube>kEJBxotcxRw</youtube>
 +
<youtube>u9zx7QOKPno</youtube>
 +
<youtube>3BKIJCTLy-s</youtube>
 +
<youtube>dU8_wSDhIFU</youtube>
 +
<youtube>HWxhQKo3Vh4</youtube>
 +
<youtube>u1XXjWr5frE</youtube>
 +
 
 +
 
 +
=== <span id="Cryptography"></span>Cryptography ===
 +
[https://www.youtube.com/results?search_query=Quantum+Cryptography YouTube search...]
 +
[https://www.google.com/search?q=Quantum+Cryptography ...Google search]
 +
 
 +
* [[Cybersecurity]]
 +
* [[National Institute of Standards and Technology (NIST)#Post-Quantum Cryptography (PQC) | Post-Quantum Cryptography (PQC)]]
 +
* [[Quantum#Schnorr's Algorithm|Schnorr's Algorithm]]
 +
* [https://www.congress.gov/bill/117th-congress/house-bill/7535/text Quantum Computing Cybersecurity Preparedness Act] December 21, 2022
 +
* [https://www.fedscoop.com/quantum-crytography-experts-long-transition/ Post-quantum cryptography experts brace for long transition despite White House deadlines | Dave Nyczepir - FedScoop]
 +
* [https://www.sdxcentral.com/articles/interview/cisco-bets-on-quantum-key-distribution/2022/12/ Cisco Bets on Quantum Key Distribution | Nancy Liu - SDX Central]
 +
 
 +
If quantum computers became practical, they will destroy the security of our currently deployed public-key cryptographic solutions (such as RSA or ECDSA). The majority of our telecommunications channels make use of these encryption schemes to provide confidentiality, authentication and integrity. 
 +
 
 +
Quantum cryptography is the science of exploiting quantum mechanical properties to perform cryptographic tasks. The best known example of quantum cryptography is quantum key distribution which offers an information-theoretically secure solution to the key exchange problem. The advantage of quantum cryptography lies in the fact that it allows the completion of various cryptographic tasks that are proven or conjectured to be impossible using only classical (i.e. non-quantum) communication. For example, it is impossible to copy data encoded in a quantum state. If one attempts to read the encoded data, the quantum state will be changed due to wave function collapse (no-cloning theorem). This could be used to detect eavesdropping in quantum key distribution (QKD). - [https://en.wikipedia.org/wiki/Quantum_cryptography Quantum Cryptography | Wikipedia]
 +
 
 +
 
 +
<youtube>dPqNZ4aya8s</youtube>
 +
 
 +
=== <span id="Quantum Communications"></span>[[Quantum Communications]] ===
 +
[https://www.youtube.com/results?search_query=Quantum+Internet+Communications YouTube search...]
 +
[https://www.google.com/search?q=Quantum+Internet+Communications ...Google search]
 +
 
 +
* [[Telecommunications]] ... [[Computer Networks]] ... [[Telecommunications#5G|5G]] ... [[Satellite#Satellite Communications|Satellite Communications]] ... [[Quantum Communications]] ... [[Agents#Communication | Agents]] ... [[AI Generated Broadcast Content|AI Broadcast; Radio, Stream, TV]]
  
=== Quantum Internet / Communications ===
 
 
Quantum entanglement, and what it mean for the future of the Internet where information is created, stored and moved around in ways that mirror the bizarre behavior of the quantum world - sending quantum information instead of classical information.
 
Quantum entanglement, and what it mean for the future of the Internet where information is created, stored and moved around in ways that mirror the bizarre behavior of the quantum world - sending quantum information instead of classical information.
  
* [http://scitechdaily.com/u-s-department-of-energy-unveils-blueprint-for-quantum-internet/ U.S. Department of Energy Unveils Blueprint for Quantum Internet | Brookhaven National Laboratory - U.S. Department of Energy (DOE)]
 
* [http://phys.org/news/2020-03-one-kilometer-breakthrough-quantum-field.html One-kilometer breakthrough made in quantum field | Phys.org]
 
* [http://www.picoquant.com/applications/category/quantum-optics/quantum-communication Quantum Optics | PicoQuant]
 
* [http://www.technologyreview.com/s/612964/what-is-quantum-communications/ Explainer: What is quantum communication? | Martin Giles - MIT Technology Review]
 
* [http://www.zdnet.com/article/quantum-entanglement-breakthrough-could-boost-encryption-secure-communications/ Quantum entanglement breakthrough could boost encryption, secure communications | Daphne Leprince-Ringuet - ZDNet]
 
* [http://phys.org/news/2020-03-scientists-quantum-sensor-entire-radio.html Scientists create quantum sensor that covers entire radio frequency spectrum | The Army Research Laboratory - Phys.org]
 
* [http://www.scientificamerican.com/article/the-quantum-internet-is-emerging-one-experiment-at-a-time/ The Quantum Internet Is Emerging, One Experiment at a Time | Anil Ananthaswamy - Scientific American] Breakthrough demonstrations using defective diamonds, high-flying drones, laser-bathed crystals and other exotica suggest practical, unhackable quantum networks are within reach
 
  
=== Detection/sensor technology ===
+
<youtube>2UYGhJjdEzU</youtube>
A quantum sensor is a quantum device that responds to a stimulus. Usually this refers to a sensor which has quantized energy levels, uses quantum coherence to measure physical quantity, or uses entanglement to improve measurements beyond what can be done with classical sensors. ... You can coherently manipulate the sensor. [http://en.wikipedia.org/wiki/Quantum_sensor Quantum sensor | Wikipedia]
+
<youtube>rxeDM0zFULU</youtube>
  
* [http://phys.org/news/2020-05-scientists-quantum-radar-prototype.html Scientists demonstrate quantum radar prototype |  Institute of Science and Technology Austria - Phys.org]
+
 
 +
=== Detection/Sensor Technology ===
 +
[https://www.youtube.com/results?search_query=Quantum+Detection+Sensor YouTube search...]
 +
[https://www.google.com/search?q=Quantum+Detection+Sensor ...Google search]
 +
 
 +
* [https://www.defenseone.com/ideas/2022/06/quantum-sensorsunlike-quantum-computersare-already-here/368634/ Quantum Sensors—Unlike Quantum Computers—Are Already Here | Chris Jay - Defense One] ... And they’re improving at a rate that demands urgent attention
 +
 
 +
A quantum sensor is a quantum device that responds to a stimulus. Usually this refers to a sensor which has quantized energy levels, uses quantum coherence to measure physical quantity, or uses entanglement to improve measurements beyond what can be done with classical sensors. ... You can coherently manipulate the sensor. [https://en.wikipedia.org/wiki/Quantum_sensor Quantum sensor | Wikipedia]
 +
 
 +
<youtube>5uqiQ_mP3PM</youtube>
 +
 
 +
==== <span id="Quantum Radar"></span>Quantum Radar ====
 +
[https://www.youtube.com/results?search_query=Quantum+Radar YouTube search...]
 +
[https://www.google.com/search?q=Quantum+Radar ...Google search]
 +
 
 +
* [[Defense]]
 +
* [[Signal Processing]]
 +
* [https://phys.org/news/2020-05-scientists-quantum-radar-prototype.html Scientists demonstrate quantum radar prototype |  Institute of Science and Technology Austria - Phys.org]
 +
* [https://www.businessinsider.com/china-says-it-has-a-new-ghostly-quantum-radar-that-can-spot-us-stealth-aircraft-2016-9 China says it has a new 'ghostly' quantum radar that can spot US stealth aircraft | Stephen Chen - South China Morning Post]
 +
* [https://physics.aps.org/articles/v8/18 Quantum Mechanics Could Improve Radar | S. Barzanjeh, S. Guha, C. Weedbrook, D. Vitali, J. Shapiro, & S. Pirandola -][https://physics.aps.org/ Physics]
 +
 
 +
Quantum radar is a speculative remote-sensing technology based on quantum-mechanical effects, such as the uncertainty principle or quantum entanglement. Broadly speaking, a quantum radar can be seen as a device working in the microwave range, which exploits quantum features, from the point of view of the radiation source and/or the output detection, and is able to outperform a classical counterpart. One approach is based on the use of input quantum correlations (in particular, quantum entanglement) combined with a suitable interferometric quantum detection at the receiver (strongly related to the protocol of quantum illumination). ... One way to defeat conventional radar systems is to broadcast signals on the same frequencies used by the radar, making it impossible for the receiver to distinguish between their own broadcasts and the spoofing signal (or "jamming"). However, such systems cannot know, even in theory, what the original quantum state of the radar's internal signal was. Lacking such information, their broadcasts will not match the original signal and will be filtered out in the correlator. Environmental sources, like ground clutter and aurora, will similarly be filtered out. [https://en.wikipedia.org/wiki/Quantum_radar Wikipedia]
 +
 
 +
 
 +
 
 +
https://physics.aps.org/assets/d2e54dda-6537-4339-a40f-850f3b55d834/e18_1_medium.png
 +
 
 +
At the core of the proposed method is a means of interconverting microwave and optical signals using a so-called electro-optomechanical converter. This device would consist of optical and microwave cavities for storing each kind of radiation, with a nanoscale vibrating object (such as a piezoelectric crystal or a metallic membrane) serving as the connection between the two. The oscillator can couple electromagnetic vibrations in the two cavities, despite their different frequencies.
 +
 
 +
<youtube>8km2h2Cip3A</youtube>
 +
<youtube>OpoktdWZi_o</youtube>
  
 
=== Games ===
 
=== Games ===
* [http://quantumfrontiers.com/2019/07/15/tiqtaqtoe/ Introducing a new game: Quantum TiqTaqToe | Evert van Nieuwenburg] - [http://quantumfrontiers.com/ Institute for Quantum Information and Matter @ Caltech]
+
[https://www.youtube.com/results?search_query=Quantum+Game YouTube search...]
* [http://medium.com/hackernoon/game-jamming-on-a-quantum-computer-36a13723a454 Game Jamming on a Quantum Computer | James Wootton] - [http://medium.com/@decodoku Interesting posts on quantum computation]
+
[https://www.google.com/search?q=Quantum+Game ...Google search]
* [http://algassert.com/post/1905 Spooky Pebble Games and Irreversible Uncomputation] - [http://algassert.com/ Algorithmic Assertions]
+
 
* [http://github.com/HuangJunye/QPong QPong | H. Junye, J. Reilly, A. Jeffery, and J. Weaver] - A quantum version of the classic Pong using Qiskit and PyGame. [http://www.youtube.com/watch?v=a1NZC5rqQD8 Quantum Pong video]
+
* [[Games - Quantum Theme]]
 +
* [[Quantum#Quantum Chess|Quantum Chess]]
 +
* [https://quantumfrontiers.com/2019/07/15/tiqtaqtoe/ Introducing a new game: Quantum TiqTaqToe | Evert van Nieuwenburg] - [https://quantumfrontiers.com/ Institute for Quantum Information and Matter @ Caltech]
 +
* [https://medium.com/hackernoon/game-jamming-on-a-quantum-computer-36a13723a454 Game Jamming on a Quantum Computer | James Wootton] - [https://medium.com/@decodoku Interesting posts on quantum computation]
 +
* [https://algassert.com/post/1905 Spooky Pebble Games and Irreversible Uncomputation] - [https://algassert.com/ Algorithmic Assertions]
 +
* [https://github.com/HuangJunye/QPong QPong | H. Junye, J. Reilly, A. Jeffery, and J. Weaver] - A quantum version of the classic Pong using Qiskit and PyGame. [https://www.youtube.com/watch?v=a1NZC5rqQD8 Quantum Pong video]
 +
* [https://quantumgame.io/ Quantum Game | Quantum Flytrap] - an in-browser simulation & visualization of quantum mechanics
 +
* [https://www.wilsoncenter.org/blog-post/games-round-quantum-computing Games Round Up: Quantum Computing | Morgan Livingston Richard Liu]
 +
 
 +
<youtube>u1DWjV9hZEo</youtube>
  
 
=== Quantum Natural Language Processing ===
 
=== Quantum Natural Language Processing ===
 +
[https://www.youtube.com/results?search_query=Quantum+Natural+Language+Processing+NLP+machine+artificial+intelligence+deep+learning+ML YouTube search...]
 +
[https://www.google.com/search?q=Quantum+Natural+Language+Processing+NLP+machine+artificial+intelligence+deep+learning+ML ...Google search]
 +
 
One particularly interesting aspect of this graphical framework for linguistics was that the networks were inherited from previous work that provided quantum theory with an entirely network-like language.
 
One particularly interesting aspect of this graphical framework for linguistics was that the networks were inherited from previous work that provided quantum theory with an entirely network-like language.
  
* [http://medium.com/cambridge-quantum-computing/quantum-natural-language-processing-748d6f27b31d Quantum Natural Language Processing | B. Coecke, G. de Felice, K. Meichanetzidis, and A. Toumi CQC]
+
* [https://medium.com/cambridge-quantum-computing/quantum-natural-language-processing-748d6f27b31d Quantum Natural Language Processing | B. Coecke, G. de Felice, K. Meichanetzidis, and A. Toumi CQC]
* [http://www.cambridge.org/us/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation/picturing-quantum-processes-first-course-quantum-theory-and-diagrammatic-reasoning?format=HB Picturing Quantum Processes | Bob Coecke and Aleks Kissinger]
+
* [https://www.cambridge.org/us/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation/picturing-quantum-processes-first-course-quantum-theory-and-diagrammatic-reasoning?format=HB Picturing Quantum Processes | Bob Coecke and Aleks Kissinger]
 +
* [https://venturebeat.com/ai/quantum-machine-learning-qml-poised-to-make-a-leap-in-2023/ Quantum machine learning (QML) poised to make a leap in 2023 |  Sri Krishna - VentureBeat]
  
<img src="http://miro.medium.com/max/1346/1*UAj8CVHbmUVI0lK9MbnVaQ.png" width="250" height="100">
+
<img src="https://miro.medium.com/max/1346/1*UAj8CVHbmUVI0lK9MbnVaQ.png" width="250" height="100">
  
<youtube>Y6ZaeNlVRsE</youtube>
+
== Quantum Machine Learning (QML) ==
<youtube>kEJBxotcxRw</youtube>
+
[https://www.youtube.com/results?search_query=Quantum+QML+machine+artificial+intelligence+deep+learning YouTube search...]
<youtube>u9zx7QOKPno</youtube>
+
[https://www.google.com/search?q=Quantum+QML+machine+artificial+intelligence+deep+learning ...Google search]
<youtube>3BKIJCTLy-s</youtube>
 
<youtube>j7atw7THKho</youtube>
 
<youtube>dU8_wSDhIFU</youtube>
 
<youtube>HWxhQKo3Vh4</youtube>
 
<youtube>u1XXjWr5frE</youtube>
 
  
== Quantum Machine Learning (QML) ==
+
Quantum machine learning is an emerging interdisciplinary research area at the intersection of quantum physics and machine learning. The most common use of the term refers to machine learning algorithms for the analysis of classical data executed on a quantum computer, i.e. quantum-enhanced machine learning. While machine learning algorithms are used to compute immense quantities of data, quantum machine learning increases such capabilities intelligently, by creating opportunities to conduct analysis on quantum states and systems. This includes hybrid methods that involve both classical and quantum processing, where computationally difficult subroutines are outsourced to a quantum device. These routines can be more complex in nature and executed faster with the assistance of quantum devices. Furthermore, quantum algorithms can be used to analyze quantum states instead of classical data. [https://en.wikipedia.org/wiki/Quantum_machine_learning Quantum machine learning | Wikipedia]
Quantum machine learning is an emerging interdisciplinary research area at the intersection of quantum physics and machine learning. The most common use of the term refers to machine learning algorithms for the analysis of classical data executed on a quantum computer, i.e. quantum-enhanced machine learning. While machine learning algorithms are used to compute immense quantities of data, quantum machine learning increases such capabilities intelligently, by creating opportunities to conduct analysis on quantum states and systems. This includes hybrid methods that involve both classical and quantum processing, where computationally difficult subroutines are outsourced to a quantum device. These routines can be more complex in nature and executed faster with the assistance of quantum devices. Furthermore, quantum algorithms can be used to analyze quantum states instead of classical data. [http://en.wikipedia.org/wiki/Quantum_machine_learning Quantum machine learning | Wikipedia]
 
  
 
* [[Quantum Generative Adversarial Learning (QuGAN - QGAN)]]  
 
* [[Quantum Generative Adversarial Learning (QuGAN - QGAN)]]  
* [http://arxiv.org/pdf/1804.03719.pdf Quantum Algorithm Implementations for Beginners | P. Coles, S. Eidenbenz, S. Pakin, A. Adedoyin, J. Ambrosiano, P. Anisimov, W. Casper, G. Chennupati, C. Coffrin, H. Djidjev, D. Gunter, S. Karra, N. Lemons, S. Lin, A. Lokhov, A. Malyzhenkov, D. Mascarenas, S. Mniszewski, B. Nadiga, D. O'Malley, D. Oyen, L. Prasad, R. Roberts, P. Romero, N. Santhi, N. Sinitsyn, P. Swart, M. Vuffray, J. Wendelberger, B. Yoon, R. Zamora, and W. Zhu]
+
* [https://arxiv.org/pdf/1804.03719.pdf Quantum Algorithm Implementations for Beginners | P. Coles, S. Eidenbenz, S. Pakin, A. Adedoyin, J. Ambrosiano, P. Anisimov, W. Casper, G. Chennupati, C. Coffrin, H. Djidjev, D. Gunter, S. Karra, N. Lemons, S. Lin, A. Lokhov, A. Malyzhenkov, D. Mascarenas, S. Mniszewski, B. Nadiga, D. O'Malley, D. Oyen, L. Prasad, R. Roberts, P. Romero, N. Santhi, N. Sinitsyn, P. Swart, M. Vuffray, J. Wendelberger, B. Yoon, R. Zamora, and W. Zhu]
* [http://phys.org/news/2019-07-simulating-quantum-neural-networks.html Simulating quantum systems with neural networks | Ecole Polytechnique Federale de Lausanne - PHYS.ORG]
+
* [https://phys.org/news/2019-07-simulating-quantum-neural-networks.html Simulating quantum systems with neural networks | Ecole Polytechnique Federale de Lausanne - PHYS.ORG]
  
 +
<youtube>V7NPLAcHOv0</youtube>
 +
<youtube>nk7oEdtTIEw</youtube>
 
<youtube>2lawJjrnvrY</youtube>
 
<youtube>2lawJjrnvrY</youtube>
 
<youtube>SxtQ_n6WdCY</youtube>
 
<youtube>SxtQ_n6WdCY</youtube>
Line 125: Line 225:
  
 
=== <span id="PennyLane"></span>PennyLane ===
 
=== <span id="PennyLane"></span>PennyLane ===
[http://www.youtube.com/results?search_query=PennyLane+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=PennyLane+quantum Youtube search...]
[http://www.google.com/search?q=PennyLane+quantum ...Google search]
+
[https://www.google.com/search?q=PennyLane+quantum ...Google search]
  
PennyLane is a cross-platform Python library for quantum machine learning, automatic differentiation, and optimization of hybrid quantum-classical computations. The first dedicated machine learning platform for quantum computers
+
PennyLane is a cross-platform [[Python]] library for quantum machine learning, automatic differentiation, and optimization of hybrid quantum-classical computations. The first dedicated machine learning platform for quantum computers
  
* [http://pennylane.ai/ PennyLane | Xanadu]
+
* [https://pennylane.ai/ PennyLane | Xanadu]
* [http://github.com/XanaduAI PennyLane | GitHub]
+
* [https://github.com/XanaduAI PennyLane | GitHub]
 
* [[Quantum#Xanadu|Xanadu]]
 
* [[Quantum#Xanadu|Xanadu]]
 
* [[Quantum#Blackbird|Blackbird]]
 
* [[Quantum#Blackbird|Blackbird]]
* [http://mc.ai/training-quantum-neural-networks-with-pennylane-pytorch-and-tensorflow/ Training quantum neural networks with PennyLane, PyTorch, and TensorFlow | Medium]
+
* [[Quantum#TensorFlow Quantum| TensorFlow Quantum]]
* [http://pennylane.readthedocs.io/en/latest/ PennyLane documentation | Xanadu]
+
* [[PyTorch]]
 +
* [https://mc.ai/training-quantum-neural-networks-with-pennylane-pytorch-and-tensorflow/ Training quantum neural networks with PennyLane, PyTorch, and TensorFlow | Medium]
 +
* [https://pennylane.readthedocs.io/en/latest/ PennyLane documentation | Xanadu]
 
* Plugins:
 
* Plugins:
** [http://github.com/XanaduAI/pennylane-sf <b>Strawberry Fields</b> | GitHub] This plugin allows two devices to work with PennyLane - the Strawberry Fields Fock backend, and the Strawberry Fields Gaussian backend.
+
** [https://github.com/XanaduAI/pennylane-sf <b>Strawberry Fields</b> | GitHub] This plugin allows two devices to work with PennyLane - the Strawberry Fields Fock backend, and the Strawberry Fields Gaussian backend.
 
*** [[Quantum#Strawberry Fields|Strawberry Fields]] SDK
 
*** [[Quantum#Strawberry Fields|Strawberry Fields]] SDK
** [http://github.com/XanaduAI/pennylane-qiskit <b>Qiskit</b> | GitHub] plugin to the PennyLane library to connect it to qiskit-terra.
+
** [https://github.com/XanaduAI/pennylane-qiskit <b>Qiskit</b> | GitHub] plugin to the PennyLane library to connect it to qiskit-terra.
 
*** [[Quantum#Qiskit|Qiskit]] SDK
 
*** [[Quantum#Qiskit|Qiskit]] SDK
** [http://github.com/XanaduAI/pennylane-pq <b>ProjectQ</b> | GitHub] This plugin allows to use both the software and hardware backends of ProjectQ as devices for PennyLane.  
+
** [https://github.com/XanaduAI/pennylane-pq <b>ProjectQ</b> | GitHub] This plugin allows to use both the software and hardware backends of ProjectQ as devices for PennyLane.  
 
*** [[Quantum#ProjectQ|ProjectQ]] SDK
 
*** [[Quantum#ProjectQ|ProjectQ]] SDK
*** [http://pennylane-pq.readthedocs.io/en/latest/ Documentation | Xanadu] This plugin provides three devices to work with PennyLane - the ProjectQ IBM device, the ProjectQ quantum simulator, and the ProjectQ classical simulator.
+
*** [https://pennylane-pq.readthedocs.io/en/latest/ Documentation | Xanadu] This plugin provides three devices to work with PennyLane - the ProjectQ IBM device, the ProjectQ quantum simulator, and the ProjectQ classical simulator.
** [http://github.com/XanaduAI/PennyLane-qsharp <b>Microsoft Quantum Development Toolkit</b> | GitHub] plugin to the PennyLane library to connect it to Microsoft Quantum Development Toolkit
+
** [https://github.com/XanaduAI/PennyLane-qsharp <b>Microsoft Quantum Development Toolkit</b> | GitHub] plugin to the PennyLane library to connect it to Microsoft Quantum Development Toolkit
 
*** [[Quantum#Microsoft Quantum Development Kit|Microsoft Quantum Development Kit]] SDK
 
*** [[Quantum#Microsoft Quantum Development Kit|Microsoft Quantum Development Kit]] SDK
** [http://github.com/XanaduAI/pennylane-cirq <b>Cirq</b> | GitHub] plugin to the PennyLane library to connect it to Cirq
+
** [https://github.com/XanaduAI/pennylane-cirq <b>Cirq</b> | GitHub] plugin to the PennyLane library to connect it to [[Quantum#Cirq | Cirq]]
 
*** [[Quantum#Cirq|Cirq]] SDK
 
*** [[Quantum#Cirq|Cirq]] SDK
  
 
<youtube>tvVnjVa3ErY</youtube>
 
<youtube>tvVnjVa3ErY</youtube>
 
+
<youtube>y69tg_eKHMU</youtube>
 +
<youtube>iWrGVHwXPSI</youtube>
 +
<youtube>rrE03WE5hjw</youtube>
  
 
=== <span id="NISQAI "></span>NISQAI  ===
 
=== <span id="NISQAI "></span>NISQAI  ===
[http://www.youtube.com/results?search_query=NISQAI+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=NISQAI+quantum Youtube search...]
[http://www.google.com/search?q=NISQAI+quantum ...Google search]
+
[https://www.google.com/search?q=NISQAI+quantum ...Google search]
  
 
Noisy Intermediate-Scale Quantum Artificial Intelligence; implementing neural networks on near-term quantum computers
 
Noisy Intermediate-Scale Quantum Artificial Intelligence; implementing neural networks on near-term quantum computers
  
* [http://github.com/quantumai-lib/nisqai NISQAI | GitHub]
+
* [https://github.com/quantumai-lib/nisqai NISQAI | GitHub]
  
 
<youtube>_dOJ7Bhibec</youtube>
 
<youtube>_dOJ7Bhibec</youtube>
  
 
=== Quantum Neural Network (QNN) ===
 
=== Quantum Neural Network (QNN) ===
Quantum neural networks (QNNs) are neural network models which are based on the principles of quantum mechanics. There are two different approaches to QNN research, one exploiting quantum information processing to improve existing neural network models (sometimes also vice versa), and the other one searching for potential quantum effects in the brain. [http://en.wikipedia.org/wiki/Quantum_neural_network Quantum Neural Network (QNN) | Wikipedia]
+
Quantum neural networks (QNNs) are neural network models which are based on the principles of quantum mechanics. There are two different approaches to QNN research, one exploiting quantum information processing to improve existing neural network models (sometimes also vice versa), and the other one searching for potential quantum effects in the brain. [https://en.wikipedia.org/wiki/Quantum_neural_network Quantum Neural Network (QNN) | Wikipedia]
  
 
==== Quantum Convolutional Neural Network (QCNN) ====
 
==== Quantum Convolutional Neural Network (QCNN) ====
Machine learning techniques have so far proved to be very promising for the analysis of data in several fields, with many potential applications. However, researchers have found that applying these methods to quantum physics problems is far more challenging due to the exponential complexity of many-body systems.... "One of the objectives of the present work was to generalize a specific, well-known machine learning architecture called convolutional neural network (CNN) for a compact quantum circuit, and demonstrate its capabilities with simplistic but meaningful examples." In their study, Choi and his colleagues assumed that CNNs owe their great success to two important features. Firstly, the fact that they are made out of smaller local units (i.e., multiple layers of quasi-local quantum gates). Secondly, their ability to process input data in a hierarchical fashion. The researchers found a connection between these two characteristics and two renowned physics concepts known as [[Quantum#Locality|Locality]] and [[Quantum#Renormalization|Renormalization]]. The researchers observed that [[Quantum#Renormalization|Renormalization]] processes share some similarities with pattern recognition applications, particularly those in which machine learning is used to identify objects in pictures. For instance, when a CNN trained for pattern recognition tasks analyzes pictures of animals, it focuses on a universal feature (i.e., trying to identify what animal is portrayed in the image), regardless of whether individual animals of the same type (e.g., cats) look slightly different. This process is somewhat similar to [[Quantum#Renormalization|Renormalization]] techniques in theoretical physics, which can also help to distill universal information....quantum convolutional neural network (QCNN), on a quantum physics-specific problem that involved recognizing quantum states associated with a 1-D symmetry protected topological phase. Remarkably, their technique was able to recognize these quantum states, outperforming existing approaches. As it is fairly compact, the QCNN could also potentially be implemented in small quantum computers.  [http://phys.org/news/2019-09-quantum-convolutional-neural-networks.html Introducing Quantum Convolutional Neural Networks (QCNN) | Ingrid Fadelli]
+
Machine learning techniques have so far proved to be very promising for the analysis of data in several fields, with many potential applications. However, researchers have found that applying these methods to quantum physics problems is far more challenging due to the exponential complexity of many-body systems.... "One of the objectives of the present work was to generalize a specific, well-known machine learning architecture called convolutional neural network (CNN) for a compact quantum circuit, and demonstrate its capabilities with simplistic but meaningful examples." In their study, Choi and his colleagues assumed that CNNs owe their great success to two important features. Firstly, the fact that they are made out of smaller local units (i.e., multiple layers of quasi-local quantum gates). Secondly, their ability to process input data in a hierarchical fashion. The researchers found a connection between these two characteristics and two renowned physics concepts known as [[Quantum#Locality|Locality]] and [[Quantum#Renormalization|Renormalization]]. The researchers observed that [[Quantum#Renormalization|Renormalization]] processes share some similarities with pattern recognition applications, particularly those in which machine learning is used to identify objects in pictures. For instance, when a CNN trained for pattern recognition tasks analyzes pictures of animals, it focuses on a universal feature (i.e., trying to identify what animal is portrayed in the image), regardless of whether individual animals of the same type (e.g., cats) look slightly different. This process is somewhat similar to [[Quantum#Renormalization|Renormalization]] techniques in theoretical physics, which can also help to distill universal information....quantum convolutional neural network (QCNN), on a quantum physics-specific problem that involved recognizing quantum states associated with a 1-D symmetry protected topological phase. Remarkably, their technique was able to recognize these quantum states, outperforming existing approaches. As it is fairly compact, the QCNN could also potentially be implemented in small quantum computers.  [https://phys.org/news/2019-09-quantum-convolutional-neural-networks.html Introducing Quantum Convolutional Neural Networks (QCNN) | Ingrid Fadelli]
  
<img src="http://scx1.b-cdn.net/csz/news/800/2019/1-introducingq.jpg" width="700" height="400">
+
<img src="https://scx1.b-cdn.net/csz/news/800/2019/1-introducingq.jpg" width="700" height="400">
  
 
==== Machine Learning Powered By Light ====
 
==== Machine Learning Powered By Light ====
Line 175: Line 279:
  
 
===== [[Quantum#Xanadu|Xanadu]] =====
 
===== [[Quantum#Xanadu|Xanadu]] =====
 +
* [[Quantum#TensorFlow Quantum| TensorFlow Quantum]]
 +
 
A quantum photonic company - An industry-first machine learning toolbox for quantum computing. Powered by [[TensorFlow]]. Instead of using electrons to carry information and perform calculations, Xanadu uses photons. Unlike electrons, photons are very stable and are almost unaffected by random noise from heat. Xanadu uses photonic chips to generate, control, and measure photons in ways that enable extremely fast computation.  
 
A quantum photonic company - An industry-first machine learning toolbox for quantum computing. Powered by [[TensorFlow]]. Instead of using electrons to carry information and perform calculations, Xanadu uses photons. Unlike electrons, photons are very stable and are almost unaffected by random noise from heat. Xanadu uses photonic chips to generate, control, and measure photons in ways that enable extremely fast computation.  
 
* [https://www.xanadu.ai/ Xanadu]   
 
* [https://www.xanadu.ai/ Xanadu]   
Line 184: Line 290:
  
 
= Getting Started with Quantum Programming =
 
= Getting Started with Quantum Programming =
* [http://en.wikipedia.org/wiki/Quantum_programming Quantum Programming | Wikipedia]
+
* [https://en.wikipedia.org/wiki/Quantum_programming Quantum Programming | Wikipedia]
* [http://hackernoon.com/a-brief-introduction-to-quantum-computing-d21e578cb7ed A Brief Introduction to Quantum Computing | Tanisha Bassan]
+
* [https://hackernoon.com/a-brief-introduction-to-quantum-computing-d21e578cb7ed A Brief Introduction to Quantum Computing | Tanisha Bassan]
* [http://en.wikipedia.org/w/index.php?title=Quantum_programming&section=17 Quantum programming languages | Wikipedia]
+
* [https://en.wikipedia.org/w/index.php?title=Quantum_programming&section=17 Quantum programming languages | Wikipedia]
* [http://hackernoon.com/exploring-quantum-programming-from-hello-world-to-hello-quantum-world-109add25305f Exploring Quantum Programming from "Hello World" to "Hello Quantum World" | Rahul Kumar - Hackernoon]
+
* [https://hackernoon.com/exploring-quantum-programming-from-hello-world-to-hello-quantum-world-109add25305f Exploring Quantum Programming from "Hello World" to "Hello Quantum World" | Rahul Kumar - Hackernoon]
* [http://venturebeat.com/2020/03/09/google-launches-tensorflow-quantum-a-machine-learning-framework-for-training-quantum-models/ Google launches TensorFlow Quantum, a machine learning framework for training quantum models | Khari Johnson - VentureBeat]  ...[http://www.tensorflow.org/quantum TensorFlow Quantum (TFQ) is a library for hybrid quantum-classical machine learning]
+
* [https://learn.microsoft.com/en-us/azure/architecture/guide/quantum/devops-for-quantum-computing DevOps for quantum computing | Microsoft]
  
 
<youtube>GN8ZI930HLg</youtube>
 
<youtube>GN8ZI930HLg</youtube>
  
  
== <b><i>Quantum Logic Gate</i></b> ==
+
== Quantum Logic Gate ==
A basic quantum circuit operating on a small number of [[Quantum#Qubit|Qubit]]s. They are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits. It is different to electric circuits in that the [[Quantum#Qubit|Qubit]]s exist, and instructions are applied to the [[Quantum#Qubit|Qubit]](s)  ... [http://en.wikipedia.org/wiki/Quantum_logic_gate Quantum logic gates | Wikipedia]
+
A basic quantum circuit operating on a small number of [[Quantum#Qubit|Qubit]]s. They are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits. It is different to electric circuits in that the [[Quantum#Qubit|Qubit]]s exist, and instructions are applied to the [[Quantum#Qubit|Qubit]](s)  ... [https://en.wikipedia.org/wiki/Quantum_logic_gate Quantum logic gates | Wikipedia]
  
* [http://docs.microsoft.com/en-us/qsharp/api/qsharp/microsoft.quantum.intrinsic?view=qsharp-preview Microsoft.Quantum.Intrinsic | Microsoft] list of (operations) gates and Functions included in Microsoft Quantum Development Kit Preview
+
* [https://docs.microsoft.com/en-us/qsharp/api/qsharp/microsoft.quantum.intrinsic?view=qsharp-preview Microsoft.Quantum.Intrinsic | Microsoft] list of (operations) gates and Functions included in Microsoft Quantum Development Kit Preview
* [http://lahirumadushankablog.wordpress.com/2019/04/21/intro-to-quantum-logic-gates/ Intro to Quantum Logic Gates | Lahiru Madushanka]
+
* [https://lahirumadushankablog.wordpress.com/2019/04/21/intro-to-quantum-logic-gates/ Intro to Quantum Logic Gates | Lahiru Madushanka]
  
 
<youtube>QXJ96Kyt6TA</youtube>
 
<youtube>QXJ96Kyt6TA</youtube>
Line 203: Line 309:
  
 
== Quantum NOT gate (X, Y, Z) ==
 
== Quantum NOT gate (X, Y, Z) ==
http://upload.wikimedia.org/wikipedia/commons/thumb/2/23/Qcircuit_NOT.svg/150px-Qcircuit_NOT.svg.png
+
https://upload.wikimedia.org/wikipedia/commons/thumb/2/23/Qcircuit_NOT.svg/150px-Qcircuit_NOT.svg.png
  
http://i.imgur.com/8oMGNCU.gif
+
https://i.imgur.com/8oMGNCU.gif
  
<img src="http://lahirumadushankablog.files.wordpress.com/2019/04/x1-1.jpg" width="500" height="600">
+
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/x1-1.jpg" width="500" height="600">
  
 
<youtube>JDDSjsQLv80</youtube>
 
<youtube>JDDSjsQLv80</youtube>
Line 213: Line 319:
 
* Pauli-X gate - Pauli-x gate is the same as the not gate described above. It is the quantum equivalent of the NOT gate for classical computers (with respect to the standard basis, which distinguishes the Z-direction;  It equates to a rotation around the X-axis of the Bloch sphere by pi  radians. Due to this nature, it is sometimes called bit-flip.  
 
* Pauli-X gate - Pauli-x gate is the same as the not gate described above. It is the quantum equivalent of the NOT gate for classical computers (with respect to the standard basis, which distinguishes the Z-direction;  It equates to a rotation around the X-axis of the Bloch sphere by pi  radians. Due to this nature, it is sometimes called bit-flip.  
 
* Pauli-Y gate - It equates to a rotation around the Y-axis of the Bloch sphere by pi radians
 
* Pauli-Y gate - It equates to a rotation around the Y-axis of the Bloch sphere by pi radians
<img src="http://lahirumadushankablog.files.wordpress.com/2019/04/pauliy.jpg" width="500" height="300">
+
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/pauliy.jpg" width="500" height="300">
  
  
 
* Pauli-Z gate - It equates to a rotation around the Z-axis of the Bloch sphere by pi radians; representing a rotation around the z-axis by 180 degrees.
 
* Pauli-Z gate - It equates to a rotation around the Z-axis of the Bloch sphere by pi radians; representing a rotation around the z-axis by 180 degrees.
<img src="http://lahirumadushankablog.files.wordpress.com/2019/04/pauliz.jpg" width="500" height="300">
+
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/pauliz.jpg" width="500" height="300">
  
 
=== Phase Gate  ... S & T gates ===
 
=== Phase Gate  ... S & T gates ===
 
<b>S gate</b> is related to the Pauli-z gate; representing a rotation around the z-axis by 90 degrees.  
 
<b>S gate</b> is related to the Pauli-z gate; representing a rotation around the z-axis by 90 degrees.  
  
<img src="http://lahirumadushankablog.files.wordpress.com/2019/04/sgate-1.jpg" width="500" height="300">
+
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/sgate-1.jpg" width="500" height="300">
  
  
 
<b>T gate</b> is related to the Pauli-z gate; representing a rotation around the z-axis by 45 degrees.  
 
<b>T gate</b> is related to the Pauli-z gate; representing a rotation around the z-axis by 45 degrees.  
  
<img src="http://lahirumadushankablog.files.wordpress.com/2019/04/tgate.jpg" width="500" height="300">
+
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/tgate.jpg" width="500" height="300">
  
 
Both S and T gates are not reversible. Which means adding two of them in a raw will not result in the input status. Rather following diagram shows the combination of gates to achieve the inverse.
 
Both S and T gates are not reversible. Which means adding two of them in a raw will not result in the input status. Rather following diagram shows the combination of gates to achieve the inverse.
  
<img src="http://lahirumadushankablog.files.wordpress.com/2019/04/invertchart.jpg" width="500" height="170">
+
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/invertchart.jpg" width="500" height="170">
  
  
Line 237: Line 343:
 
is the one-[[Quantum#Qubit|Qubit]] version of the quantum Fourier transform. A measurement will have equal probabilities to become 1 or 0 (i.e. creates a [[Quantum#Superposition|Superposition]]). The Hadamard gate can also be expressed as a 90º rotation around the Y-axis, followed by a 180º rotation around the X-axis. So H = X Y^{1/2}H=XY. Getting [[Quantum#Qubit|Qubit]]s into [[Quantum#Superposition|Superposition]] at the start of an algorithm is call 'Hadamard initialization'  
 
is the one-[[Quantum#Qubit|Qubit]] version of the quantum Fourier transform. A measurement will have equal probabilities to become 1 or 0 (i.e. creates a [[Quantum#Superposition|Superposition]]). The Hadamard gate can also be expressed as a 90º rotation around the Y-axis, followed by a 180º rotation around the X-axis. So H = X Y^{1/2}H=XY. Getting [[Quantum#Qubit|Qubit]]s into [[Quantum#Superposition|Superposition]] at the start of an algorithm is call 'Hadamard initialization'  
  
http://upload.wikimedia.org/wikipedia/commons/thumb/1/1a/Hadamard_gate.svg/150px-Hadamard_gate.svg.png
+
https://upload.wikimedia.org/wikipedia/commons/thumb/1/1a/Hadamard_gate.svg/150px-Hadamard_gate.svg.png
  
http://i.imgur.com/Z1gvp0j.gif
+
https://i.imgur.com/Z1gvp0j.gif
  
<img src="http://lahirumadushankablog.files.wordpress.com/2019/04/hada.jpg" width="500" height="600">
+
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/hada.jpg" width="500" height="600">
  
  
Line 249: Line 355:
 
Controlled gates act on 2 or more [[Quantum#Qubit|Qubit]]s, where one or more [[Quantum#Qubit|Qubit]]s act as a control for some operation. For example, the controlled NOT gate (or CNOT or cX) acts on 2 [[Quantum#Qubit|Qubit]]s, and performs the NOT operation on the second [[Quantum#Qubit|Qubit]] only when the first [[Quantum#Qubit|Qubit]] is {\displaystyle |1\rangle }|1\rangle , and otherwise leaves it unchanged.
 
Controlled gates act on 2 or more [[Quantum#Qubit|Qubit]]s, where one or more [[Quantum#Qubit|Qubit]]s act as a control for some operation. For example, the controlled NOT gate (or CNOT or cX) acts on 2 [[Quantum#Qubit|Qubit]]s, and performs the NOT operation on the second [[Quantum#Qubit|Qubit]] only when the first [[Quantum#Qubit|Qubit]] is {\displaystyle |1\rangle }|1\rangle , and otherwise leaves it unchanged.
  
http://upload.wikimedia.org/wikipedia/commons/thumb/4/4e/CNOT_gate.svg/150px-CNOT_gate.svg.png
+
https://upload.wikimedia.org/wikipedia/commons/thumb/4/4e/CNOT_gate.svg/150px-CNOT_gate.svg.png
  
<img src="http://lahirumadushankablog.files.wordpress.com/2019/04/cnot-1.jpg" width="500" height="150">
+
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/cnot-1.jpg" width="500" height="150">
  
 
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/cnotfinal.jpg" width="500" height="600">
 
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/cnotfinal.jpg" width="500" height="600">
Line 260: Line 366:
 
As an extended version of CNot gate, Toffoli gate does the Not operation depending on two control [[Quantum#Qubit|Qubit]]s. Result of the And operation between two control bits are used as the final control bit for the Not gate.
 
As an extended version of CNot gate, Toffoli gate does the Not operation depending on two control [[Quantum#Qubit|Qubit]]s. Result of the And operation between two control bits are used as the final control bit for the Not gate.
  
<img src="http://lahirumadushankablog.files.wordpress.com/2019/04/tofolli-1.jpg" width="500" height="125">
+
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/tofolli-1.jpg" width="500" height="125">
  
 
<b><i>Toffoli gate => Quantum equivalent of a universal logic gate.</i></b>
 
<b><i>Toffoli gate => Quantum equivalent of a universal logic gate.</i></b>
Line 266: Line 372:
 
Toffoli gate can be used to achieve several other logic operations as follows.  
 
Toffoli gate can be used to achieve several other logic operations as follows.  
  
<img src="http://lahirumadushankablog.files.wordpress.com/2019/04/universal.jpg" width="500" height="175">
+
<img src="https://lahirumadushankablog.files.wordpress.com/2019/04/universal.jpg" width="500" height="175">
  
 
In classical computing when we need to transfer some logical state to several other logic gates we just connect all the lines as in the image. Physically also we can transfer the low, high states to several other logic gates via wires. But in quantum mechanics, we cannot send a single [[Quantum#Qubit|Qubit]] to two destinations. To do that we need to clone the quantum state of the [[Quantum#Qubit|Qubit]]s. Which is not possible according to No-Cloning theorem. Instead, we must use some special gates called fanout gates. Note: Fanout gates does not copy superposed and entangled states. Creating a fanout gate using Toffoli gate:
 
In classical computing when we need to transfer some logical state to several other logic gates we just connect all the lines as in the image. Physically also we can transfer the low, high states to several other logic gates via wires. But in quantum mechanics, we cannot send a single [[Quantum#Qubit|Qubit]] to two destinations. To do that we need to clone the quantum state of the [[Quantum#Qubit|Qubit]]s. Which is not possible according to No-Cloning theorem. Instead, we must use some special gates called fanout gates. Note: Fanout gates does not copy superposed and entangled states. Creating a fanout gate using Toffoli gate:
  
<img src="https://www.electrical4u.com/wp-content/uploads/2013/08/fan-out-of-logic-gates.gif" width="200" height="200"> <img src="http://lahirumadushankablog.files.wordpress.com/2019/04/fanout.jpg" width="275" height="175">
+
<img src="https://www.electrical4u.com/wp-content/uploads/2013/08/fan-out-of-logic-gates.gif" width="200" height="200"> <img src="https://lahirumadushankablog.files.wordpress.com/2019/04/fanout.jpg" width="275" height="175">
  
 
=== SWAP gate ===
 
=== SWAP gate ===
 
built from a circuit containing only CNOT gates. The first CNOT is the controlled by the first [[Quantum#Qubit|Qubit]] (CNOTa), and second one is controlled by the second [[Quantum#Qubit|Qubit]] (CNOTb).
 
built from a circuit containing only CNOT gates. The first CNOT is the controlled by the first [[Quantum#Qubit|Qubit]] (CNOTa), and second one is controlled by the second [[Quantum#Qubit|Qubit]] (CNOTb).
  
http://ars.els-cdn.com/content/image/3-s2.0-B9780444527820500051-f03-03-9780444527820.gif
+
https://ars.els-cdn.com/content/image/3-s2.0-B9780444527820500051-f03-03-9780444527820.gif
  
  
Line 289: Line 395:
 
a special type of operations done on [[Quantum#Qubit|Qubit]]s at the end of a circuit to get the final values of the [[Quantum#Qubit|Qubit]]s after the operations have been conducted. Compared to the gates above, Measurement is irreversible and hence, is not a Quantum Gate.  
 
a special type of operations done on [[Quantum#Qubit|Qubit]]s at the end of a circuit to get the final values of the [[Quantum#Qubit|Qubit]]s after the operations have been conducted. Compared to the gates above, Measurement is irreversible and hence, is not a Quantum Gate.  
  
<img src="http://miro.medium.com/max/614/1*9NGWnZMKJMnEX_Vo4_4_Uw.png" width="400" height="100">
+
<img src="https://miro.medium.com/max/614/1*9NGWnZMKJMnEX_Vo4_4_Uw.png" width="400" height="100">
  
 
== Quantum Instruction Sets ==
 
== Quantum Instruction Sets ==
Line 296: Line 402:
  
 
=== <span id="cQASM"></span>cQASM ===
 
=== <span id="cQASM"></span>cQASM ===
[http://www.youtube.com/results?search_query=cQASM+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=cQASM+quantum Youtube search...]
[http://www.google.com/search?q=cQASM+quantum ...Google search]
+
[https://www.google.com/search?q=cQASM+quantum ...Google search]
  
 
cQASM, also known as common QASM, is a hardware-agnostic QASM which guarantees the interoperability between all the quantum compilation and simulation tools.
 
cQASM, also known as common QASM, is a hardware-agnostic QASM which guarantees the interoperability between all the quantum compilation and simulation tools.
  
* [http://www.quantum-inspire.com/kbase/quick-guide/ QI Editor Guide]
+
* [https://www.quantum-inspire.com/kbase/quick-guide/ QI Editor Guide]
* [http://www.quantum-inspire.com Quantum Inspire (QI)] a quantum computing platform designed and built by [http://www.qutech.nl/ QuTech]. Quantum Inspire (QI) is initiated by [http://www.qutech.nl/ QuTech] the advanced research center for quantum computing and quantum internet founded by [https://www.tudelft.nl/en/ TU Delft] and TNO.  
+
* [https://www.quantum-inspire.com Quantum Inspire (QI)] a quantum computing platform designed and built by [https://www.qutech.nl/ QuTech]. Quantum Inspire (QI) is initiated by [https://www.qutech.nl/ QuTech] the advanced research center for quantum computing and [[Quantum Communications|quantum internet]] founded by [https://www.tudelft.nl/en/ TU Delft] and TNO.  
* [http://qutech.nl/academy/ QuTech Academy] "QuTech gives students a large perspective of what is happening in the field of quantum!" Discover quantum computers and the quantum internet. Learn the principles and promises behind these developments and how they will impact our future in 2 new online courses. The course Quantum Computers and Quantum Internet: How can they change the world? will dive into the potential impact of a quantum computer and a quantum internet. The course Building Blocks of a Quantum Computer will give you insight in the several layers of a quantum computer, ranging from [[Quantum#Qubit|Qubit]]s to software. Both courses are available on EdX.org.
+
* [https://qutech.nl/academy/ QuTech Academy] "QuTech gives students a large [[perspective]] of what is happening in the field of quantum!" Discover quantum computers and the [[Quantum Communications|quantum internet]]. Learn the principles and promises behind these developments and how they will impact our future in 2 new online courses. The course Quantum Computers and [[[[Quantum Communications|Quantum Internet]]: How can they change the world? will dive into the potential impact of a quantum computer and a [[Quantum Communications|quantum internet]]. The course Building Blocks of a Quantum Computer will give you insight in the several layers of a quantum computer, ranging from [[Quantum#Qubit|Qubit]]s to software. Both courses are available on EdX.org.
  
 
<youtube>7MPcq8z8jbo</youtube>
 
<youtube>7MPcq8z8jbo</youtube>
Line 310: Line 416:
  
 
=== <span id="OpenQASM"></span>OpenQASM ===
 
=== <span id="OpenQASM"></span>OpenQASM ===
[http://www.youtube.com/results?search_query=OpenQASM+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=OpenQASM+quantum Youtube search...]
[http://www.google.com/search?q=OpenQASM+quantum ...Google search]
+
[https://www.google.com/search?q=OpenQASM+quantum ...Google search]
  
OpenQASM is the intermediate representation introduced by IBM for use with [[Quantum#Qiskit|Qiskit]] and the [http://en.wikipedia.org/wiki/IBM_Q_Experience IBM Q Experience]. [http://en.wikipedia.org/wiki/OpenQASM Wikipedia]
+
OpenQASM is the intermediate representation introduced by IBM for use with [[Quantum#Qiskit|Qiskit]] and the [https://en.wikipedia.org/wiki/IBM_Q_Experience IBM Q Experience]. [https://en.wikipedia.org/wiki/OpenQASM Wikipedia]
  
 
=== <span id="Quil"></span>Quil ===
 
=== <span id="Quil"></span>Quil ===
[http://www.youtube.com/results?search_query=Quil+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=Quil+quantum Youtube search...]
[http://www.google.com/search?q=Quil+quantum ...Google search]
+
[https://www.google.com/search?q=Quil+quantum ...Google search]
  
Quil is an instruction set architecture for quantum computing that first introduced a shared quantum/classical memory model. Many quantum algorithms (including quantum teleportation, quantum error correction, simulation, and optimization algorithms) require a shared memory architecture.
+
Quil is an instruction set architecture for quantum computing that first introduced a shared quantum/classical [[memory]] model. Many quantum algorithms (including quantum teleportation, quantum error correction, simulation, and optimization algorithms) require a shared [[memory]] architecture.
  
Quil is being developed for the superconducting quantum processors developed by Rigetti Computing through the Forest quantum programming API. A Python library called pyQuil was introduced to develop Quil programs with higher level constructs. A Quil backend is also supported by other quantum programming environments. Computing developed a Quantum Virtual Machine in Common Lisp that simulates the defined Quantum Abstract Machine on a classical computer and is capable of the parsing and execution of Quil programs with possibly remote execution via HTTP
+
Quil is being developed for the superconducting quantum processors developed by Rigetti Computing through the Forest quantum programming API. A P[[Python]] library called pyQuil was introduced to develop Quil programs with higher level constructs. A Quil backend is also supported by other quantum programming environments. Computing developed a Quantum Virtual Machine in Common Lisp that simulates the defined Quantum Abstract Machine on a classical computer and is capable of the parsing and execution of Quil programs with possibly remote execution via HTTP
  
* [http://en.wikipedia.org/wiki/Quil_(instruction_set_architecture) Quil (instruction set architecture) | Wikipedia]
+
* [https://en.wikipedia.org/wiki/Quil_(instruction_set_architecture) Quil (instruction set architecture) | Wikipedia]
 
* [[Quantum#Forest|Forest]] Quantum software development kit
 
* [[Quantum#Forest|Forest]] Quantum software development kit
* [http://github.com/rigetti/pyquil PyQuil]  Python library for quantum programming using Quil | Rigetti Computing   
+
* [https://github.com/rigetti/pyquil PyQuil]  [[Python]] library for quantum programming using Quil | Rigetti Computing   
* [http://medium.com/rigetti/how-to-write-a-quantum-program-in-10-lines-of-code-for-beginners-540224ac6b45 How to write a quantum program in 10 lines of code (for beginners); Build an 8-sided dice that runs on a quantum computer | Dave Yen - Rigetti Computing   
+
* [https://medium.com/rigetti/how-to-write-a-quantum-program-in-10-lines-of-code-for-beginners-540224ac6b45 How to write a quantum program in 10 lines of code (for beginners); Build an 8-sided dice that runs on a quantum computer | Dave Yen - Rigetti Computing   
  
 
PyQuil serves three main functions:
 
PyQuil serves three main functions:
Line 337: Line 443:
  
 
===== <span id="Blackbird"></span>Blackbird =====
 
===== <span id="Blackbird"></span>Blackbird =====
[http://www.youtube.com/results?search_query=Blackbird+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=Blackbird+quantum Youtube search...]
[http://www.google.com/search?q=Blackbird+quantum ...Google search]
+
[https://www.google.com/search?q=Blackbird+quantum ...Google search]
  
 
Blackbird is a quantum assembly language for continuous-variable quantum computation, that can be used to program Xanadu's quantum photonics hardware and Strawberry Fields simulator.
 
Blackbird is a quantum assembly language for continuous-variable quantum computation, that can be used to program Xanadu's quantum photonics hardware and Strawberry Fields simulator.
* [http://github.com/XanaduAI Blackbird | GitHub]
+
* [https://github.com/XanaduAI Blackbird | GitHub]
 
* [[Quantum#Xanadu|Xanadu]]
 
* [[Quantum#Xanadu|Xanadu]]
 
* [[Quantum#PennyLane|PennyLane]] The first dedicated machine learning platform for quantum computers
 
* [[Quantum#PennyLane|PennyLane]] The first dedicated machine learning platform for quantum computers
Line 347: Line 453:
  
 
== Quantum Functions & Algorithms ==
 
== Quantum Functions & Algorithms ==
* [http://quantumalgorithmzoo.org/ Quantum Algorithm Zoo | Stephen Jordan] - a comprehensive catalog of quantum algorithms
+
* [https://quantumalgorithmzoo.org/ Quantum Algorithm Zoo | Stephen Jordan] - a comprehensive catalog of quantum algorithms
* [http://blogs.scientificamerican.com/cross-check/quantum-computing-for-english-majors/ Quantum Computing for English Majors | John Horgan - Scientific American]
+
* [https://blogs.scientificamerican.com/cross-check/quantum-computing-for-english-majors/ Quantum Computing for English Majors | John Horgan - Scientific American]
* [http://arxiv.org/abs/1806.09729 A Universal Training Algorithm for Quantum Deep Learning | G. Verdon, J. Pye, & M. Broughton]
+
* [https://arxiv.org/abs/1806.09729 A Universal Training Algorithm for Quantum Deep Learning | G. Verdon, J. Pye, & M. Broughton]
* [http://dkopczyk.quantee.co.uk/category/quantum_computing/ Quantum algorithms | Dawid Kopczyk] - explained to data scientists with visualizations.  
+
* [https://dkopczyk.quantee.co.uk/category/quantum_computing/ Quantum algorithms | Dawid Kopczyk] - explained to data scientists with visualizations.  
  
 
<youtube>LhtnECml-KI</youtube>
 
<youtube>LhtnECml-KI</youtube>
  
  
=== Deutsch-Jozsa Algorithm ===
+
=== <span id="Schnorr's Algorithm"></span>Schnorr's Algorithm ===
One of the first quantum algorithms with nice speedup over its classical counterpart. Consider This is an “hello world” in quantum computing. Consider a function f that takes 0 or 1 as input and outputs either 0 or 1. Our functions in mind are either balanced or constant. A function f is called balanced if it outputs 0 half the time and 1 the other half. It is a constant function if its output is a constant (1 or 0) regardless of input.
+
* [https://arxiv.org/abs/2212.12372 Factoring integers with sublinear resources on a superconducting quantum processor | Bao Yan et al - arXiv]
 
+
* [https://www.schneier.com/blog/archives/2023/01/breaking-rsa-with-a-quantum-computer.html Breaking RSA with a Quantum Computer | (Bruce) Schneier on Security]
We are given an oracle whose input is n bits and whose output is one bit. We are promised that out of the 2n possible inputs, either all of them, none of them, or half of them yield output 1. The task is to distinguish the balanced case (half of all inputs yield output 1) from the constant case (all or none of the inputs yield output 1). It was shown by Deutsch that for n=1, this can be solved on a quantum computer using one query, whereas any deterministic classical algorithm requires two. This was historically the first well-defined quantum algorithm achieving a speedup over classical computation.  A single-query quantum algorithm for arbitrary n was developed by Deutsch and Jozsa. Although probabilistically easy to solve with O(1) queries, the Deutsch-Jozsa problem has exponential worst case deterministic query complexity classically. [http://quantumalgorithmzoo.org/ Algebraic and Number Theoretic Algorithms | Stephen Jordan]
+
* [https://therecord.media/chinese-researchers-claim-to-have-broken-rsa-with-a-quantum-computer-experts-arent-so-sure/ China News - Chinese researchers claim to have broken RSA with a quantum computer. Experts aren’t so sure. | Alexander Martin - The Record]
 
 
* [http://en.wikipedia.org/wiki/Deutsch%E2%80%93Jozsa_algorithm Deutsch–Jozsa algorithm | Wikipedia]
 
  
<youtube>5xsyx-aNClM</youtube>
+
It is estimated that a quantum computer using 372 qubits running their algorithm could crack any of the cryptosystems in use today. Not mentioned in their work is one caveat that remains—today's quantum computers have error rates so high that it would be impossible to use them to crack cryptosystems.  If systems with much lower error rates do arise in the near future, cryptosystem makers could increase the size of the prime numbers used to generate their keys—but only for so long. A more likely prospect for securing computer systems in the future will use quantum-secure communications, specifically quantum key distribution.  - [https://techxplore.com/news/2023-01-modification-shor-algorithm-powerful-quantum.html Modification to Shor's algorithm may mean less powerful quantum computers could crack cryptosystems | Bob Yika - Tech Xplore]
<youtube>WLcNrikK2vw</youtube>
 
  
===  Simon’s Algorithm ===
+
https://scx1.b-cdn.net/csz/news/800a/2023/modification-to-shors.jpg
Much of the functionality is the same as the Bernstien-Vazirani algorithm. [http://quantumcomputing.stackexchange.com/questions/1710/how-exactly-does-simons-algorithm-solve-the-simons-problem Circuit | DaftWullie - Stack Exchange]
 
  
<youtube>tXux8-UMSv8</youtube>
+
<youtube>VhGSFGsBXko</youtube>
  
=== Shor's Period Finding Algorithm ===
+
=== <span id="Shor's Period Finding Algorithm"></span>Shor's Period Finding Algorithm ===
 
Performing prime factorization of integers; Shor's algorithm is difficult to understand because it mixes together ideas from quantum physics, signal processing, number theory, and computer science.
 
Performing prime factorization of integers; Shor's algorithm is difficult to understand because it mixes together ideas from quantum physics, signal processing, number theory, and computer science.
* [http://algassert.com/quirk Quirk]
+
* [https://algassert.com/quirk Quirk]
* [http://codeburst.io/quantum-threat-to-blockchains-shors-and-grover-s-algorithms-9b01941bed01 Quantum Threat to Blockchains: Shor’s and Grover’s Algorithms | Shaan Ray = Codeburst.io - Medium]
+
* [[Quantum#Quantum Cryptographic Technology| Quantum Cryptographic Technology]]
* [http://physics.stackexchange.com/questions/369590/shors-algorithm-why-doesnt-the-final-collapse-of-the-auxiliary-qubits-crippl Shor's algorithm - why doesn't the final collapse of the auxiliary qubits cripple the computation?] In the factoring algorithm, there are three kinds of qubits. In the OP's notation, there are "input qubits", which start in a superposition of all possible values, and which you eventually take the Fourier transform of. There are "value qubits", in which you compute the function ya(modN), where a is the value in the input qubits. And there are "auxiliary qubits", which you use as workspace to help do this computation. In order to make the factoring algorithm work properly, you need to reset all the auxiliary qubits, which started as |0⟩ at the beginning of the computation, to |0⟩ at the end of the computation. This is called "uncomputing" these qubits. (Actually, you can set them to anything you please as long as it is a constant independent of the workings of the algorithm.) Theorems about reversible classical computation ensure that it is possible to do this. If you reset the auxiliary qubits to |0⟩, then if the environment, or somebody, measures them, nothing is revealed about the computation, and the computation is not "crippled". If you forget to reset them to |0⟩, you probably won't get the right answer, whether or not anybody measures them.
+
* [https://physics.stackexchange.com/questions/369590/shors-algorithm-why-doesnt-the-final-collapse-of-the-auxiliary-qubits-crippl Shor's algorithm - why doesn't the final collapse of the auxiliary qubits cripple the computation?] In the factoring algorithm, there are three kinds of qubits. In the OP's notation, there are "input qubits", which start in a superposition of all possible values, and which you eventually take the Fourier transform of. There are "value qubits", in which you compute the function ya(modN), where a is the value in the input qubits. And there are "auxiliary qubits", which you use as workspace to help do this computation. In order to make the factoring algorithm work properly, you need to reset all the auxiliary qubits, which started as |0⟩ at the beginning of the computation, to |0⟩ at the end of the computation. This is called "uncomputing" these qubits. (Actually, you can set them to anything you please as long as it is a constant independent of the workings of the algorithm.) Theorems about reversible classical computation ensure that it is possible to do this. If you reset the auxiliary qubits to |0⟩, then if the environment, or somebody, measures them, nothing is revealed about the computation, and the computation is not "crippled". If you forget to reset them to |0⟩, you probably won't get the right answer, whether or not anybody measures them.
* [http://algassert.com/post/1718 Shor's Quantum Factoring Algorithm | Algorithmic Assertions]
+
* [https://algassert.com/post/1718 Shor's Quantum Factoring Algorithm | Algorithmic Assertions]
  
<img src="http://algassert.com/assets/2017-08-28-shor-algorithm/flowchart.png" width="900" height="200">
+
<img src="https://algassert.com/assets/2017-08-28-shor-algorithm/flowchart.png" width="900" height="200">
  
<img src="http://i.stack.imgur.com/EW7qP.png" width="700" height="400">
+
<img src="https://i.stack.imgur.com/EW7qP.png" width="700" height="400">
  
<img src="http://algassert.com/assets/2017-08-28-shor-algorithm/qft-spinners.gif" width="700" height="400">
+
<img src="https://algassert.com/assets/2017-08-28-shor-algorithm/qft-spinners.gif" width="700" height="400">
  
  
Line 388: Line 490:
 
=== Grover's Search ===
 
=== Grover's Search ===
 
Searches for a specified entry in an unordered database, employing an important technique in quantum algorithm design known as amplitude amplification  
 
Searches for a specified entry in an unordered database, employing an important technique in quantum algorithm design known as amplitude amplification  
* [http://algassert.com/quirk Quirk]
+
* [https://algassert.com/quirk Quirk]
  
<img src="http://i.stack.imgur.com/GFcW9.gif" width="800" height="180">
+
<img src="https://i.stack.imgur.com/GFcW9.gif" width="800" height="180">
  
 
<youtube>4EdQkk_cgzs</youtube>
 
<youtube>4EdQkk_cgzs</youtube>
 +
 +
=== Deutsch-Jozsa Algorithm ===
 +
One of the first quantum algorithms with nice speedup over its classical counterpart. Consider This is an “hello world” in quantum computing. Consider a function f that takes 0 or 1 as input and outputs either 0 or 1. Our functions in mind are either balanced or constant. A function f is called balanced if it outputs 0 half the time and 1 the other half. It is a constant function if its output is a constant (1 or 0) regardless of input.
 +
 +
We are given an oracle whose input is n bits and whose output is one bit. We are promised that out of the 2n possible inputs, either all of them, none of them, or half of them yield output 1. The task is to distinguish the balanced case (half of all inputs yield output 1) from the constant case (all or none of the inputs yield output 1). It was shown by Deutsch that for n=1, this can be solved on a quantum computer using one query, whereas any deterministic classical algorithm requires two. This was historically the first well-defined quantum algorithm achieving a speedup over classical computation.  A single-query quantum algorithm for arbitrary n was developed by Deutsch and Jozsa. Although probabilistically easy to solve with O(1) queries, the Deutsch-Jozsa problem has exponential worst case deterministic query complexity classically. [https://quantumalgorithmzoo.org/ Algebraic and Number Theoretic Algorithms | Stephen Jordan]
 +
 +
* [https://en.wikipedia.org/wiki/Deutsch%E2%80%93Jozsa_algorithm Deutsch–Jozsa algorithm | Wikipedia]
 +
 +
<youtube>5xsyx-aNClM</youtube>
 +
<youtube>WLcNrikK2vw</youtube>
 +
 +
===  Simon’s Algorithm ===
 +
Much of the functionality is the same as the Bernstien-Vazirani algorithm. [https://quantumcomputing.stackexchange.com/questions/1710/how-exactly-does-simons-algorithm-solve-the-simons-problem Circuit | DaftWullie - Stack Exchange]
 +
 +
<youtube>tXux8-UMSv8</youtube>
  
  
 
=== Bernstein-Vazirani Algorithm ===
 
=== Bernstein-Vazirani Algorithm ===
Correctly guesses a string of binary numbers in one shot. It's a restricted version of the Deutsch–Jozsa algorithm where instead of distinguishing between two different classes of functions, it tries to learn a string encoded in a function. [http://en.wikipedia.org/wiki/Bernstein%E2%80%93Vazirani_algorithm Bernstein–Vazirani algorithm | Wikipedia], which solves the Bernstein–Vazirani problem  
+
Correctly guesses a string of binary numbers in one shot. It's a restricted version of the Deutsch–Jozsa algorithm where instead of distinguishing between two different classes of functions, it tries to learn a string encoded in a function. [https://en.wikipedia.org/wiki/Bernstein%E2%80%93Vazirani_algorithm Bernstein–Vazirani algorithm | Wikipedia], which solves the Bernstein–Vazirani problem  
  
We are given an oracle whose input is n bits and whose output is one bit. Given input x∈{0,1}n, the output is x⊙h, where h is the "hidden" string of n bits, and ⊙ denotes the bitwise inner product modulo 2. The task is to find h. On a classical computer this requires n queries. As shown by Bernstein and Vazirani, this can be achieved on a quantum computer using a single query. Furthermore, one can construct recursive versions of this problem, called recursive Fourier sampling, such that quantum computers require exponentially fewer queries than classical computers. [http://quantumalgorithmzoo.org/ Algebraic and Number Theoretic Algorithms | Stephen Jordan]
+
We are given an oracle whose input is n bits and whose output is one bit. Given input x∈{0,1}n, the output is x⊙h, where h is the "hidden" string of n bits, and ⊙ denotes the bitwise inner product modulo 2. The task is to find h. On a classical computer this requires n queries. As shown by Bernstein and Vazirani, this can be achieved on a quantum computer using a single query. Furthermore, one can construct recursive versions of this problem, called recursive Fourier sampling, such that quantum computers require exponentially fewer queries than classical computers. [https://quantumalgorithmzoo.org/ Algebraic and Number Theoretic Algorithms | Stephen Jordan]
  
<img src="http://upload.wikimedia.org/wikipedia/commons/thumb/1/15/Bernstein-Vazirani_quantum_circuit.png/220px-Bernstein-Vazirani_quantum_circuit.png" width="200" height="80">
+
<img src="https://upload.wikimedia.org/wikipedia/commons/thumb/1/15/Bernstein-Vazirani_quantum_circuit.png/220px-Bernstein-Vazirani_quantum_circuit.png" width="200" height="80">
  
 
<youtube>keTjrGXqJuA</youtube>
 
<youtube>keTjrGXqJuA</youtube>
Line 407: Line 524:
 
===  Bell Inequality Test (CHSH) ===
 
===  Bell Inequality Test (CHSH) ===
 
Determining the exclusive-or (XOR) mask over which a given black-box function is invariant
 
Determining the exclusive-or (XOR) mask over which a given black-box function is invariant
* [http://algassert.com/quirk Quirk]  
+
* [https://algassert.com/quirk Quirk]  
 
<youtube>zcqZHYo7ONs</youtube>
 
<youtube>zcqZHYo7ONs</youtube>
 
<youtube>6TslH7ToFb8</youtube>
 
<youtube>6TslH7ToFb8</youtube>
 +
 +
= Quantum as a service (QaaS) =
 +
[https://www.youtube.com/results?search_query=Quantum+QaaS YouTube search...]
 +
[https://www.google.com/search?q=Quantum+QaaS ...Google search]
 +
 +
* [https://www.quera.com/blog-posts/quantum-as-a-service-definition-advantages-and-examples Quantum-as-a-Service: Definition, Advantages and Examples | IQuEra]
 +
 +
Quantum as a Service (QaaS) is a cloud-based service that provides access to quantum computing platforms over the internet. It combines the potential of quantum computing with the simplicity of cloud computing, and is similar to other "as-a-Service" models like Software-as-a-Service (SaaS), Platform-as-a-Service (PaaS), and Infrastructure-as-a-Service (IaaS). QaaS resources are typically available via subscriptions or pay-as-you-go bases.
 +
 +
companies offer Quantum-as-a-Service (QaaS):
 +
 +
* Amazon Braket - cloud-based quantum computing services offered by Amazon Web Services
 +
 +
* Azure Quantum - Microsoft Azure 
 +
 
 +
* qBraid 
 +
 +
* Strangeworks
 +
 +
* Terra Quantum, which offers "Quantum Algorithms as a Service", "Quantum Computing as a Service", and "Quantum Security as a Service".
 +
 +
* Oxford Quantum Circuits, which offers cloud access to its quantum computers in Europe through a private cloud and in partnership with AWS.
 +
 +
* Xanadu, which provides quantum computing hardware and software through its Xanadu Quantum Cloud (XQC) service and Strawberry Fields application library.
 +
 +
* D-Wave Systems, which is the world's first commercial supplier of quantum computers and offers quantum computing services.
 +
 +
* [[Baidu]], which provides quantum computing capabilities through its Baidu Quantum platform and Quantum-as-a-Service offering.
 +
 +
* Intel, which offers quantum computing services through its Intel Quantum platform and Quantum-as-a-Service.
  
 
== <span id="Quantum Development Algorithms & Kits"></span>Quantum Development Algorithms & Kits ==
 
== <span id="Quantum Development Algorithms & Kits"></span>Quantum Development Algorithms & Kits ==
Line 417: Line 564:
  
 
==== <span id="Qiskit"></span>Qiskit ====
 
==== <span id="Qiskit"></span>Qiskit ====
[http://www.youtube.com/results?search_query=Qiskit+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=Qiskit+quantum Youtube search...]
[http://www.google.com/search?q=Qiskit+quantum ...Google search]
+
[https://www.google.com/search?q=Qiskit+quantum ...Google search]
  
* [http://qiskit.org/ Qiskit] (Quantum Information Science Kit) is an open-source quantum computing software development framework for leveraging today's quantum processors;  
+
* [https://qiskit.org/ Qiskit] (Quantum Information Science Kit) is an open-source quantum computing software development framework for leveraging today's quantum processors;  
** [http://github.com/Qiskit?language=jupyter+notebook Jupyter Notebooks]:
+
** [https://github.com/Qiskit?language=jupyter+notebook Jupyter Notebooks]:
*** [http://github.com/Qiskit/qiskit-community-tutorials Awesome community-contributed Jupyter notebooks] that leverage the features of Qiskit in education and applications.
+
*** [https://github.com/Qiskit/qiskit-community-tutorials Awesome community-contributed Jupyter notebooks] that leverage the features of Qiskit in education and applications.
*** [http://github.com/Qiskit/qiskit-iqx-tutorials Qiskit IQX Tutorials] a collection of Jupyter notebooks aimed at teaching people who want to use Qiskit for writing quantum computing programs, and executing them on one of several backends (online quantum processors, online simulators, and local simulators).
+
*** [https://github.com/Qiskit/qiskit-iqx-tutorials Qiskit IQX Tutorials] a collection of Jupyter notebooks aimed at teaching people who want to use Qiskit for writing quantum computing programs, and executing them on one of several backends (online quantum processors, online simulators, and local simulators).
*** [http://github.com/Qiskit/qiskit-textbook A university quantum algorithms/computation course supplement based on Qiskit] - The Jupyter notebooks corresponding to each section of the textbook can be found in the folders.  
+
*** [https://github.com/Qiskit/qiskit-textbook A university quantum algorithms/computation course supplement based on Qiskit] - The Jupyter notebooks corresponding to each section of the textbook can be found in the folders.  
*** [http://github.com/Qiskit/qiskit-presentations Presentations] that have been given about Qiskit
+
*** [https://github.com/Qiskit/qiskit-presentations Presentations] that have been given about Qiskit
* [http://medium.com/qiskit Qiskit Blog] - a community to discuss Qiskit, programming quantum computers, and anything else related to quantum computing.
+
* [https://medium.com/qiskit Qiskit Blog] - a community to discuss Qiskit, programming quantum computers, and anything else related to quantum computing.
* [http://community.Qiskit.org/textbook/ Learn Quantum Computation using Qiskit] A university quantum algorithms/computation course supplement based on Qiskit
+
* [https://community.Qiskit.org/textbook/ Learn Quantum Computation using Qiskit] A university quantum algorithms/computation course supplement based on Qiskit
* [http://medium.com/Qiskit/how-to-program-a-quantum-computer-982a9329ed02 How to program a quantum computer | James Wootton]
+
* [https://medium.com/Qiskit/how-to-program-a-quantum-computer-982a9329ed02 How to program a quantum computer | James Wootton]
* [http://developer.ibm.com/code/2017/05/17/developers-guide-to-quantum-qiskit-sdk/ A developer’s guide to using the Quantum Qiskit SDK | IBM]
+
* [https://developer.ibm.com/code/2017/05/17/developers-guide-to-quantum-qiskit-sdk/ A developer’s guide to using the Quantum Qiskit SDK | IBM]
** [http://github.com/Qiskit/openqasm Open Quantum Assembly Language (OpenQASM)] an intermediate representation for quantum instructions.
+
** [https://github.com/Qiskit/openqasm Open Quantum Assembly Language (OpenQASM)] an intermediate representation for quantum instructions.
** [http://github.com/Qiskit/ibmq-device-information/tree/master/backends/rueschlikon/V1 IBM Q 16 Rueschlikon V1.x.x] The connectivity on the device is provided by total 22 coplanar waveguide (CPW) "bus" resonators, each of which connects two [[Quantum#Qubit|Qubit]]s. The connectivity configuration is shown in the figure below; the colored dots indicate [[Quantum#Qubit|Qubit]]s, and the colored bars indicate CPW bus resonators. Three different resonant frequencies are used for the bus resonators. The white bars indicate the buses with a resonant frequency of 6.25 GHz, the grey bars 6.45 GHz, and the black bars 6.65 GHz.
+
** [https://github.com/Qiskit/ibmq-device-information/tree/master/backends/rueschlikon/V1 IBM Q 16 Rueschlikon V1.x.x] The connectivity on the device is provided by total 22 coplanar waveguide (CPW) "bus" resonators, each of which connects two [[Quantum#Qubit|Qubit]]s. The connectivity configuration is shown in the figure below; the colored dots indicate [[Quantum#Qubit|Qubit]]s, and the colored bars indicate CPW bus resonators. Three different resonant frequencies are used for the bus resonators. The white bars indicate the buses with a resonant frequency of 6.25 GHz, the grey bars 6.45 GHz, and the black bars 6.65 GHz.
** Use a minute of a quantum computer: To access this chipset you will need an account on [http://quantum-computing.ibm.com/ IBM Quantum Experience]. And then generate the token from [http://quantum-computing.ibm.com/ here.]
+
** Use a minute of a quantum computer: To access this chipset you will need an account on [https://quantum-computing.ibm.com/ IBM Quantum Experience]. And then generate the token from [https://quantum-computing.ibm.com/ here.]
 
** [https://www.technologyreview.com/f/614346/ibms-new-53-qubit-quantum-computer-is-the-most-powerful-machine-you-can-use IBM’s new 53-[[Quantum#Qubit|Qubit]] quantum computer is the most powerful machine you can use | MIT Technology Review]  
 
** [https://www.technologyreview.com/f/614346/ibms-new-53-qubit-quantum-computer-is-the-most-powerful-machine-you-can-use IBM’s new 53-[[Quantum#Qubit|Qubit]] quantum computer is the most powerful machine you can use | MIT Technology Review]  
* [http://quantum-computing.ibm.com/support IBM Q Full User Guide] - Short tutorials providing a gentle introduction to quantum computing and IBM Q.
+
* [https://quantum-computing.ibm.com/support IBM Q Full User Guide] - Short tutorials providing a gentle introduction to quantum computing and IBM Q.
* [[Quantum#PennyLane|PennyLane]] a cross-platform Python library for quantum machine learning
+
* [[Quantum#PennyLane|PennyLane]] a cross-platform [[Python]] library for quantum machine learning
* [http://github.com/QISKit/qiskit-js Qiskit for JavaScript]
+
* [https://github.com/QISKit/qiskit-js Qiskit for JavaScript] ... [[JavaScript]]
  
  
<img src="http://github.com/Qiskit/ibmq-device-information/raw/master/backends/rueschlikon/images/ibmqx3-bus.png" width="500" height="175">
+
<img src="https://github.com/Qiskit/ibmq-device-information/raw/master/backends/rueschlikon/images/ibmqx3-bus.png" width="500" height="175">
  
<img src="http://github.com/Qiskit/ibmq-device-information/raw/master/backends/rueschlikon/images/ibmqx3-labeled.png" width="200" height="200">
+
<img src="https://github.com/Qiskit/ibmq-device-information/raw/master/backends/rueschlikon/images/ibmqx3-labeled.png" width="200" height="200">
  
 
<youtube>a1NZC5rqQD8</youtube>
 
<youtube>a1NZC5rqQD8</youtube>
Line 448: Line 595:
 
<youtube>v8Ujo27Rx0s</youtube>
 
<youtube>v8Ujo27Rx0s</youtube>
 
<youtube>_xFOPmdjwCI</youtube>
 
<youtube>_xFOPmdjwCI</youtube>
<youtube>LSA3pYZtRGg</youtube>
+
<youtube>pJEGZjW1z1Q</youtube>
  
 
==== <span id="ProjectQ"></span>ProjectQ ====
 
==== <span id="ProjectQ"></span>ProjectQ ====
[http://www.youtube.com/results?search_query=ProjectQ+quantum Youtube search...]
+
[[Quantum#TensorFlow Quantum| TensorFlow Quantum]]
[http://www.google.com/search?q=ProjectQ+quantum ...Google search]
+
 
 +
[https://www.youtube.com/results?search_query=ProjectQ+quantum Youtube search...]
 +
[https://www.google.com/search?q=ProjectQ+quantum ...Google search]
 +
 
 +
* [https://mc.ai/training-quantum-neural-networks-with-pennylane-pytorch-and-tensorflow/ Training quantum neural networks with PennyLane, PyTorch, and TensorFlow | Medium]
 +
* [[Quantum#PennyLane|PennyLane]] a cross-platform [[Python]] library for quantum machine learning
  
 
ProjectQ is an open-source compilation framework capable of targeting various types of hardware and a high-performance quantum computer simulator with emulation capabilities, and various compiler plug-ins.
 
ProjectQ is an open-source compilation framework capable of targeting various types of hardware and a high-performance quantum computer simulator with emulation capabilities, and various compiler plug-ins.
 
* [http://mc.ai/training-quantum-neural-networks-with-pennylane-pytorch-and-tensorflow/ Training quantum neural networks with PennyLane, PyTorch, and TensorFlow | Medium]
 
* [[Quantum#PennyLane|PennyLane]] a cross-platform Python library for quantum machine learning
 
  
 
<youtube>9WLuIOfM3f4</youtube>
 
<youtube>9WLuIOfM3f4</youtube>
Line 463: Line 612:
  
 
==== <span id="Forest"></span>Forest ====
 
==== <span id="Forest"></span>Forest ====
[http://www.youtube.com/results?search_query=Forest+quil+pyQuil+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=Forest+quil+pyQuil+quantum Youtube search...]
[http://www.google.com/search?q=Forest+quil+pyQuil+quantum ...Google search]
+
[https://www.google.com/search?q=Forest+quil+pyQuil+quantum ...Google search]
  
* [http://www.rigetti.com/forest Forest SDK] - lightweight, downloadable SDK includes a powerful QVM that runs locally| Rigetti Computing   
+
* [https://www.rigetti.com/forest Forest SDK] - lightweight, downloadable SDK includes a powerful QVM that runs locally| Rigetti Computing   
* [http://pyquil.readthedocs.io/en/latest/ Forest SDK documentation]
+
* [https://pyquil.readthedocs.io/en/latest/ Forest SDK documentation]
 
* [[Quantum#Quil|Quil]] Instruction Set
 
* [[Quantum#Quil|Quil]] Instruction Set
  
Line 475: Line 624:
  
 
=== <span id="Braket"></span>Braket ===
 
=== <span id="Braket"></span>Braket ===
[http://www.youtube.com/results?search_query=Braket+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=Braket+quantum Youtube search...]
[http://www.google.com/search?q=Braket+quantum ...Google search]
+
[https://www.google.com/search?q=Braket+quantum ...Google search]
  
a new cloud computing service that gives developers and researchers a way to tinker with quantum circuits. According to an Amazon news release, users will be able to build out their own quantum circuits and applications and test them on Amazon’s machine. Amazon didn’t actually build a quantum computer — instead, it partnered with other organizations that did — Instead, it partnered with three companies — D-Wave, IonQ, and Rigetti — that did build their own.  [http://futurism.com/the-byte/amazon-run-programs-quantum-computer Amazon Is Now Letting Anyone Run Programs On Its Quantum Computer | Dan Robitzski]
+
a new cloud computing service that gives developers and researchers a way to tinker with quantum circuits. According to an Amazon news release, users will be able to build out their own quantum circuits and applications and test them on Amazon’s machine. Amazon didn’t actually build a quantum computer — instead, it partnered with other organizations that did — Instead, it partnered with three companies — D-Wave, IonQ, and Rigetti — that did build their own.  [https://futurism.com/the-byte/amazon-run-programs-quantum-computer Amazon Is Now Letting Anyone Run Programs On Its Quantum Computer | Dan Robitzski]
  
 
=== <span id="Qilimanjaro"></span>Qilimanjaro ===
 
=== <span id="Qilimanjaro"></span>Qilimanjaro ===
[http://www.youtube.com/results?search_query=Qilimanjaro+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=Qilimanjaro+quantum Youtube search...]
[http://www.google.com/search?q=Qilimanjaro+quantum ...Google search]
+
[https://www.google.com/search?q=Qilimanjaro+quantum ...Google search]
  
* [http://www.qilimanjaro.tech/ Qilimanjaro] build a unique first-to-market full-stack coherent quantum annealing computer with an easy-to-use advanced algorithmic toolset to effectively address complex optimization problems in multiple real-world industry use cases.
+
* [https://www.qilimanjaro.tech/ Qilimanjaro] build a unique first-to-market full-stack coherent quantum annealing computer with an easy-to-use advanced algorithmic toolset to effectively address complex optimization problems in multiple real-world industry use cases.
  
 
* Address existing quantum hardware platforms
 
* Address existing quantum hardware platforms
Line 496: Line 645:
  
  
<img src="http://hackernoon.com/hn-images/0*n7k8aKPjIUb-XiLa.jpeg" width="700" height="900">
+
<img src="https://hackernoon.com/hn-images/0*n7k8aKPjIUb-XiLa.jpeg" width="700" height="900">
  
  
 
=== <span id="D-Wave"></span>D-Wave ===
 
=== <span id="D-Wave"></span>D-Wave ===
[http://www.youtube.com/results?search_query=D-Wave+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=D-Wave+quantum Youtube search...]
[http://www.google.com/search?q=D-Wave+quantum ...Google search]
+
[https://www.google.com/search?q=D-Wave+quantum ...Google search]
  
The quantum bits—also known as [[Quantum#Qubit|Qubit]]s—are the lowest energy states of the superconducting loops that make up the D-Wave QPU. These states have a circulating current and a corresponding magnetic field. As with classical bits, a [[Quantum#Qubit|Qubit]] can be in state of 0 or 1. But because the [[Quantum#Qubit|Qubit]] is a quantum object, it can also be in a [[Quantum#Superposition|Superposition]] of the 0 state and the 1 state at the same time. At the end of the quantum annealing process, each [[Quantum#Qubit|Qubit]] collapses from a [[Quantum#Superposition|Superposition]] state into either 0 or 1 (a classical state). The physics of this process can be shown (visualized) with an energy diagram. This diagram changes over time, as we can see in (a), (b), and (c). To begin, there is just one valley (a), with a single minimum. The quantum annealing process runs, the barrier is raised, and this turns the energy diagram into what is known as a double-well potential (b). Here, the low point of the left valley corresponds to the 0 state, and the low point of the right valley corresponds to the 1 state. The [[Quantum#Qubit|Qubit]] ends up in one of these valleys at the end of the anneal. [http://docs.dwavesys.com/docs/latest/c_gs_2.html Introduction to Quantum Annealing | D-Wave]
+
The quantum bits—also known as [[Quantum#Qubit|Qubit]]s—are the lowest energy states of the superconducting loops that make up the D-Wave QPU. These states have a circulating current and a corresponding magnetic field. As with classical bits, a [[Quantum#Qubit|Qubit]] can be in state of 0 or 1. But because the [[Quantum#Qubit|Qubit]] is a quantum object, it can also be in a [[Quantum#Superposition|Superposition]] of the 0 state and the 1 state at the same time. At the end of the quantum annealing process, each [[Quantum#Qubit|Qubit]] collapses from a [[Quantum#Superposition|Superposition]] state into either 0 or 1 (a classical state). The physics of this process can be shown (visualized) with an energy diagram. This diagram changes over time, as we can see in (a), (b), and (c). To begin, there is just one valley (a), with a single minimum. The quantum annealing process runs, the barrier is raised, and this turns the energy diagram into what is known as a double-well potential (b). Here, the low point of the left valley corresponds to the 0 state, and the low point of the right valley corresponds to the 1 state. The [[Quantum#Qubit|Qubit]] ends up in one of these valleys at the end of the anneal. [https://docs.dwavesys.com/docs/latest/c_gs_2.html Introduction to Quantum Annealing | D-Wave]
  
<img src="http://docs.dwavesys.com/docs/latest/_images/change.png" width="700" height="200">
+
<img src="https://docs.dwavesys.com/docs/latest/_images/change.png" width="700" height="200">
  
  
* [http://www.dwavesys.com/ D-Wave - Quantum Computing Company]
+
* [https://www.dwavesys.com/ D-Wave - Quantum Computing Company]
* [http://www.dwavesys.com/quantum-computing Quantum Computing]
+
* [https://www.dwavesys.com/quantum-computing Quantum Computing]
* [http://www.dwavesys.com/take-leap Leap] Hands-on coding: interactive examples and Jupyter notebooks with live code, equations, visualizations, and narrative text. Learning resources: comprehensive live demos and educational resources. Community support: community and technical forums for developer collaboration
+
* [https://www.dwavesys.com/take-leap Leap] Hands-on coding: interactive examples and Jupyter notebooks with live code, equations, visualizations, and narrative text. Learning resources: comprehensive live demos and educational resources. Community support: community and technical forums for developer collaboration
** [http://docs.ocean.dwavesys.com/en/latest/ Ocean software development kit (SDK)] with suite of open source Python tools and templates
+
** [https://docs.ocean.dwavesys.com/en/latest/ Ocean software development kit (SDK)] with suite of open source [[Python]] tools and templates
** Use a minute of a quantum computer: [http://docs.dwavesys.com/docs/latest/c_gs_8.html Submitting a Problem to the D-Wave System] free, immediate access to a D-Wave 2000Q quantum computer
+
** Use a minute of a quantum computer: [https://docs.dwavesys.com/docs/latest/c_gs_8.html Submitting a Problem to the D-Wave System] free, immediate access to a D-Wave 2000Q quantum computer
  
 
<youtube>Djzct7HQDOE</youtube>
 
<youtube>Djzct7HQDOE</youtube>
Line 519: Line 668:
 
<youtube>kG0xZqHDk0k</youtube>
 
<youtube>kG0xZqHDk0k</youtube>
  
=== SDKs based on simulators ===
+
== <span id="Quantum Brilliance"></span>[https://quantumbrilliance.com/ Quantum Brilliance] ==
 +
[https://www.youtube.com/results?search_query=Quantum+Brilliance Youtube search...]
 +
[https://www.google.com/search?q=Quantum+Brilliance ...Google search]
 +
 
 +
* [https://quantumbrilliance.com/ Quantum Brilliance]
 +
* [https://newatlas.com/quantum-computing/quantum-computing-desktop-room-temperature/ Quantum computing hits the desktop, no cryo-cooling required | Loz Blain - New Atlas]
 +
 
 +
An Australian/German company is developing powerful quantum accelerators the size of graphics cards. They work at room temperature, undercutting and outperforming today's huge, cryo-cooled quantum supercomputers, and soon they'll be small enough for mobile devices. Properties of the nitrogen-vacancy (NV) centre in diamonds. NV centres in diamond have the longest coherence time of any room temperature quantum state. This means that as qubits they can operate anywhere a classical computer can.
 +
 
 +
The nitrogen-vacancy center (N-V center or NV center) is one of numerous point defects in diamond. Its most explored and useful property is its photoluminescence, which allows observers to read out its spin-state. The NV center's electron spin, localized at atomic scales, can be manipulated at room temperature by external factors such as magnetic, or electric fields, microwave radiation, or light, resulting in sharp resonances in the intensity of the photoluminescence. These resonances can be explained in terms of electron spin related phenomena such as quantum entanglement, spin–orbit interaction and Rabi oscillations, and analysed using advanced quantum optics theory. An individual NV center can be used as a basic unit for a quantum computer, a qubit, used f.e. for quantum cryptography. Further potential applications in novel fields of electronics and sensing include spintronics, masers, and quantum sensors. If the charge is not specified the term "NV center" refers to the negatively charged NV− center.[https://en.wikipedia.org/wiki/Nitrogen-vacancy_center Wikipedia]
 +
 
 +
https://assets.newatlas.com/dims4/default/afe796c/2147483647/strip/true/crop/1087x476+0+0/resize/1087x476!/format/webp/quality/90/?url=http%3A%2F%2Fnewatlas-brightspot.s3.amazonaws.com%2Fed%2F39%2F3e2507b14282933f1b3871e17d21%2Funtitled-1.jpg
 +
 
 +
 
 +
 
 +
Quantum Software Development Kit (SDK)
 +
 
 +
= SDKs based on simulators =
 
Public access to quantum devices is currently planned for the following SDKs, but not yet implemented.
 
Public access to quantum devices is currently planned for the following SDKs, but not yet implemented.
* [http://algassert.com/quirk Quirk] a drag-and-drop quantum circuit simulator
+
* [https://algassert.com/quirk Quirk] a drag-and-drop quantum circuit simulator
* [http://demonstrations.wolfram.com/search.html?query=quantum Wolfram Demonstrations Project - Quantum]
+
* [https://demonstrations.wolfram.com/search.html?query=quantum Wolfram Demonstrations Project - Quantum]
  
 +
=== <span id="Intel Quantum Software Development Kit"></span>Intel Quantum Software Development Kit ===
 +
* [https://download.intel.com/newsroom/2022/2022innovation/quantum-sdk-backgrounder.pdf Developing Software for the Quantum Era | Intel]
 +
* [https://www.reuters.com/technology/intel-releases-software-platform-quantum-computing-developers-2023-02-28/ Intel releases software platform for quantum computing developers | Jane Lee - Reuters]
  
==== <span id="Microsoft Quantum Development Kit"></span>Microsoft Quantum Development Kit ====
+
The Intel Quantum SDK includes an intuitive user interface based on C++, a low-level virtual machine (LLVM)-based compiler toolchain with a quantum runtime environment optimized for executing hybrid quantum-classical algorithms and a high-performance Intel® Quantum Simulator (IQS) qubit target backend. Future releases will feature different qubit target backends, including a quantum dot qubit simulator and, eventually, an Intel quantum dot qubit device as the target backend will also be offered.
[http://www.youtube.com/results?search_query=Q#+Microsoft+quantum Youtube search...]
 
[http://www.google.com/search?q=Q#+Microsoft+quantum ...Google search]
 
  
* [http://marketplace.visualstudio.com/items?itemName=quantum.DevKit Quantum Development Kit | Microsoft]
+
==== <span id="Microsoft Quantum Development Kit"></span>[[Microsoft]] Quantum Development Kit ====
** [http://docs.microsoft.com/en-us/quantum/language/?view=qsharp-preview The Q# Programming Language | Microsoft]
+
[https://www.youtube.com/results?search_query=Q#+Microsoft+quantum Youtube search...]
** [http://cloudblogs.microsoft.com/quantum/2019/03/27/quantum-development-kit-update-brings-q-to-jupyter-notebooks/ Quantum Development Kit Update brings Q# to Jupyter Notebooks | Microsoft]
+
[https://www.google.com/search?q=Q#+Microsoft+quantum ...Google search]
*** [http://github.com/Microsoft/Quantum/blob/master/Samples/src/Teleportation/Notebook.ipynb Teleport Juypter Notebook] Quantum teleportation provides a way of moving a quantum state from one location to another without having to move physical particle(s) along with it. This is done with the help of previously shared quantum entanglement between the sending and the receiving locations and classical communication. To see how to implement this in Q#, we first define a Teleport Q# operation that transfers the state of one [[Quantum#Qubit|Qubit]] into another.
+
 
* [http://github.com/Microsoft/QuantumKatas/ The Quantum Katas] are a series of self-paced tutorials aimed at teaching you elements of quantum computing and Q# programming at the same time | GitHub]
+
* [https://marketplace.visualstudio.com/items?itemName=quantum.DevKit Quantum Development Kit | Microsoft]
* [[Quantum#PennyLane|PennyLane]] a cross-platform Python library for quantum machine learning
+
** [https://docs.microsoft.com/en-us/quantum/language/?view=qsharp-preview The Q# Programming Language | Microsoft]
 +
** [https://cloudblogs.microsoft.com/quantum/2019/03/27/quantum-development-kit-update-brings-q-to-jupyter-notebooks/ Quantum Development Kit Update brings Q# to Jupyter Notebooks | Microsoft]
 +
*** [https://github.com/Microsoft/Quantum/blob/master/Samples/src/Teleportation/Notebook.ipynb Teleport Juypter Notebook] Quantum teleportation provides a way of moving a quantum state from one location to another without having to move physical particle(s) along with it. This is done with the help of previously shared quantum entanglement between the sending and the receiving locations and classical communication. To see how to implement this in Q#, we first define a Teleport Q# operation that transfers the state of one [[Quantum#Qubit|Qubit]] into another.
 +
* [https://github.com/Microsoft/QuantumKatas/ The Quantum Katas] are a series of self-paced tutorials aimed at teaching you elements of quantum computing and Q# programming at the same time | GitHub]
 +
* [[Quantum#PennyLane|PennyLane]] a cross-platform [[Python]] library for quantum machine learning
  
 
<youtube>jfFHstQDFVA</youtube>
 
<youtube>jfFHstQDFVA</youtube>
Line 543: Line 714:
  
 
==== <span id="Cirq"></span>Cirq ====
 
==== <span id="Cirq"></span>Cirq ====
[http://www.youtube.com/results?search_query=Cirq+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=Cirq+quantum Youtube search...]
[http://www.google.com/search?q=Cirq+quantum ...Google search]
+
[https://www.google.com/search?q=Cirq+quantum ...Google search]
  
A python framework for creating, editing, and invoking Noisy Intermediate Scale Quantum (NISQ) circuits.
+
* [https://quantumai.google/cirq Cirq |] [[Google]]
 +
* [https://github.com/quantumlib/cirq Cirq] - a [[Python]] library for writing, manipulating, and optimizing quantum circuits and running them against quantum computers and simulators. | Google]
 +
* [[Quantum#PennyLane|PennyLane]] a cross-platform [[Python]] library for quantum machine learning
  
* [http://github.com/quantumlib/cirq Cirq] - a Python library for writing, manipulating, and optimizing quantum circuits and running them against quantum computers and simulators. | Google]
+
A [[Python]] framework for creating, editing, and invoking Noisy Intermediate Scale Quantum (NISQ) circuits; running them against quantum computers and simulators.
* [[Quantum#PennyLane|PennyLane]] a cross-platform Python library for quantum machine learning
 
  
 
<youtube>16ZfkPRVf2w</youtube>
 
<youtube>16ZfkPRVf2w</youtube>
Line 557: Line 729:
  
 
==== <span id="Strawberry Fields"></span>Strawberry Fields ====
 
==== <span id="Strawberry Fields"></span>Strawberry Fields ====
[http://www.youtube.com/results?search_query=Strawberry+Fields+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=Strawberry+Fields+quantum Youtube search...]
[http://www.google.com/search?q=Strawberry+Fields+quantum ...Google search]
+
[https://www.google.com/search?q=Strawberry+Fields+quantum ...Google search]
  
 
* [[Quantum#Xanadu|Xanadu]]
 
* [[Quantum#Xanadu|Xanadu]]
* [[Quantum#PennyLane|PennyLane]] a cross-platform Python library for quantum machine learning
+
* [[Quantum#PennyLane|PennyLane]] a cross-platform [[Python]] library for quantum machine learning
 
* [[Quantum#Blackbird|Blackbird]] Quantum Instruction Set
 
* [[Quantum#Blackbird|Blackbird]] Quantum Instruction Set
* [http://medium.com/xanaduai/quantum-machine-learning-1-0-76a525c8cf69 Quantum Machine Learning 1.0 | Maria Schuld - Xanadu - Medium]
+
* [[Quantum#TensorFlow Quantum| TensorFlow Quantum]]
* [https://strawberryfields.readthedocs.io/en/latest/ Strawberry Fields] - is a full-stack Python library for designing, simulating, and optimizing continuous variable quantum optical circuits. | Xanadu
+
* [https://medium.com/xanaduai/quantum-machine-learning-1-0-76a525c8cf69 Quantum Machine Learning 1.0 | Maria Schuld - Xanadu - Medium]
 +
* [https://strawberryfields.readthedocs.io/en/latest/ Strawberry Fields] - is a full-stack [[Python]] library for designing, simulating, and optimizing continuous variable quantum optical circuits. | Xanadu
 
** An open-source software architecture for photonic quantum computing
 
** An open-source software architecture for photonic quantum computing
** A full-stack quantum software platform, implemented in Python specifically targeted to the CV model
+
** A full-stack quantum software platform, implemented in [[Python]] specifically targeted to the CV model
 
** Quantum circuits are written using the easy-to-use and intuitive [[Quantum#Blackbird|Blackbird]] quantum programming language
 
** Quantum circuits are written using the easy-to-use and intuitive [[Quantum#Blackbird|Blackbird]] quantum programming language
** Powers the [http://strawberryfields.ai Strawberry Fields Interactive] web app, which allows anyone to run a quantum computing simulation via drag and drop
+
** Powers the [https://strawberryfields.ai Strawberry Fields Interactive] web app, which allows anyone to run a quantum computing simulation via drag and drop
 
** Includes quantum computer simulators implemented using [[Python#NumPy |NumPy]] and [[Tensorflow]] - these built-in quantum compiler tools convert and optimize Blackbird code for classical simulation
 
** Includes quantum computer simulators implemented using [[Python#NumPy |NumPy]] and [[Tensorflow]] - these built-in quantum compiler tools convert and optimize Blackbird code for classical simulation
 
** Future releases will aim to target experimental backends, including photonic quantum computing chips
 
** Future releases will aim to target experimental backends, including photonic quantum computing chips
  
http://strawberryfields.readthedocs.io/en/latest/_images/thumbnail1.gif
+
https://strawberryfields.readthedocs.io/en/latest/_images/thumbnail1.gif
<img src="http://strawberryfields.readthedocs.io/en/latest/_images/laptop.png" width="200" height="100">
+
<img src="https://strawberryfields.readthedocs.io/en/latest/_images/laptop.png" width="200" height="100">
<img src="http://strawberryfields.readthedocs.io/en/latest/_images/NOON.png" width="200" height="150">
+
<img src="https://strawberryfields.readthedocs.io/en/latest/_images/NOON.png" width="200" height="150">
  
 
<youtube>B2n0TxRDWPs</youtube>
 
<youtube>B2n0TxRDWPs</youtube>
Line 580: Line 753:
  
 
==== <span id="t|ket>"></span>t|ket> ====
 
==== <span id="t|ket>"></span>t|ket> ====
[http://www.youtube.com/results?search_query=t|ket>+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=t|ket>+quantum Youtube search...]
[http://www.google.com/search?q=t|ket>+quantum ...Google search]
+
[https://www.google.com/search?q=t|ket>+quantum ...Google search]
  
A quantum programming environment developed by [http://cambridgequantum.com/ Cambridge Quantum Computing], that targets simulators and quantum hardware. It is for use with the hardware produced by the [http://en.wikipedia.org/wiki/NQIT NQIT] hub, as well as [http://oxfordquantumcircuits.com/ Oxford Quantum Circuits].
+
A quantum programming environment developed by [https://cambridgequantum.com/ Cambridge Quantum Computing], that targets simulators and quantum hardware. It is for use with the hardware produced by the [https://en.wikipedia.org/wiki/NQIT NQIT] hub, as well as [https://oxfordquantumcircuits.com/ Oxford Quantum Circuits].
* http://cambridgequantum.com/parameterized-quantum-circuits-as-machine-learning-models/ Parameterized Quantum Circuits As Machine Learning Models | Cambridge Quantum Computing]
+
* https://cambridgequantum.com/parameterized-quantum-circuits-as-machine-learning-models/ Parameterized Quantum Circuits As Machine Learning Models | Cambridge Quantum Computing]
 +
 
 +
=== Silicon Devices ===
 +
 
 +
[https://www.youtube.com/results?search_query=Silicon+chip+quantum Youtube search...]
 +
[https://www.google.com/search?q=Silicon+chip+quantum ...Google search]
 +
 
 +
* [https://scitechdaily.com/major-breakthrough-as-quantum-computing-in-silicon-hits-99-accuracy/ Major Breakthrough As Quantum Computing in Silicon Hits 99% Accuracy | University of New South Wales] ...For the first time in silicon, a team of engineers led by Andrea Morello at UNSW Sydney has demonstrated a three-qubit quantum processor in silicon where every operation – one-qubit logic, two-qubit logic, and qubit initialisation and measurement – is performed with better than 99% fidelity.
 +
 
 +
<youtube>bjLUhg5mKic</youtube>
 +
 
 +
 
 +
=== <span id="TensorFlow Quantum"></span>TensorFlow Quantum ===
 +
* [https://www.tensorflow.org/quantum TensorFlow Quantum (TFQ)] ... a library for hybrid quantum-classical machine learning
 +
* [https://arxiv.org/abs/2003.02989 TensorFlow Quantum: A Software Framework for Quantum Machine Learning | M. Broughton, G. Verdon, T. McCourt, A. Martinez, J. Yoo, S. Isakov, P. Massey, R. Halavati, M. Niu, A. Zlokapa, E. Peters, O. Lockwood, A. Skolik, S. Jerbi, V. Dunjko, M. Leib, M. Streif, D. Von Dollen, H. Chen, S. Cao, R. Wiersema, H. Huang, J. McClean, R. Babbush, S. Boixo, D. Bacon, A. Ho, H. Neven, M. Mohseni
 +
* [https://venturebeat.com/2020/03/09/google-launches-tensorflow-quantum-a-machine-learning-framework-for-training-quantum-models/ Google launches TensorFlow Quantum, a machine learning framework for training quantum models | Khari Johnson - VentureBeat]  ...[https://www.tensorflow.org/quantum TensorFlow Quantum (TFQ) is a library for hybrid quantum-classical machine learning]
 +
 
 +
TensorFlow Quantum simplifies the swift development of hybrid quantum-classical machine learning models. Those engaged in quantum algorithm and application research can harness the power of Google's quantum computing frameworks seamlessly through [[TensorFlow]]. TensorFlow Quantum is dedicated to quantum data processing and constructing hybrid quantum-classical models. It seamlessly incorporates quantum computing algorithms and logical constructs from [[Quantum#Cirq | Cirq]] while offering quantum computing primitives that seamlessly blend with existing TensorFlow APIs. Additionally, it comes equipped with high-performance quantum circuit simulators for efficient experimentation.
  
 
=== Simulating and Graphing ===
 
=== Simulating and Graphing ===
 
==== <span id="QuTIP"></span>QuTIP ====
 
==== <span id="QuTIP"></span>QuTIP ====
[http://www.youtube.com/results?search_query=QuTIP+quantum Youtube search...]
+
[https://www.youtube.com/results?search_query=QuTIP+quantum Youtube search...]
[http://www.google.com/search?q=QuTIP+quantum ...Google search]
+
[https://www.google.com/search?q=QuTIP+quantum ...Google search]
  
* [http://qutip.org/index.html QuTIP]
+
* [https://qutip.org/index.html QuTIP]
** [http://qutip.org/tutorials.html Tutorial]  
+
** [https://qutip.org/tutorials.html Tutorial]  
 
    
 
    
 
QuTiP is open-source software for simulating the dynamics of open quantum systems. The QuTiP library depends on the excellent [[Python#Numpy| Numpy]], [[Python#SciPy| SciPy]], and [[Cython]] numerical packages. In addition, graphical output is provided by [[Python#Matplotlib| Matplotlib]]. QuTiP aims to provide user-friendly and efficient numerical simulations of a wide variety of Hamiltonians, including those with arbitrary time-dependence, commonly found in a wide range of physics applications such as quantum optics, trapped ions, superconducting circuits, and quantum nanomechanical resonators. QuTiP is freely available for use and/or modification on all major platforms such as Linux, Mac OSX, and Windows*. Being free of any licensing fees, QuTiP is ideal for exploring quantum mechanics and dynamics in the classroom.
 
QuTiP is open-source software for simulating the dynamics of open quantum systems. The QuTiP library depends on the excellent [[Python#Numpy| Numpy]], [[Python#SciPy| SciPy]], and [[Cython]] numerical packages. In addition, graphical output is provided by [[Python#Matplotlib| Matplotlib]]. QuTiP aims to provide user-friendly and efficient numerical simulations of a wide variety of Hamiltonians, including those with arbitrary time-dependence, commonly found in a wide range of physics applications such as quantum optics, trapped ions, superconducting circuits, and quantum nanomechanical resonators. QuTiP is freely available for use and/or modification on all major platforms such as Linux, Mac OSX, and Windows*. Being free of any licensing fees, QuTiP is ideal for exploring quantum mechanics and dynamics in the classroom.
Line 600: Line 790:
  
 
= Concepts =
 
= Concepts =
* [http://www.physicsoftheuniverse.com/glossary.html The Physics of the Universe - Difficult Topics Made Understandable]
+
* [https://www.physicsoftheuniverse.com/glossary.html The Physics of the Universe - Difficult Topics Made Understandable]
  
 
== Concepts: Intrinsic Properties ==
 
== Concepts: Intrinsic Properties ==
  
* <span id="Bell State"></span><b><i>Bell State</i></b> - a maximally entangled quantum state of two qubits. a concept in quantum information science, are specific quantum states of two [[Quantum#Qubit|Qubit]]s that represent the simplest (and maximal) examples of quantum entanglement. The Bell states are a form of entangled and normalized basis vectors. This normalization implies that the overall probability of the particle being in one of the mentioned states is 1. Bell states can be generalized to represent specific quantum states of multi-[[Quantum#Qubit|Qubit]] systems, such as the [[Quantum#Greenberger–Horne–Zeilinger (GHZ) State|Greenberger–Horne–Zeilinger (GHZ) State]] for 3 subsystems. [http://en.wikipedia.org/wiki/Bell_state ...Wikipedia]
+
* <span id="Bell State"></span><b><i>Bell State</i></b> - a maximally entangled quantum state of two qubits. a concept in quantum information science, are specific quantum states of two [[Quantum#Qubit|Qubit]]s that represent the simplest (and maximal) examples of quantum entanglement. The Bell states are a form of entangled and normalized basis vectors. This normalization implies that the overall probability of the particle being in one of the mentioned states is 1. Bell states can be generalized to represent specific quantum states of multi-[[Quantum#Qubit|Qubit]] systems, such as the [[Quantum#Greenberger–Horne–Zeilinger (GHZ) State|Greenberger–Horne–Zeilinger (GHZ) State]] for 3 subsystems. [https://en.wikipedia.org/wiki/Bell_state ...Wikipedia]
  
http://upload.wikimedia.org/wikipedia/commons/thumb/b/bb/H_CNOTGate.png/220px-H_CNOTGate.png
+
https://upload.wikimedia.org/wikipedia/commons/thumb/b/bb/H_CNOTGate.png/220px-H_CNOTGate.png
  
 
<youtube>tMoHhqERK9I</youtube>
 
<youtube>tMoHhqERK9I</youtube>
  
* <span id="Greenberger–Horne–Zeilinger (GHZ) State"></span><b><i>Greenberger–Horne–Zeilinger (GHZ) State</i></b> - a certain type of entangled quantum state that involves at least three subsystems (particles). Extremely non-classical properties of the state have been observed. There is no standard measure of multi-partite entanglement because different, not mutually convertible, types of multi-partite entanglement exist. Nonetheless, many measures define the GHZ state to be maximally entangled state. ... [http://en.wikipedia.org/wiki/Greenberger%E2%80%93Horne%E2%80%93Zeilinger_state ...Wikipedia]  To create such a GHZ state, we start with a three-qubit quantum register. By default, each qubit in the register is initialized to |0⟩. To make the GHZ state, we apply the following gates:  
+
* <span id="Greenberger–Horne–Zeilinger (GHZ) State"></span><b><i>Greenberger–Horne–Zeilinger (GHZ) State</i></b> - a certain type of entangled quantum state that involves at least three subsystems (particles). Extremely non-classical properties of the state have been observed. There is no standard measure of multi-partite entanglement because different, not mutually convertible, types of multi-partite entanglement exist. Nonetheless, many measures define the GHZ state to be maximally entangled state. ... [https://en.wikipedia.org/wiki/Greenberger%E2%80%93Horne%E2%80%93Zeilinger_state ...Wikipedia]  To create such a GHZ state, we start with a three-qubit quantum register. By default, each qubit in the register is initialized to |0⟩. To make the GHZ state, we apply the following gates:  
 
* Hadamard gate 𝐻 on qubit 0, which puts it into the superposition state (|0⟩+|1⟩)/2⎯⎯√.
 
* Hadamard gate 𝐻 on qubit 0, which puts it into the superposition state (|0⟩+|1⟩)/2⎯⎯√.
 
* controlled-Not operation (𝐶𝑋) between qubit 0 and qubit 1.
 
* controlled-Not operation (𝐶𝑋) between qubit 0 and qubit 1.
 
* controlled-Not operation between qubit 0 and qubit 2.
 
* controlled-Not operation between qubit 0 and qubit 2.
  
http://entangledphysics.files.wordpress.com/2016/03/web.png
+
https://entangledphysics.files.wordpress.com/2016/03/web.png
  
http://www.neutroninterferometry.com/wp-content/uploads/2016/09/IFM_SpinFlipp_GHZ_Final-700x580.jpg
+
https://www.neutroninterferometry.com/wp-content/uploads/2016/09/IFM_SpinFlipp_GHZ_Final-700x580.jpg
  
 
<youtube>P5u-Qp_GQJY</youtube>
 
<youtube>P5u-Qp_GQJY</youtube>
  
  
* <span id="Quantum tunneling"></span><b><i>Quantum tunneling</i></b> - able to bypass any barriers i.e move through walls ... [http://en.wikipedia.org/wiki/Quantum_tunnelling ...Wikipedia]
+
* <span id="Quantum tunneling"></span><b><i>Quantum tunneling</i></b> - able to bypass any barriers i.e move through walls ... [https://en.wikipedia.org/wiki/Quantum_tunnelling ...Wikipedia]
  
 
<youtube>-IfmgyXs7z8</youtube>
 
<youtube>-IfmgyXs7z8</youtube>
Line 632: Line 822:
  
  
* <span id="Quantum Wave"></span><b><i>Quantum Wave</i></b> - a complex-valued probability amplitude, and the probabilities for the possible results of measurements made on the system can be derived from it. If you've studied light, you may already know a bit about quantum theory. You might know that a beam of light sometimes behaves as though it's made up of particles (like a steady stream of cannonballs), and sometimes as though it's waves of energy rippling through space (a bit like waves on the sea). That's called wave-particle duality and it's one of the ideas that comes to us from quantum theory. It's hard to grasp that something can be two things at once—a particle and a wave. [http://en.wikipedia.org/wiki/Wave%E2%80%93particle_duality  ...Wikipedia] and [http://www.explainthatstuff.com/quantum-computing.html Quantum computing | Chris Woodford - Explain That Stuff]
+
* <span id="Quantum Wave"></span><b><i>Quantum Wave</i></b> - a complex-valued probability amplitude, and the probabilities for the possible results of measurements made on the system can be derived from it. If you've studied light, you may already know a bit about quantum theory. You might know that a beam of light sometimes behaves as though it's made up of particles (like a steady stream of cannonballs), and sometimes as though it's waves of energy rippling through space (a bit like waves on the sea). That's called wave-particle duality and it's one of the ideas that comes to us from quantum theory. It's hard to grasp that something can be two things at once—a particle and a wave. [https://en.wikipedia.org/wiki/Wave%E2%80%93particle_duality  ...Wikipedia] and [https://www.explainthatstuff.com/quantum-computing.html Quantum computing | Chris Woodford - Explain That Stuff]
http://upload.wikimedia.org/wikipedia/commons/thumb/9/90/QuantumHarmonicOscillatorAnimation.gif/280px-QuantumHarmonicOscillatorAnimation.gif
+
https://upload.wikimedia.org/wikipedia/commons/thumb/9/90/QuantumHarmonicOscillatorAnimation.gif/280px-QuantumHarmonicOscillatorAnimation.gif
  
 
<youtube>KKr91v7yLcM</youtube>
 
<youtube>KKr91v7yLcM</youtube>
Line 641: Line 831:
 
<youtube>-xhqk93ITxk</youtube>
 
<youtube>-xhqk93ITxk</youtube>
  
* <span id="Quantum Fourier transform (QFT)"></span><b><i>Quantum Fourier transform (QFT)</i></b> - a linear transformation on quantum bits, and is the quantum analogue of the inverse discrete Fourier transform ...[http://en.wikipedia.org/wiki/Quantum_Fourier_transform ...Wikipedia]
+
* <span id="Quantum Fourier transform (QFT)"></span><b><i>Quantum Fourier transform (QFT)</i></b> - a linear transformation on quantum bits, and is the quantum analogue of the inverse discrete Fourier transform ...[https://en.wikipedia.org/wiki/Quantum_Fourier_transform ...Wikipedia]
** [http://algassert.com/quirk Quirk]
+
** [https://algassert.com/quirk Quirk]
 
** [[Math for Intelligence#Fourier Transform (FT), Fourier Series, and Fourier Analysis |Fourier Transform (FT), Fourier Series, and Fourier Analysis]]
 
** [[Math for Intelligence#Fourier Transform (FT), Fourier Series, and Fourier Analysis |Fourier Transform (FT), Fourier Series, and Fourier Analysis]]
  
 
<youtube>G7REKtbIKiY</youtube>
 
<youtube>G7REKtbIKiY</youtube>
  
* <span id="Coherence"></span><b><i>Coherence</i></b> - the idea that all objects have wave-like properties. If an object's wave-like nature is split in two, then the two waves may coherently interfere with each other in such a way as to form a single state that is a [[Quantum#Superposition|Superposition]] of the two states. [http://phys.org/news/2015-06-physicists-quantum-coherence-entanglement-sides.html Physicists find quantum coherence and quantum entanglement are two sides of the same coin | Lisa Zyga - Phys.org]
+
* <span id="Coherence"></span><b><i>Coherence</i></b> - the idea that all objects have wave-like properties. If an object's wave-like nature is split in two, then the two waves may coherently interfere with each other in such a way as to form a single state that is a [[Quantum#Superposition|Superposition]] of the two states. [https://phys.org/news/2015-06-physicists-quantum-coherence-entanglement-sides.html Physicists find quantum coherence and quantum entanglement are two sides of the same coin | Lisa Zyga - Phys.org]
  
 
Quantum coherence and quantum entanglement are two landmark features of quantum physics, and now physicists have demonstrated that the two phenomena are "operationally equivalent"—that is, equivalent for all practical purposes, though still conceptually distinct.  
 
Quantum coherence and quantum entanglement are two landmark features of quantum physics, and now physicists have demonstrated that the two phenomena are "operationally equivalent"—that is, equivalent for all practical purposes, though still conceptually distinct.  
  
<img src="http://scx1.b-cdn.net/csz/news/800/2015/coherenceand.jpg" width="500" height="300">
+
<img src="https://scx1.b-cdn.net/csz/news/800/2015/coherenceand.jpg" width="500" height="300">
  
 
<youtube>S9U_KWP5gB8</youtube>
 
<youtube>S9U_KWP5gB8</youtube>
  
* <span id="Decoherence"></span><b><i>Decoherence</i></b> - happens when anything gets in the way of a [[Quantum#Qubit|Qubit]]'s job, The interaction of [[Quantum#Qubit|Qubit]] with their environment in ways that cause their quantum behavior to decay and ultimately disappear. [[Quantum#Qubit|Qubit]]'s quantum state is extremely fragile. The slightest vibration or change in temperature—disturbances known as “noise” in quantum-speak—can cause [[Quantum#Qubit|Qubit]] to tumble out of [[Quantum#Superposition|Superposition]] before their job has been properly done. That’s why researchers do their best to protect [[Quantum#Qubit|Qubit]]s from the outside world in those supercooled fridges and vacuum chambers. But despite their efforts, noise still causes lots of errors to creep into calculations. Smart quantum algorithms can compensate for some of these, and adding more [[Quantum#Qubit|Qubit]]s also helps. However, it will likely take thousands of standard [[Quantum#Qubit|Qubit]]s to create a single, highly reliable one, known as a “logical” [[Quantum#Qubit|Qubit]]. This will sap a lot of a quantum computer’s computational capacity. - #1 enemy of quantum computing. [http://www.technologyreview.com/s/612844/what-is-quantum-computing/ Explainer: What is a quantum computer? | Martin Giles - MIT Technology Review] [http://en.wikipedia.org/wiki/Quantum_decoherence ...Wikipedia]
+
* <span id="Decoherence"></span><b><i>Decoherence</i></b> - happens when anything gets in the way of a [[Quantum#Qubit|Qubit]]'s job, The interaction of [[Quantum#Qubit|Qubit]] with their environment in ways that cause their quantum behavior to decay and ultimately disappear. [[Quantum#Qubit|Qubit]]'s quantum state is extremely fragile. The slightest vibration or change in temperature—disturbances known as “noise” in quantum-speak—can cause [[Quantum#Qubit|Qubit]] to tumble out of [[Quantum#Superposition|Superposition]] before their job has been properly done. That’s why researchers do their best to protect [[Quantum#Qubit|Qubit]]s from the outside world in those supercooled fridges and vacuum chambers. But despite their efforts, noise still causes lots of errors to creep into calculations. Smart quantum algorithms can compensate for some of these, and adding more [[Quantum#Qubit|Qubit]]s also helps. However, it will likely take thousands of standard [[Quantum#Qubit|Qubit]]s to create a single, highly reliable one, known as a “logical” [[Quantum#Qubit|Qubit]]. This will sap a lot of a quantum computer’s computational capacity. - #1 enemy of quantum computing. [https://www.technologyreview.com/s/612844/what-is-quantum-computing/ Explainer: What is a quantum computer? | Martin Giles - MIT Technology Review] [https://en.wikipedia.org/wiki/Quantum_decoherence ...Wikipedia]
  
 
<youtube>4auHhpn7BUc</youtube>
 
<youtube>4auHhpn7BUc</youtube>
  
* <span id="Quantum Negativity"></span><b><i>Quantum Negativity</i></b> - is a measure of quantum entanglement. Quasi-probability allows negative probabilities, like a -100%, to explain concepts such as quantum entanglement.  Quantum particles can carry an unlimited amount of information about things they have interacted with and could enable far more precise measurements and power new technologies, such as super-precise microscopes and quantum computers....We are used to dealing with probabilities that range from 0% (never happens) to 100% (always happens). To explain results from the quantum world however, the concept of probability needs to be expanded to include a so-called quasi-probability, which can be negative. This quasi-probability allows quantum concepts such as Einstein’s ‘spooky action at a distance’ and wave-particle duality to be explained in an intuitive mathematical language. For example, the probability of an atom being at a certain position and traveling with a specific speed might be a negative number, such as -5%. An experiment whose explanation requires negative probabilities is said to possess ‘quantum negativity.’ Quantum Negativity can be used to take more precise measurements of everything from molecular distances to gravitational waves. [http://scitechdaily.com/ultra-precise-measurements-powered-by-quantum-negativity-highly-counterintuitive-and-truly-amazing/ Ultra-Precise Measurements Powered by Quantum Negativity – “Highly Counterintuitive and Truly Amazing!” | University of Cambridge - SciTechDaily]
+
* <span id="Quantum Negativity"></span><b><i>Quantum Negativity</i></b> - is a measure of quantum entanglement. Quasi-probability allows negative probabilities, like a -100%, to explain concepts such as quantum entanglement.  Quantum particles can carry an unlimited amount of information about things they have interacted with and could enable far more precise measurements and power new technologies, such as super-precise microscopes and quantum computers....We are used to dealing with probabilities that range from 0% (never happens) to 100% (always happens). To explain results from the quantum world however, the concept of probability needs to be expanded to include a so-called quasi-probability, which can be negative. This quasi-probability allows quantum concepts such as Einstein’s ‘spooky action at a distance’ and wave-particle duality to be explained in an intuitive mathematical language. For example, the probability of an atom being at a certain position and traveling with a specific speed might be a negative number, such as -5%. An experiment whose explanation requires negative probabilities is said to possess ‘quantum negativity.’ Quantum Negativity can be used to take more precise measurements of everything from molecular distances to gravitational waves. [https://scitechdaily.com/ultra-precise-measurements-powered-by-quantum-negativity-highly-counterintuitive-and-truly-amazing/ Ultra-Precise Measurements Powered by Quantum Negativity – “Highly Counterintuitive and Truly Amazing!” | University of Cambridge - SciTechDaily]
** [http://www.nature.com/articles/s41467-020-17559-w Quantum advantage in postselected metrology | D. Arvidsson-Shukur, N. Halpern, H. Lepage, A. Lasek, C. Barnes and S. Lloyd - 28 July 2020, Nature Communications]
+
** [https://www.nature.com/articles/s41467-020-17559-w Quantum advantage in postselected metrology | D. Arvidsson-Shukur, N. Halpern, H. Lepage, A. Lasek, C. Barnes and S. Lloyd - 28 July 2020, Nature Communications]
  
  
* <span id="Locality"></span><b><i>Locality</i></b> - an object is directly influenced only by its immediate surroundings. The concept is that for an action at one point to have an influence at another point, something in the space between those points such as a field must mediate the action. To exert an influence, something, such as a wave or particle, must travel through the space between the two points, carrying the influence. <i>This is an alternative to the older concept of instantaneous [http://en.wikipedia.org/wiki/Action_at_a_distance"action at a distance"]</i>. In 1935 [http://en.wikipedia.org/wiki/Albert_Einstein Albert <b>E</b>instein], [http://en.wikipedia.org/wiki/Boris_Podolsky Boris <b>P</b>odolsky] and [http://en.wikipedia.org/wiki/Nathan_Rosen Nathan <b>R</b>osen] in their [http://en.wikipedia.org/wiki/EPR_paradox <b>EPR</b> paradox] theorized that quantum mechanics might not be a local theory, because a measurement made on one of a pair of separated but entangled particles causes a simultaneous effect, the collapse of the wave function, in the remote particle (i.e. an effect exceeding the speed of light). In 1964 [http://en.wikipedia.org/wiki/John_Stewart_Bell John Stewart Bell] formulated the [http://en.wikipedia.org/wiki/Bell%27s_theorem "Bell inequality"], which, if violated in actual experiments, implies that quantum mechanics violates either locality or realism, another principle which relates to the value of unmeasured quantities. The two principles are commonly referred to as a single principle, [http://en.wikipedia.org/wiki/Principle_of_locality#Local_realism local realism]. ... [http://en.wikipedia.org/wiki/Principle_of_locality Wikipedia]
+
* <span id="Locality"></span><b><i>Locality</i></b> - an object is directly influenced only by its immediate surroundings. The concept is that for an action at one point to have an influence at another point, something in the space between those points such as a field must mediate the action. To exert an influence, something, such as a wave or particle, must travel through the space between the two points, carrying the influence. <i>This is an alternative to the older concept of instantaneous [https://en.wikipedia.org/wiki/Action_at_a_distance"action at a distance"]</i>. In 1935 [https://en.wikipedia.org/wiki/Albert_Einstein Albert <b>E</b>instein], [https://en.wikipedia.org/wiki/Boris_Podolsky Boris <b>P</b>odolsky] and [https://en.wikipedia.org/wiki/Nathan_Rosen Nathan <b>R</b>osen] in their [https://en.wikipedia.org/wiki/EPR_paradox <b>EPR</b> paradox] theorized that quantum mechanics might not be a local theory, because a measurement made on one of a pair of separated but entangled particles causes a simultaneous effect, the collapse of the wave function, in the remote particle (i.e. an effect exceeding the speed of light). In 1964 [https://en.wikipedia.org/wiki/John_Stewart_Bell John Stewart Bell] formulated the [https://en.wikipedia.org/wiki/Bell%27s_theorem "Bell inequality"], which, if violated in actual experiments, implies that quantum mechanics violates either locality or realism, another principle which relates to the value of unmeasured quantities. The two principles are commonly referred to as a single principle, [https://en.wikipedia.org/wiki/Principle_of_locality#Local_realism local realism]. ... [https://en.wikipedia.org/wiki/Principle_of_locality Wikipedia]
  
* <span id="Renormalization"></span><b><i>Renormalization</i></b> - In physics, certain universal features of a quantum many-body system, such as the phase (e.g., liquid, gas, solid, etc.) of materials do not depend on (or are not sensitive to) microscopically detailed information of the system, but rather governed by only a few important hidden parameters. Renormalization is a theory technique to identify those important parameters starting from microscopic description of a quantum system. The theory of self-similar geometric structures, that are used to treat infinities arising in calculated quantities by altering values of quantities to compensate for effects of their self-interactions. ... [http://en.wikipedia.org/wiki/Renormalization Wikipedia]
+
* <span id="Renormalization"></span><b><i>Renormalization</i></b> - In physics, certain universal features of a quantum many-body system, such as the phase (e.g., liquid, gas, solid, etc.) of materials do not depend on (or are not sensitive to) microscopically detailed information of the system, but rather governed by only a few important hidden parameters. Renormalization is a theory technique to identify those important parameters starting from microscopic description of a quantum system. The theory of self-similar geometric structures, that are used to treat infinities arising in calculated quantities by altering values of quantities to compensate for effects of their self-interactions. ... [https://en.wikipedia.org/wiki/Renormalization Wikipedia]
  
 
<youtube>CUQvfvb5XXg</youtube>
 
<youtube>CUQvfvb5XXg</youtube>
  
  
* <span id="Quantum Dot (QD)"></span><b><i>Quantum Dot (QD)</i></b> - are tiny semiconductor particles a few nanometres in size, having optical and electronic properties that differ from larger particles due to quantum mechanics. They are a central topic in nanotechnology. When the quantum dots are illuminated by UV light, an electron in the quantum dot can be excited to a state of higher energy. ... [http://en.wikipedia.org/wiki/Quantum_dot ...Wikipedia]
+
* <span id="Quantum Dot (QD)"></span><b><i>Quantum Dot (QD)</i></b> - are tiny semiconductor particles a few nanometres in size, having optical and electronic properties that differ from larger particles due to quantum mechanics. They are a central topic in nanotechnology. When the quantum dots are illuminated by UV light, an electron in the quantum dot can be excited to a state of higher energy. ... [https://en.wikipedia.org/wiki/Quantum_dot ...Wikipedia]
  
 
<youtube>L-7CQ-waIBA</youtube>
 
<youtube>L-7CQ-waIBA</youtube>
 
<youtube>y9dt5uTvsEM</youtube>
 
<youtube>y9dt5uTvsEM</youtube>
  
* <span id="Interference"></span><b><i>Interference</i></b> - a phenomenon in which two waves superpose to form a resultant wave of greater, lower, or the same amplitude. Constructive and destructive interference result from the interaction of waves that are correlated or coherent with each other, either because they come from the same source or because they have the same or nearly the same frequency. Interference effects can be observed with all types of waves, for example, light, radio, acoustic, surface water waves, gravity waves, or matter waves. The resulting images or graphs are called interferograms. ... [http://en.wikipedia.org/wiki/Wave_interference ...Wikipedia]
+
* <span id="Interference"></span><b><i>Interference</i></b> - a phenomenon in which two waves superpose to form a resultant wave of greater, lower, or the same amplitude. Constructive and destructive interference result from the interaction of waves that are correlated or coherent with each other, either because they come from the same source or because they have the same or nearly the same frequency. Interference effects can be observed with all types of waves, for example, light, radio, acoustic, surface water waves, gravity waves, or matter waves. The resulting images or graphs are called interferograms. ... [https://en.wikipedia.org/wiki/Wave_interference ...Wikipedia]
  
http://i.pinimg.com/originals/de/fb/68/defb684fef583b3d7cf1ab26b47578dc.gif
+
https://i.pinimg.com/originals/de/fb/68/defb684fef583b3d7cf1ab26b47578dc.gif
  
 
<youtube>kOcPHOJ7GAQ</youtube>
 
<youtube>kOcPHOJ7GAQ</youtube>
Line 685: Line 875:
 
<span id="Quantum Double Slit Experiment"></span><b><i>Quantum Double Slit Experiment</i></b>
 
<span id="Quantum Double Slit Experiment"></span><b><i>Quantum Double Slit Experiment</i></b>
  
* [http://www.scientificamerican.com/article/giant-molecules-exist-in-two-places-at-once-in-unprecedented-quantum-experiment/ Giant Molecules Exist in Two Places at Once in Unprecedented Quantum Experiment - The new study demonstrates a bizarre quantum effect at never-before-seen scales | Rafi Letzter - Scientific American]
+
* [https://www.scientificamerican.com/article/giant-molecules-exist-in-two-places-at-once-in-unprecedented-quantum-experiment/ Giant Molecules Exist in Two Places at Once in Unprecedented Quantum Experiment - The new study demonstrates a bizarre quantum effect at never-before-seen scales | Rafi Letzter - Scientific American]
  
 
One of the deepest mysteries in quantum physics is the wave-particle duality: every quantum object has properties of both a wave and a particle. Nowhere is this effect more beautifully demonstrated than in the double-slit experiment: streams of particles, photons and electrons are directed at a barrier with two narrow openings. While each particle shows up at the detector individually, the population as a whole creates an interference pattern as though they are waves. Neither a pure wave nor a pure particle description has proven successful in explaining these experiments.
 
One of the deepest mysteries in quantum physics is the wave-particle duality: every quantum object has properties of both a wave and a particle. Nowhere is this effect more beautifully demonstrated than in the double-slit experiment: streams of particles, photons and electrons are directed at a barrier with two narrow openings. While each particle shows up at the detector individually, the population as a whole creates an interference pattern as though they are waves. Neither a pure wave nor a pure particle description has proven successful in explaining these experiments.
  
* [http://www.quantumlaserpointers.com/ Quantum Laser Pointers.com]
+
* [https://www.quantumlaserpointers.com/ Quantum Laser Pointers.com]
  
 
Quantum laser pointers brings you the infamous double slit experiment right in the palm of your hand.  In 1801 English physicist Thomas Young performed this experiment to determine if light was a particle or a wave.  A laser shines a coherent beam of light through a film disc containing two parallel slits.  Light striking the wall behind the slits producers a classic interference pattern.  This surprising result means light passes through the parallel slits not as particles but as waves.  When the peaks of two waves overlap it creates a band of light.  When the peak of one wave meets the valley of another, light is cancelled out.  Variations of this experiment spurred public debates between Albert Einstein and Neils Bohr on the true nature of reality.  It’s been called the granddaddy of all quantum weirdness.
 
Quantum laser pointers brings you the infamous double slit experiment right in the palm of your hand.  In 1801 English physicist Thomas Young performed this experiment to determine if light was a particle or a wave.  A laser shines a coherent beam of light through a film disc containing two parallel slits.  Light striking the wall behind the slits producers a classic interference pattern.  This surprising result means light passes through the parallel slits not as particles but as waves.  When the peaks of two waves overlap it creates a band of light.  When the peak of one wave meets the valley of another, light is cancelled out.  Variations of this experiment spurred public debates between Albert Einstein and Neils Bohr on the true nature of reality.  It’s been called the granddaddy of all quantum weirdness.
Line 695: Line 885:
 
<youtube>JCpd6ajLIOs</youtube>
 
<youtube>JCpd6ajLIOs</youtube>
  
* <span id="Diffraction"></span><b><i>Diffraction</i></b> - refers to various phenomena that occur when a wave encounters an obstacle or a slit. It is defined as the bending of waves around the corners of an obstacle or through an aperture into the region of geometrical shadow of the obstacle/aperture. The diffracting object or aperture effectively becomes a secondary source of the propagating wave. ... [http://en.wikipedia.org/wiki/Diffraction ...Wikipedia]
+
* <span id="Diffraction"></span><b><i>Diffraction</i></b> - refers to various phenomena that occur when a wave encounters an obstacle or a slit. It is defined as the bending of waves around the corners of an obstacle or through an aperture into the region of geometrical shadow of the obstacle/aperture. The diffracting object or aperture effectively becomes a secondary source of the propagating wave. ... [https://en.wikipedia.org/wiki/Diffraction ...Wikipedia]
  
<youtube>XQD8wBf4-5Q</youtube>
+
<youtube>1bHipDSHVG4</youtube>
  
  
* <span id="Delayed Choice Quantum Eraser"></span><b><i>Delayed Choice Quantum Eraser</i></b> - The delayed-choice quantum eraser experiment investigates a paradox. If a photon manifests itself as though it had come by a single path to the detector, then "common sense" (which [http://en.wikipedia.org/wiki/Wheeler%27s_delayed-choice_experiment Wheeler] and others challenge) says that it must have entered the double-slit device as a particle. If a photon manifests itself as though it had come by two indistinguishable paths, then it must have entered the double-slit device as a wave. If the experimental apparatus is changed while the photon is in mid‑flight, then the photon should reverse its original "decision" as to whether to be a wave or a particle.  ... [http://en.wikipedia.org/wiki/Delayed-choice_quantum_eraser ...Wikipedia]
+
* <span id="Delayed Choice Quantum Eraser"></span><b><i>Delayed Choice Quantum Eraser</i></b> -  
 +
* [[Time]] ... [[Time#Positioning, Navigation and Timing (PNT)|PNT]] ... [[Time#Global Positioning System (GPS)|GPS]] ... [[Causation vs. Correlation#Retrocausality| Retrocausality]] ... [[Quantum#Delayed Choice Quantum Eraser|Delayed Choice Quantum Eraser]] ... [[Quantum]]
 +
* [https://en.wikipedia.org/wiki/Quantum_eraser_experiment Quantum eraser experiment | Wikipedia]
 +
 
 +
The delayed-choice quantum eraser experiment investigates a paradox. If a photon manifests itself as though it had come by a single path to the detector, then "common sense" (which [https://en.wikipedia.org/wiki/Wheeler%27s_delayed-choice_experiment Wheeler] and others challenge) says that it must have entered the double-slit device as a particle. If a photon manifests itself as though it had come by two indistinguishable paths, then it must have entered the double-slit device as a wave. If the experimental apparatus is changed while the photon is in mid‑flight, then the photon should reverse its original "decision" as to whether to be a wave or a particle.  ... [https://en.wikipedia.org/wiki/Delayed-choice_quantum_eraser ...Wikipedia]
  
 
<youtube>H6HLjpj4Nt4</youtube>
 
<youtube>H6HLjpj4Nt4</youtube>
 
<youtube>SzAQ36b9dzs</youtube>
 
<youtube>SzAQ36b9dzs</youtube>
  
* <span id="Quantum Teleportation"></span><b><i>Quantum Teleportation</i></b> - is distinct from regular teleportation, as it does not transfer particles from one place to another, but rather transmits the information necessary to prepare a target system in the same quantum state as the source system. ... [http://en.wikipedia.org/wiki/Teleportation ...Wikipedia]  
+
* <span id="Quantum Teleportation"></span><b><i>Quantum Teleportation</i></b> - is distinct from regular teleportation, as it does not transfer particles from one place to another, but rather transmits the information necessary to prepare a target system in the same quantum state as the source system. ... [https://en.wikipedia.org/wiki/Teleportation ...Wikipedia]  
 
** [[Quantum#Entanglement|Entanglement]]
 
** [[Quantum#Entanglement|Entanglement]]
** [http://www.sciencemag.org/news/2017/06/china-s-quantum-satellite-achieves-spooky-action-record-distance China’s quantum satellite achieves ‘spooky action’ at record distance  |  Gabriel Popkin - Science]
+
** [https://www.sciencemag.org/news/2017/06/china-s-quantum-satellite-achieves-spooky-action-record-distance [[Government Services#China|China]]’s quantum satellite achieves ‘spooky action’ at record distance  |  Gabriel Popkin - Science]
** [http://www.technologyreview.com/s/608252/first-object-teleported-from-earth-to-orbit/ First Object Teleported from Earth to Orbit | Emerging Technology from the arXiv - MIT Technology Review] - Researchers in [[Government Services#China|China]] have teleported a photon from the ground to a satellite orbiting more than 500 kilometers above.
+
** [https://www.technologyreview.com/s/608252/first-object-teleported-from-earth-to-orbit/ First Object Teleported from Earth to Orbit | Emerging Technology from the arXiv - MIT Technology Review] - Researchers in [[Government Services#China|China]] have teleported a photon from the ground to a satellite orbiting more than 500 kilometers above.
  
http://www.sciencemag.org/sites/default/files/styles/inline__699w__no_aspect/public/SuperLASER_Drupal_1.1.png
+
https://www.sciencemag.org/sites/default/files/styles/inline__699w__no_aspect/public/SuperLASER_Drupal_1.1.png
  
 
<youtube>yb38jozeDOs</youtube>
 
<youtube>yb38jozeDOs</youtube>
Line 716: Line 910:
  
  
* <span id="Superconducting"></span><b><i>Superconducting</i></b> - quantum computing - In a superconductor, the basic charge carriers are pairs of electrons (known as [http://en.wikipedia.org/wiki/Cooper_pair Cooper pairs]), rather than the single electrons in a normal conductor. The total spin of a [http://en.wikipedia.org/wiki/Cooper_pair Cooper pair] is an integer number, thus the [http://en.wikipedia.org/wiki/Cooper_pair Cooper pairs] are [http://en.wikipedia.org/wiki/Boson bosons](while the single electrons in the normal conductor are [http://en.wikipedia.org/wiki/Fermion fermions]). Cooled [http://en.wikipedia.org/wiki/Boson bosons], contrary to cooled [http://en.wikipedia.org/wiki/Fermion fermions, are allowed to occupy a single quantum energy level, in an effect known as the [http://en.wikipedia.org/wiki/Bose%E2%80%93Einstein_condensate Bose-Einstein condensate]. In a classical interpretation it would correspond to multiple particles occupying the same position in space and having an equal momentum, effectively behaving as a single particle. ... [http://en.wikipedia.org/wiki/Superconducting_quantum_computing Wikipedia]
+
* <span id="Superconducting"></span><b><i>Superconducting</i></b> - quantum computing - In a superconductor, the basic charge carriers are pairs of electrons (known as [https://en.wikipedia.org/wiki/Cooper_pair Cooper pairs]), rather than the single electrons in a normal conductor. The total spin of a [https://en.wikipedia.org/wiki/Cooper_pair Cooper pair] is an integer number, thus the [https://en.wikipedia.org/wiki/Cooper_pair Cooper pairs] are [https://en.wikipedia.org/wiki/Boson bosons](while the single electrons in the normal conductor are [https://en.wikipedia.org/wiki/Fermion fermions]). Cooled [https://en.wikipedia.org/wiki/Boson bosons], contrary to cooled [https://en.wikipedia.org/wiki/Fermion fermions, are allowed to occupy a single quantum energy level, in an effect known as the [https://en.wikipedia.org/wiki/Bose%E2%80%93Einstein_condensate Bose-Einstein condensate]. In a classical interpretation it would correspond to multiple particles occupying the same position in space and having an equal momentum, effectively behaving as a single particle. ... [https://en.wikipedia.org/wiki/Superconducting_quantum_computing Wikipedia]
  
 
<youtube>t5nxusm_Umk</youtube>
 
<youtube>t5nxusm_Umk</youtube>
  
* <span id="Absolute Zero"></span><b><i>Absolute Zero</i></b> - The lowest temperature possible, equivalent to -273.15°C (or 0° on the absolute Kelvin scale), at which point atoms cease to move altogether and molecular energy is minimal. The idea that it is impossible, through any physical process, to lower the temperature of a system to zero is known as the Third Law of Thermodynamics. The lowest limit of the thermodynamic temperature scale, a state at which the enthalpy and entropy of a cooled ideal gas reach their minimum value, taken as 0°. The fundamental particles of nature have minimum vibrational motion, retaining only quantum mechanical, zero-point energy-induced particle motion. ... [http://en.wikipedia.org/wiki/Absolute_zero ...Wikipedia]
+
* <span id="Absolute Zero"></span><b><i>Absolute Zero</i></b> - The lowest temperature possible, equivalent to -273.15°C (or 0° on the absolute Kelvin scale), at which point atoms cease to move altogether and molecular energy is minimal. The idea that it is impossible, through any physical process, to lower the temperature of a system to zero is known as the Third Law of Thermodynamics. The lowest limit of the thermodynamic temperature scale, a state at which the enthalpy and entropy of a cooled ideal gas reach their minimum value, taken as 0°. The fundamental particles of nature have minimum vibrational motion, retaining only quantum mechanical, zero-point energy-induced particle motion. ... [https://en.wikipedia.org/wiki/Absolute_zero ...Wikipedia]
  
 
<youtube>7jT5rbE69ho</youtube>
 
<youtube>7jT5rbE69ho</youtube>
Line 726: Line 920:
 
== Concepts: Mechanisms for Understanding ==
 
== Concepts: Mechanisms for Understanding ==
  
* <span id="Qubit"></span><b><i>Qubit</i></b> - the fundamental object of information in quantum computing ... [http://en.wikipedia.org/wiki/Qubit Wikipedia]
+
* <span id="Qubit"></span><b><i>Qubit</i></b> - the fundamental object of information in quantum computing ... [https://en.wikipedia.org/wiki/Qubit Wikipedia]
 
<youtube>zNzzGgr2mhk</youtube>
 
<youtube>zNzzGgr2mhk</youtube>
  
  
* <span id="Bloch sphere"></span><b><i>Bloch sphere</i></b> - a geometrical representation of the pure state space of a two-level quantum mechanical system ([[Quantum#Qubit|Qubit]]) Quantum mechanics is mathematically formulated in Hilbert space or projective Hilbert space. The space of pure states of a quantum system is given by the one-dimensional subspaces of the corresponding Hilbert space (or the "points" of the projective Hilbert space). For a two-dimensional Hilbert space, this is simply the complex projective line ℂℙ1. This is the Bloch sphere.... [http://en.wikipedia.org/wiki/Bloch_sphere Wikipedia]
+
* <span id="Bloch sphere"></span><b><i>Bloch sphere</i></b> - a geometrical representation of the pure state space of a two-level quantum mechanical system ([[Quantum#Qubit|Qubit]]) Quantum mechanics is mathematically formulated in Hilbert space or projective Hilbert space. The space of pure states of a quantum system is given by the one-dimensional subspaces of the corresponding Hilbert space (or the "points" of the projective Hilbert space). For a two-dimensional Hilbert space, this is simply the complex projective line ℂℙ1. This is the Bloch sphere.... [https://en.wikipedia.org/wiki/Bloch_sphere Wikipedia]
  
<img src="http://i.stack.imgur.com/puv1Q.gif" width="800" height="300">
+
<img src="https://i.stack.imgur.com/puv1Q.gif" width="800" height="300">
  
[http://github.com/tqdwyer/Bloch-Sphere-Visualization Bloch Sphere Visualization (Python) | Tyler Dwyer - GitHub]
+
[https://github.com/tqdwyer/Bloch-Sphere-Visualization Bloch Sphere Visualization (Python) | Tyler Dwyer - GitHub] ... [[Python]]
  
 
<youtube>qCtB8S7VG8U</youtube>
 
<youtube>qCtB8S7VG8U</youtube>
  
* <span id="Quantum Operator"></span><b><i>Quantum Operator</i></b> - a function over a space of physical states to another space of physical states. The simplest example of the utility of operators is the study of symmetry (which makes the concept of a group useful in this context). Because of this, they are very useful tools in classical mechanics. Operators are even more important in quantum mechanics, where they form an intrinsic part of the formulation of the theory.[http://en.wikipedia.org/wiki/Operator_(physics) Wikipedia]
+
* <span id="Quantum Operator"></span><b><i>Quantum Operator</i></b> - a function over a space of physical states to another space of physical states. The simplest example of the utility of operators is the study of symmetry (which makes the concept of a group useful in this [[context]]). Because of this, they are very useful tools in classical mechanics. Operators are even more important in quantum mechanics, where they form an intrinsic part of the formulation of the theory.[https://en.wikipedia.org/wiki/Operator_(physics) Wikipedia]
  
 
<youtube>LZie2QC5Jbc</youtube>
 
<youtube>LZie2QC5Jbc</youtube>
  
  
* <span id="Hilbert Space"></span><b><i>Hilbert Space</i></b> - an abstract vector space possessing the structure of an inner product that allows length and angle to be measured ...[http://en.wikipedia.org/wiki/Hilbert_space Wikipedia]
+
* <span id="Hilbert Space"></span><b><i>Hilbert Space</i></b> - an abstract vector space possessing the structure of an inner product that allows length and angle to be measured ...[https://en.wikipedia.org/wiki/Hilbert_space Wikipedia]
http://upload.wikimedia.org/wikipedia/commons/thumb/5/5c/Standing_waves_on_a_string.gif/220px-Standing_waves_on_a_string.gif
+
https://upload.wikimedia.org/wikipedia/commons/thumb/5/5c/Standing_waves_on_a_string.gif/220px-Standing_waves_on_a_string.gif
 
https://upload.wikimedia.org/wikipedia/commons/thumb/2/2f/Discrete_complex_vector_components.svg/210px-Discrete_complex_vector_components.svg.png
 
https://upload.wikimedia.org/wikipedia/commons/thumb/2/2f/Discrete_complex_vector_components.svg/210px-Discrete_complex_vector_components.svg.png
http://upload.wikimedia.org/wikipedia/commons/thumb/f/fb/Continuous_complex_vector_components.svg/214px-Continuous_complex_vector_components.svg.png
+
https://upload.wikimedia.org/wikipedia/commons/thumb/f/fb/Continuous_complex_vector_components.svg/214px-Continuous_complex_vector_components.svg.png
  
 
<youtube>zASzj4DkZXY</youtube>  
 
<youtube>zASzj4DkZXY</youtube>  
  
  
* <span id="Dirac Notation"></span><b><i>Dirac Notation .. Bra–ket</i></b> - notation is a standard notation for describing quantum states, composed of angle brackets and vertical bars. It can also be used to denote abstract vectors and linear functionals in mathematics. It is so called because the inner product (or dot product) of two states is denoted by a ⟨bra|c|ket⟩ ...[http://en.wikipedia.org/wiki/Bra%E2%80%93ket_notation Wikipedia]
+
* <span id="Dirac Notation"></span><b><i>Dirac Notation .. Bra–ket</i></b> - notation is a standard notation for describing quantum states, composed of angle brackets and vertical bars. It can also be used to denote abstract vectors and linear functionals in mathematics. It is so called because the inner product (or dot product) of two states is denoted by a ⟨bra|c|ket⟩ ...[https://en.wikipedia.org/wiki/Bra%E2%80%93ket_notation Wikipedia]
  
<img src="http://www.motherjones.com/wp-content/uploads/2018/09/blog_schrodinger1.jpg" width="400" height="200">
+
<img src="https://www.motherjones.com/wp-content/uploads/2018/09/blog_schrodinger1.jpg" width="400" height="200">
  
 
<youtube>fIYIFCVICcA</youtube>
 
<youtube>fIYIFCVICcA</youtube>
Line 759: Line 953:
  
  
* <span id="Schrödinger's Equation"></span><b><i>Schrödinger's Equation</i></b> - a linear partial differential equation that describes the wave function or state function of a quantum-mechanical system ... [http://en.wikipedia.org/wiki/Schr%C3%B6dinger_equation Wikipedia]
+
* <span id="Schrödinger's Equation"></span><b><i>Schrödinger's Equation</i></b> - a linear partial differential equation that describes the wave function or state function of a quantum-mechanical system ... [https://en.wikipedia.org/wiki/Schr%C3%B6dinger_equation Wikipedia]
 
<youtube>jvvkomcmyuo</youtube>
 
<youtube>jvvkomcmyuo</youtube>
  
  
* <span id="Quantum Numbers, Atomic Orbitals, and Electron Configurations"></span><b><i>Quantum Numbers, Atomic Orbitals, and Electron Configurations</i></b> - By solving the Schrödinger equation (Hy = Ey), we obtain a set of mathematical equations, called wave functions (y), which describe the probability of finding electrons at certain energy levels within an atom. A wave function for an electron in an atom is called an atomic orbital; this atomic orbital describes a region of space in which there is a high probability of finding the electron. Energy changes within an atom are the result of an electron changing from a wave pattern with one energy to a wave pattern with a different energy (usually accompanied by the absorption or emission of a photon of light). Each electron in an atom is described by four different quantum numbers. The first three (n, l, ml) specify the particular orbital of interest, and the fourth (ms) specifies how many electrons can occupy that orbital. [http://www.angelo.edu/faculty/kboudrea/general/quantum_numbers/Quantum_Numbers.htm  Angelo State University] ...[http://en.wikipedia.org/wiki/Quantum_number Wikipedia]
+
* <span id="Quantum Numbers, Atomic Orbitals, and Electron Configurations"></span><b><i>Quantum Numbers, Atomic Orbitals, and Electron Configurations</i></b> - By solving the Schrödinger equation (Hy = Ey), we obtain a set of mathematical equations, called wave functions (y), which describe the probability of finding electrons at certain energy levels within an atom. A wave function for an electron in an atom is called an atomic orbital; this atomic orbital describes a region of space in which there is a high probability of finding the electron. Energy changes within an atom are the result of an electron changing from a wave pattern with one energy to a wave pattern with a different energy (usually accompanied by the absorption or emission of a photon of light). Each electron in an atom is described by four different quantum numbers. The first three (n, l, ml) specify the particular orbital of interest, and the fourth (ms) specifies how many electrons can occupy that orbital. [https://www.angelo.edu/faculty/kboudrea/general/quantum_numbers/Quantum_Numbers.htm  Angelo State University] ...[https://en.wikipedia.org/wiki/Quantum_number Wikipedia]
  
* [http://inl.gov/periodic-table/ Interactive Periodic Table | Idaho National Lab (INL)] ...click on an element to expand the information
+
* [https://inl.gov/periodic-table/ Interactive Periodic Table | Idaho National Lab (INL)] ...click on an element to expand the information
  
 
<youtube>Aoi4j8es4gQ</youtube>
 
<youtube>Aoi4j8es4gQ</youtube>
Line 774: Line 968:
 
The class MIP* of languages that can be decided by a classical verifier interacting with multiple all-powerful quantum provers sharing entanglement is equal to the class RE of recursively enumerable languages. [https://arxiv.org/pdf/2001.04383.pdf MIP*=RE | Z. Ji, A. Natarajan, T. Vidick, J. Wright, and H. Yuen]
 
The class MIP* of languages that can be decided by a classical verifier interacting with multiple all-powerful quantum provers sharing entanglement is equal to the class RE of recursively enumerable languages. [https://arxiv.org/pdf/2001.04383.pdf MIP*=RE | Z. Ji, A. Natarajan, T. Vidick, J. Wright, and H. Yuen]
  
MIP* = RE is not a typo. It is a groundbreaking discovery. [http://uk.news.yahoo.com/major-quantum-computational-breakthrough-shaking-141214142.html Major quantum computational breakthrough is shaking up physics and maths | Ittay Weiss - Yahoo! News]
+
MIP* = RE is not a typo. It is a groundbreaking discovery. [https://uk.news.yahoo.com/major-quantum-computational-breakthrough-shaking-141214142.html Major quantum computational breakthrough is shaking up physics and maths | Ittay Weiss - Yahoo! News]
  
 
<youtube>XReR87kFrS4</youtube>
 
<youtube>XReR87kFrS4</youtube>
  
 
<b> Halting Problem </b>
 
<b> Halting Problem </b>
* [http://www.astro.puc.cl/~rparra/tools/PAPERS/turing_1936.pdf On Computable Numbers, with an Application to the Entscheidungsproblem | ][[Creatives#Alan Turing |Alan Turing]]
+
* [https://www.astro.puc.cl/~rparra/tools/PAPERS/turing_1936.pdf On Computable Numbers, with an Application to the Entscheidungsproblem | ][[Creatives#Alan Turing |Alan Turing]]
  
The problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. [http://en.wikipedia.org/wiki/Halting_problem Wikipedia]
+
The problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. [https://en.wikipedia.org/wiki/Halting_problem Wikipedia]
  
 
<youtube>CIq0PUkFDBc</youtube>
 
<youtube>CIq0PUkFDBc</youtube>
Line 789: Line 983:
 
* <span id="Oracle Function"></span><b><i>Oracle Function</i></b>
 
* <span id="Oracle Function"></span><b><i>Oracle Function</i></b>
  
An oracle O is a "black box" operation that is used as input to another algorithm. [http://docs.microsoft.com/en-us/quantum/concepts/oracles?view=qsharp-preview Quantum Oracles | Microsoft]
+
An oracle O is a "black box" operation that is used as input to another algorithm. [https://docs.microsoft.com/en-us/quantum/concepts/oracles?view=qsharp-preview Quantum Oracles | Microsoft]
A super smart or a super slick quantum circuit). It uses the quantum parallelism concept to compute all values of f(x) from the superposition in polynomial time, instead of growing exponentially with the number of bases.  … The key idea is the Oracle function will output values that after applying interference (a transformation), we will measure 0 for all constant functions or 1 for balanced functions.[http://medium.com/@jonathan_hui/qc-quantum-algorithm-with-an-example-cf22c0b1ec31 QC — Quantum Algorithm with an example | Jonathan Hui]
+
A super smart or a super slick quantum circuit). It uses the quantum parallelism concept to compute all values of f(x) from the superposition in polynomial time, instead of growing exponentially with the number of bases.  … The key idea is the Oracle function will output values that after applying interference (a transformation), we will measure 0 for all constant functions or 1 for balanced functions.[https://medium.com/@jonathan_hui/qc-quantum-algorithm-with-an-example-cf22c0b1ec31 QC — Quantum Algorithm with an example | Jonathan Hui]
  
 
<youtube>CIq0PUkFDBc</youtube>
 
<youtube>CIq0PUkFDBc</youtube>
 +
 +
= <span id="Quantum Biology"></span>Quantum Biology =
 +
 +
Quantum biology is the study of applications of quantum mechanics and theoretical chemistry to biological objects and problems. Many biological processes involve the conversion of energy into forms that are usable for chemical transformations, and are quantum mechanical in nature. Such processes involve chemical reactions, light absorption, formation of excited electronic states, transfer of excitation energy, and the transfer of electrons and protons (hydrogen ions) in chemical processes, such as photosynthesis, olfaction and cellular respiration. [https://en.wikipedia.org/wiki/Quantum_biology Quantum biology | Wikipedia]
 +
 +
<youtube>bLeEsYDlXJk</youtube>
 +
<youtube>Zc9Xk99gCr4</youtube>
 +
<youtube>almlINDXU5c</youtube>
 +
<youtube>NW7VUFgwqg8</youtube>
 +
 +
= <span id="Quantum Cryptographic Technology"></span>Quantum Cryptographic Technology =
 +
* [[Quantum#Shor's Period Finding Algorithm| Shor's Period Finding Algorithm]]
 +
* [https://codeburst.io/quantum-threat-to-blockchains-shors-and-grover-s-algorithms-9b01941bed01 Quantum Threat to Blockchains: Shor’s and Grover’s Algorithms | Shaan Ray = Codeburst.io - Medium]
 +
* [https://arxiv.org/pdf/2106.06081.pdf A Survey and Tutorial on Security and Resilience of Quantum Computing | A. Saki, M. Alam, K. Phalak, A. Suresh, R.O. Topaloglu, and S. Ghosh]
 +
* [https://www.microsoft.com/en-us/research/project/post-quantum-tls/ The Transport Layer Security (TLS) protocol | Microsoft]
 +
* [https://queue.acm.org/detail.cfm?id=3466779 The Complex Path to Quantum Resistance | Atefeh Mashatan and Douglas Heintzman - ACMqueue]
 +
* [[Blockchain]]
 +
 +
<img src="https://miro.medium.com/max/7618/1*6H4hvu5ma9zByJYs8x2PRA.jpeg" width="1000">
 +
 +
[https://medium.com/everis-blockchain/how-dlts-could-withstand-the-advent-of-quantum-computers-6536d4217b0e How DLTs could withstand the advent of quantum computers? | Rodny Palomino - Medium]
 +
 +
 +
<youtube>ag5QLl7-R7o</youtube>
 +
<youtube>fLJ9mvTS68Y</youtube>
 +
<youtube>6qD-T1gjtKw</youtube>
 +
<youtube>q6vnfytS51w</youtube>
 +
 +
== National Institute of Standards and Technology (NIST) Computer Security Resource Center (CSRC) ==
 +
* [[National Institute of Standards and Technology (NIST)]]
 +
* [https://csrc.nist.gov/projects/post-quantum-cryptography Post-Quantum Cryptography]
 +
* [https://csrc.nist.gov/publications/detail/white-paper/2021/04/28/getting-ready-for-post-quantum-cryptography/final Getting Ready for Post-Quantum Cryptography: Exploring Challenges Associated with Adopting and Using Post-Quantum Cryptographic Algorithms]
 +
* [https://csrc.nist.gov/projects/post-quantum-cryptography/post-quantum-cryptography-standardization Post-Quantum Cryptography Standardization]
 +
 +
In recent years, there has been a substantial amount of research on quantum computers – machines that exploit quantum mechanical phenomena to solve mathematical problems that are difficult or intractable for conventional computers. If large-scale quantum computers are ever built, they will be able to break many of the public-key cryptosystems currently in use. This would seriously compromise the confidentiality and integrity of digital communications on the Internet and elsewhere.  The goal of post-quantum cryptography (also called quantum-resistant cryptography) is to develop cryptographic systems that are secure against both quantum and classical computers, and can interoperate with existing communications protocols and networks.
 +
 +
<youtube>-VCt8kIZRiA</youtube>
 +
<youtube>TIXg8EernlE</youtube>
 +
 +
== Physics and Cryptology ==
 +
 +
Computers and cryptographic hardware eventually are no Turing machines living in a Platonic world, but real, physical objects that can be touched and accessed, and which consume power, dissipate radiation, or are susceptible to faults and invasive manipulation. This simple observation has had a massive impact both for codemakers and codebreakers over the last decades. On the side of codebreakers, various attacks have been developed that specifically target the physical nature of electronic hardware; they include invasive and semi-invasive read-out techniques, fault injection, photonic emission analysis, power or other side channels, and also hardware Trojans, only naming a few. Complementary to that, physical phenomena like quantum effects or optical interference can allow faster computations than classical Turing machines for certain cryptographically relevant problems. This enables novel computational attack vectors based on physics, too. On the other hand, physics provides equally powerful tools for codemakers.  [https://www.computer.org/digital-library/journals/ec/call-for-papers-special-section-on-physics-and-cryptology-an-inevitable-couple Call for Papers: Special Section on Physics and Cryptology--an Inevitable Couple]
 +
 +
<youtube>LaLzshIosDk</youtube>
 +
<youtube>SQB9zNWw9MA</youtube>
 +
 +
= Leading Experts =
 +
 +
* Peter Shor: Shor is a professor of mathematics at MIT and is known for developing Shor's algorithm, which is a quantum algorithm for integer factorization.
 +
* Amir Yacoby: Yacoby is a professor of physics at Harvard University and is known for his work on quantum computing with superconducting circuits.
 +
* Ludwig M. Duan: Duan is a professor of physics at the University of Chicago and is known for his work on quantum computing with trapped ions.
 +
* Raymond Laflamme: Laflamme is a professor of physics at the University of Waterloo and is known for his work on quantum computing with NMR.
 +
* John Preskill: Preskill is a professor of theoretical physics at Caltech and is known for his work on quantum computing theory.
 +
* Seth Lloyd: Lloyd is a professor of mechanical engineering and applied physics at MIT and is known for his work on quantum computing theory.
 +
* Christoph Simon: Simon is a professor of physics at the University of Vienna and is known for his work on quantum algorithms.
 +
* Daniel Gottesman: Gottesman is a professor of physics at the Perimeter Institute for Theoretical Physics and is known for his work on quantum error correction.
 +
* Michel Devoret: Devoret is a professor of physics at Yale University and is known for his work on quantum measurement and control.
 +
* Isaac Chuang: Chuang is a professor of electrical engineering and computer science at the University of Chicago and is known for his work on quantum information theory.
 +
* David Awschalom: Awschalom is a professor of physics at the University of Chicago and is known for his work on quantum computing with spin qubits.
 +
* David DiVincenzo: DiVincenzo is a professor of physics at the University of Maryland and is known for his work on the requirements for a scalable quantum computer.
 +
* Hartmut Neven: Neven is a vice president of Google AI and is known for his work on Google's quantum computing project, Sycamore.
 +
* Michele Mosca: Mosca is a professor of computer science at the University of Toronto and is known for his work on quantum algorithms.
 +
* Terry Rudolph: Rudolph is a professor of physics at the University of Oxford and is known for his work on quantum error correction.
 +
* Luigi Amico: Amico is a professor of physics at the University of Catania and is known for his work on quantum many-body systems.
 +
* Paolo Zanardi: Zanardi is a professor of physics at the University of Pavia and is known for his work on quantum algorithms and quantum error correction.
 +
* Liang Jiang: Jiang is a professor of physics at the University of Chicago and is known for his work on quantum many-body systems and quantum information theory.
 +
* Jianfeng Lu: Lu is a professor of physics at the University of Science and Technology of China and is known for his work on quantum information theory and quantum communication.
 +
* Xiao-Gang Wen: Wen is a professor of physics at the Massachusetts Institute of Technology and is known for his work on quantum many-body systems and topological quantum computation.
  
 
= Courses =
 
= Courses =
* [http://github.com/desireevl/awesome-quantum-computing#learning Learning - Awesome Quantum Computing | GitHub]
+
* [https://www.amarchenkova.com/2020/10/30/best-quantum-computing-courses-online/ Best Quantum Computing Courses Online | Anastasia Marchenkova]
 +
* [https://www.khanacademy.org/search?page_search_query=quantum%20physics Quantum Physics | Khan Academy]
 +
* [https://github.com/desireevl/awesome-quantum-computing#learning Learning - Awesome Quantum Computing | GitHub]
  
 
=== Learn Quantum Computation using Qiskit ===
 
=== Learn Quantum Computation using Qiskit ===
* [http://community.qiskit.org/textbook/ Qiskit Textbook: Learn Quantum Computation using Qiskit] A university quantum algorithms/computation course supplement based on Qiskit
+
* [https://community.qiskit.org/textbook/ Qiskit Textbook: Learn Quantum Computation using Qiskit] A university quantum algorithms/computation course supplement based on Qiskit
* [http://community.qiskit.org/education/ Qiskit Education | IBM]
+
* [https://community.qiskit.org/education/ Qiskit Education | IBM]
  
 
=== Quantum Computing for the Determined | Michael Nielsen ===
 
=== Quantum Computing for the Determined | Michael Nielsen ===
* [http://www.amazon.com/Quantum-Computation-Information-Michael-Nielsen/dp/110761919X/ref=sr_1_2?keywords=Quantum+Computation+and+Quantum+Information&qid=1569070832&sr=8-2 Quantum Computation and Quantum Information | Michael A. Nielsen and Isaac L. Chuang] -- the canonical textbook; 2013
+
* [https://www.amazon.com/Quantum-Computation-Information-Michael-Nielsen/dp/110761919X/ref=sr_1_2?keywords=Quantum+Computation+and+Quantum+Information&qid=1569070832&sr=8-2 Quantum Computation and Quantum Information | Michael A. Nielsen and Isaac L. Chuang] -- the canonical textbook; 2013
  
 
<youtube>X2q1PuI2RFI</youtube>
 
<youtube>X2q1PuI2RFI</youtube>
Line 808: Line 1,072:
  
 
=== University of Toronto ===
 
=== University of Toronto ===
* [http://www.edx.org/course/quantum-machine-learning-2 Quantum Machine Learning]
+
* [https://www.edx.org/course/quantum-machine-learning-2 Quantum Machine Learning]
 
* [https://github.com/vishwesh5/Quantum-Machine-Learning vishwesh5/Quantum-Machine-Learning | GitHub]
 
* [https://github.com/vishwesh5/Quantum-Machine-Learning vishwesh5/Quantum-Machine-Learning | GitHub]
  
In this course we will introduce several quantum machine learning algorithms and implement them in Python. This massively open online online course (MOOC) on edX is offered by the University of Toronto on edX with an emphasis on what benefits current and near-future quantum technologies may bring to machine learning. These notebooks contain the lecture notes and the code for the course. The content is organized in four modules, with an additional introductory module to the course itself. Since the course is hands-on, we found it important that you can try the code on actual quantum computers if you want to. There isn't a single, unified programming framework that would allow to address all available quantum hardware. For this reason, the notebooks are available in two versions: one in Qiskit targeting the IBM Q hardware and the Forest SDK targetting the Rigetti quantum computer. The notebooks also cover quantum annealing -- for that, the D-Wave Ocean Suite is used. For more details on setting up your computational environment locally.
+
In this course we will introduce several quantum machine learning algorithms and implement them in [[Python]]. This massively open online online course (MOOC) on edX is offered by the University of Toronto on edX with an emphasis on what benefits current and near-future quantum technologies may bring to machine learning. These notebooks contain the lecture notes and the code for the course. The content is organized in four modules, with an additional introductory module to the course itself. Since the course is hands-on, we found it important that you can try the code on actual quantum computers if you want to. There isn't a single, unified programming framework that would allow to address all available quantum hardware. For this reason, the notebooks are available in two versions: one in Qiskit targeting the IBM Q hardware and the Forest SDK targetting the Rigetti quantum computer. The notebooks also cover quantum annealing -- for that, the D-Wave Ocean Suite is used. For more details on setting up your computational environment locally.
  
  
 
=== Quantum Computation at CMU | Ryan O'Donnell ===
 
=== Quantum Computation at CMU | Ryan O'Donnell ===
* [http://www.cs.cmu.edu/~odonnell/quantum18/ Quantum Computation and Quantum Information 2018 | Ryan O'Donnell]
+
* [https://www.cs.cmu.edu/~odonnell/quantum18/ Quantum Computation and Quantum Information 2018 | Ryan O'Donnell]
 
<youtube>1nh-pjxnM4I</youtube>
 
<youtube>1nh-pjxnM4I</youtube>
  
  
 
=== Quantum Mechanics - Univ. of California, Berkeley | Umesh V. Vazirani  ===
 
=== Quantum Mechanics - Univ. of California, Berkeley | Umesh V. Vazirani  ===
* [http://people.eecs.berkeley.edu/~vazirani/s09quantum.html Quantum Computation | Umesh V. Vazirani] course 1, 2009
+
* [https://people.eecs.berkeley.edu/~vazirani/s09quantum.html Quantum Computation | Umesh V. Vazirani] course 1, 2009
* [http://inst.eecs.berkeley.edu/~cs191/fa14/ Qubits, Quantum Mechanics, and Computers | Umesh V. Vazirani] course 2, 2014
+
* [https://inst.eecs.berkeley.edu/~cs191/fa14/ Qubits, Quantum Mechanics, and Computers | Umesh V. Vazirani] course 2, 2014
 
<youtube>G7REKtbIKiY</youtube>
 
<youtube>G7REKtbIKiY</youtube>
  
 +
 +
=== Quantum Computing Math Skills ===
 +
* [[Math for Intelligence]]
 +
<youtube>_v1_mlzyxs0</youtube>
 +
<youtube>IrbJYsep45E</youtube>
  
 
=== Texts and Notes ===
 
=== Texts and Notes ===
  
* [http://arxiv.org/pdf/1804.03719.pdf Quantum Algorithm Implementations for Beginners | P. Coles, S. Eidenbenz, S. Pakin, A. Adedoyin, J. Ambrosiano, P. Anisimov, W. Casper, G. Chennupati, C. Coffrin, H. Djidjev, D. Gunter, S. Karra, N. Lemons, S. Lin, A. Lokhov, A. Malyzhenkov, D. Mascarenas, S. Mniszewski, B. Nadiga, D. O'Malley, D. Oyen, L. Prasad, R. Roberts, P. Romero, N. Santhi, N. Sinitsyn, P. Swart, M. Vuffray, J. Wendelberger, B. Yoon, R. Zamora, and W. Zhu] 2018
+
* [https://arxiv.org/pdf/1804.03719.pdf Quantum Algorithm Implementations for Beginners | P. Coles, S. Eidenbenz, S. Pakin, A. Adedoyin, J. Ambrosiano, P. Anisimov, W. Casper, G. Chennupati, C. Coffrin, H. Djidjev, D. Gunter, S. Karra, N. Lemons, S. Lin, A. Lokhov, A. Malyzhenkov, D. Mascarenas, S. Mniszewski, B. Nadiga, D. O'Malley, D. Oyen, L. Prasad, R. Roberts, P. Romero, N. Santhi, N. Sinitsyn, P. Swart, M. Vuffray, J. Wendelberger, B. Yoon, R. Zamora, and W. Zhu] 2018
* [http://people.cs.umass.edu/~strubell/doc/quantum_tutorial.pdf An Introduction to Quantum Algorithms | Emma Strubell] 2011
+
* [https://people.cs.umass.edu/~strubell/doc/quantum_tutorial.pdf An Introduction to Quantum Algorithms | Emma Strubell] 2011
* [http://www.amazon.com/Quantum-Computer-Science-David-Mermin/dp/0521876583/ref=sr_1_3?keywords=Quantum+Computer+Science+N.+David+Mermin&qid=1569070964&sr=8-3 Quantum Computer Science: An Introduction | N. David Mermin] 2007
+
* [https://www.amazon.com/Quantum-Computer-Science-David-Mermin/dp/0521876583/ref=sr_1_3?keywords=Quantum+Computer+Science+N.+David+Mermin&qid=1569070964&sr=8-3 Quantum Computer Science: An Introduction | N. David Mermin] 2007
* [http://www.scottaaronson.com/blog/?p=3943 Intro to Quantum Information Science | Scott Aaronson] undergrad-level course, 2017  
+
* [https://www.scottaaronson.com/blog/?p=3943 Intro to Quantum Information Science | Scott Aaronson] undergrad-level course, 2017  
* [http://www.scottaaronson.com/democritus/ Quantum Computing Since Democritus | Scott Aaronson] seminar course, 2006
+
* [https://www.scottaaronson.com/democritus/ Quantum Computing Since Democritus | Scott Aaronson] seminar course, 2006
* [http://courses.cs.washington.edu/courses/cse599d/06wi/ Quantum Computing | Dave Bacon] 2006
+
* [https://courses.cs.washington.edu/courses/cse599d/06wi/ Quantum Computing | Dave Bacon] 2006
* [http://www.cs.umd.edu/~amchilds/teaching/w13/qic823.html Quantum algorithms | Andrew Childs] 2013
+
* [https://www.cs.umd.edu/~amchilds/teaching/w13/qic823.html Quantum algorithms | Andrew Childs] 2013
* [http://cleve.iqc.uwaterloo.ca/qic710.html Introduction to Quantum Information Processing | Richard Cleve] 2019
+
* [https://cleve.iqc.uwaterloo.ca/qic710.html Introduction to Quantum Information Processing | Richard Cleve] 2019
* [http://pages.cs.wisc.edu/~dieter/Courses/2010f-CS880/lectures.html Quantum Information Processing | van Melkebeek] 2010
+
* [https://pages.cs.wisc.edu/~dieter/Courses/2010f-CS880/lectures.html Quantum Information Processing | van Melkebeek] 2010
* [http://www.theory.caltech.edu/people/preskill/ph229/ Quantum Computation | John Preskill] notes 2018
+
* [https://www.theory.caltech.edu/people/preskill/ph229/ Quantum Computation | John Preskill] notes 2018
* [http://viterbi-web.usc.edu/~breichar/ Quantum Algorithms | Ben Reichardt] 2004 - 2016
+
* [https://viterbi-web.usc.edu/~breichar/ Quantum Algorithms | Ben Reichardt] 2004 - 2016
* [http://cs.uwaterloo.ca/~watrous/LectureNotes.html Theory of Quantum Information | John Watrous] 2011
+
* [https://cs.uwaterloo.ca/~watrous/LectureNotes.html Theory of Quantum Information | John Watrous] 2011
* [http://homepages.cwi.nl/~rdewolf/qcnotes.pdf Quantum Computing: Lecture Notes | Ronald de Wolf - QuSoft, CWI and University of Amsterdam] 2019
+
* [https://homepages.cwi.nl/~rdewolf/qcnotes.pdf Quantum Computing: Lecture Notes | Ronald de Wolf - QuSoft, CWI and University of Amsterdam] 2019
  
 
= Quantum Supremacy =
 
= Quantum Supremacy =
* [http://en.wikipedia.org/wiki/Quantum_information_science Quantum Information Science | Wikipedia]
+
* [https://en.wikipedia.org/wiki/Quantum_information_science Quantum Information Science | Wikipedia]
 
Quantum supremacy is the potential ability of quantum computing devices to solve problems that classical computers practically cannot. Experts forecast that quantum supremacy will become a reality within a matter of years for a limited number of computing problems.  
 
Quantum supremacy is the potential ability of quantum computing devices to solve problems that classical computers practically cannot. Experts forecast that quantum supremacy will become a reality within a matter of years for a limited number of computing problems.  
  
Line 862: Line 1,131:
 
<youtube>rUWfod_8JsM</youtube>
 
<youtube>rUWfod_8JsM</youtube>
 
<youtube>7hg5eaGpjDg</youtube>
 
<youtube>7hg5eaGpjDg</youtube>
 +
 +
= <span id="Quantum Chess"></span>Quantum Chess =
 +
 +
* [[Gaming]]
 +
 +
What exactly is quantum chess? It's a complicated version of regular chess that incorporates the quantum concepts of superposition, entanglement, and interference. “It’s like you’re playing in a multiverse but the different boards [in different universes] are connected to each other,” said Caltech physicist Spiros Michalakis during a livestream of the tournament. “It makes 3D chess from Star Trek look silly.” Quantum chess (as played in the tournament) is the brainchild of Chris Cantwell of Quantum Realm Games. [https://arstechnica.com/gaming/2020/12/we-have-a-winner-in-the-worlds-first-quantum-chess-tournament/ We have a winner in the world’s first quantum chess tournament | Jennifer Ouellette]
 +
 +
<youtube>ec-Mb8OJuRg</youtube>
 +
<youtube>LikdmXfWO2A</youtube>
 +
  
 
= Exploring Quantum History =
 
= Exploring Quantum History =
Line 871: Line 1,150:
 
<youtube>HneFM-BvZj4</youtube>
 
<youtube>HneFM-BvZj4</youtube>
 
<youtube>oQYsqnRYb_o</youtube>
 
<youtube>oQYsqnRYb_o</youtube>
<youtube>TftGVf5345g</youtube>
+
<youtube>B7pACq_xWyw</youtube>

Latest revision as of 06:07, 14 June 2024

YouTube search... YouTube ... Quora ...Google search ...Google News ...Bing News



Every quantum computer is fundamentally a sampler that starts with a simple probability distribution over all possible measurement outcomes, computes a more complicated distribution, and samples an outcome via a measurement. Quantum Machine Learning 1.0 | Maria Schuld - Xanadu - Medium





Quantum computing is a type of non-classical computing based on the quantum state of subatomic particles. It differs fundamentally from classic computers, which operate using binary bits. Basic properties of quantum world:

  • Superposition - quantum computing uses quantum bits, or Qubits. One Qubit can represent a range of values, which is known as ‘superpositioning’; in addition the two states, 0 and 1, a quantum system can be in the two states at a time; the power to be a wave and a particle, at the same time.


Waterbear.jpg Wikipedia - Tardigrade


Contents

What Will We Do With Quantum Computing?

A large-scale quantum computer would be able to solve problems that existing classical computers would take much longer than the age of the universe to solve. This would have dramatic implications for cryptography, chemistry, material science, nuclear physics and probably other areas that are still un- known. But what about quantum computers that will be available in the next few years? What Will We Do With Quantum Computing?

The CIO’s guide to quantum computing | TechRadar Pro - Quantum computing could enable breakthroughs in:


  • Machine learning: Improved ML through faster structured prediction. Examples include Boltzmann machines, quantum Boltzmann machines, semi-supervised learning, unsupervised learning and deep learning;
  • Artificial intelligence: Faster calculations could improve perception, comprehension, and circuit fault diagnosis/binary classifiers;
  • Chemistry: New fertilizers, catalysts, battery chemistry will all drive improvements in resource utilization;
  • Biochemistry: New drugs, tailored drugs, and maybe even hair restorer;
  • Finance: Quantum computing could enable faster, more complex Monte Carlo simulations; for example, trading, trajectory optimization, market instability, price optimization and hedging strategies;
  • Healthcare: DNA gene sequencing, such as radiotherapy treatment optimization/brain tumor detection, could be performed in seconds instead of hours or weeks;
  • Materials: super strong materials; corrosion proof paints; lubricants and semiconductors;
  • Computer science: Faster multidimensional search functions; for example, query optimization, mathematics and simulations.


Source: McKinsey & Company Quantum computers are coming. Get ready for them to change everything | Daphne Leprince-Ringuet - ZDNet

mckinsey-quantum-infographic.png


Cryptography

YouTube search... ...Google search

If quantum computers became practical, they will destroy the security of our currently deployed public-key cryptographic solutions (such as RSA or ECDSA). The majority of our telecommunications channels make use of these encryption schemes to provide confidentiality, authentication and integrity.

Quantum cryptography is the science of exploiting quantum mechanical properties to perform cryptographic tasks. The best known example of quantum cryptography is quantum key distribution which offers an information-theoretically secure solution to the key exchange problem. The advantage of quantum cryptography lies in the fact that it allows the completion of various cryptographic tasks that are proven or conjectured to be impossible using only classical (i.e. non-quantum) communication. For example, it is impossible to copy data encoded in a quantum state. If one attempts to read the encoded data, the quantum state will be changed due to wave function collapse (no-cloning theorem). This could be used to detect eavesdropping in quantum key distribution (QKD). - Quantum Cryptography | Wikipedia


Quantum Communications

YouTube search... ...Google search

Quantum entanglement, and what it mean for the future of the Internet where information is created, stored and moved around in ways that mirror the bizarre behavior of the quantum world - sending quantum information instead of classical information.



Detection/Sensor Technology

YouTube search... ...Google search

A quantum sensor is a quantum device that responds to a stimulus. Usually this refers to a sensor which has quantized energy levels, uses quantum coherence to measure physical quantity, or uses entanglement to improve measurements beyond what can be done with classical sensors. ... You can coherently manipulate the sensor. Quantum sensor | Wikipedia

Quantum Radar

YouTube search... ...Google search

Quantum radar is a speculative remote-sensing technology based on quantum-mechanical effects, such as the uncertainty principle or quantum entanglement. Broadly speaking, a quantum radar can be seen as a device working in the microwave range, which exploits quantum features, from the point of view of the radiation source and/or the output detection, and is able to outperform a classical counterpart. One approach is based on the use of input quantum correlations (in particular, quantum entanglement) combined with a suitable interferometric quantum detection at the receiver (strongly related to the protocol of quantum illumination). ... One way to defeat conventional radar systems is to broadcast signals on the same frequencies used by the radar, making it impossible for the receiver to distinguish between their own broadcasts and the spoofing signal (or "jamming"). However, such systems cannot know, even in theory, what the original quantum state of the radar's internal signal was. Lacking such information, their broadcasts will not match the original signal and will be filtered out in the correlator. Environmental sources, like ground clutter and aurora, will similarly be filtered out. Wikipedia


e18_1_medium.png

At the core of the proposed method is a means of interconverting microwave and optical signals using a so-called electro-optomechanical converter. This device would consist of optical and microwave cavities for storing each kind of radiation, with a nanoscale vibrating object (such as a piezoelectric crystal or a metallic membrane) serving as the connection between the two. The oscillator can couple electromagnetic vibrations in the two cavities, despite their different frequencies.

Games

YouTube search... ...Google search

Quantum Natural Language Processing

YouTube search... ...Google search

One particularly interesting aspect of this graphical framework for linguistics was that the networks were inherited from previous work that provided quantum theory with an entirely network-like language.

Quantum Machine Learning (QML)

YouTube search... ...Google search

Quantum machine learning is an emerging interdisciplinary research area at the intersection of quantum physics and machine learning. The most common use of the term refers to machine learning algorithms for the analysis of classical data executed on a quantum computer, i.e. quantum-enhanced machine learning. While machine learning algorithms are used to compute immense quantities of data, quantum machine learning increases such capabilities intelligently, by creating opportunities to conduct analysis on quantum states and systems. This includes hybrid methods that involve both classical and quantum processing, where computationally difficult subroutines are outsourced to a quantum device. These routines can be more complex in nature and executed faster with the assistance of quantum devices. Furthermore, quantum algorithms can be used to analyze quantum states instead of classical data. Quantum machine learning | Wikipedia

PennyLane

Youtube search... ...Google search

PennyLane is a cross-platform Python library for quantum machine learning, automatic differentiation, and optimization of hybrid quantum-classical computations. The first dedicated machine learning platform for quantum computers

NISQAI

Youtube search... ...Google search

Noisy Intermediate-Scale Quantum Artificial Intelligence; implementing neural networks on near-term quantum computers

Quantum Neural Network (QNN)

Quantum neural networks (QNNs) are neural network models which are based on the principles of quantum mechanics. There are two different approaches to QNN research, one exploiting quantum information processing to improve existing neural network models (sometimes also vice versa), and the other one searching for potential quantum effects in the brain. Quantum Neural Network (QNN) | Wikipedia

Quantum Convolutional Neural Network (QCNN)

Machine learning techniques have so far proved to be very promising for the analysis of data in several fields, with many potential applications. However, researchers have found that applying these methods to quantum physics problems is far more challenging due to the exponential complexity of many-body systems.... "One of the objectives of the present work was to generalize a specific, well-known machine learning architecture called convolutional neural network (CNN) for a compact quantum circuit, and demonstrate its capabilities with simplistic but meaningful examples." In their study, Choi and his colleagues assumed that CNNs owe their great success to two important features. Firstly, the fact that they are made out of smaller local units (i.e., multiple layers of quasi-local quantum gates). Secondly, their ability to process input data in a hierarchical fashion. The researchers found a connection between these two characteristics and two renowned physics concepts known as Locality and Renormalization. The researchers observed that Renormalization processes share some similarities with pattern recognition applications, particularly those in which machine learning is used to identify objects in pictures. For instance, when a CNN trained for pattern recognition tasks analyzes pictures of animals, it focuses on a universal feature (i.e., trying to identify what animal is portrayed in the image), regardless of whether individual animals of the same type (e.g., cats) look slightly different. This process is somewhat similar to Renormalization techniques in theoretical physics, which can also help to distill universal information....quantum convolutional neural network (QCNN), on a quantum physics-specific problem that involved recognizing quantum states associated with a 1-D symmetry protected topological phase. Remarkably, their technique was able to recognize these quantum states, outperforming existing approaches. As it is fairly compact, the QCNN could also potentially be implemented in small quantum computers. Introducing Quantum Convolutional Neural Networks (QCNN) | Ingrid Fadelli

Machine Learning Powered By Light

Xanadu

A quantum photonic company - An industry-first machine learning toolbox for quantum computing. Powered by TensorFlow. Instead of using electrons to carry information and perform calculations, Xanadu uses photons. Unlike electrons, photons are very stable and are almost unaffected by random noise from heat. Xanadu uses photonic chips to generate, control, and measure photons in ways that enable extremely fast computation.

Getting Started with Quantum Programming


Quantum Logic Gate

A basic quantum circuit operating on a small number of Qubits. They are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits. It is different to electric circuits in that the Qubits exist, and instructions are applied to the Qubit(s) ... Quantum logic gates | Wikipedia

Quantum NOT gate (X, Y, Z)

150px-Qcircuit_NOT.svg.png

8oMGNCU.gif

  • Pauli-X gate - Pauli-x gate is the same as the not gate described above. It is the quantum equivalent of the NOT gate for classical computers (with respect to the standard basis, which distinguishes the Z-direction; It equates to a rotation around the X-axis of the Bloch sphere by pi radians. Due to this nature, it is sometimes called bit-flip.
  • Pauli-Y gate - It equates to a rotation around the Y-axis of the Bloch sphere by pi radians


  • Pauli-Z gate - It equates to a rotation around the Z-axis of the Bloch sphere by pi radians; representing a rotation around the z-axis by 180 degrees.

Phase Gate ... S & T gates

S gate is related to the Pauli-z gate; representing a rotation around the z-axis by 90 degrees.


T gate is related to the Pauli-z gate; representing a rotation around the z-axis by 45 degrees.

Both S and T gates are not reversible. Which means adding two of them in a raw will not result in the input status. Rather following diagram shows the combination of gates to achieve the inverse.


Hadamard gate

is the one-Qubit version of the quantum Fourier transform. A measurement will have equal probabilities to become 1 or 0 (i.e. creates a Superposition). The Hadamard gate can also be expressed as a 90º rotation around the Y-axis, followed by a 180º rotation around the X-axis. So H = X Y^{1/2}H=XY. Getting Qubits into Superposition at the start of an algorithm is call 'Hadamard initialization'

150px-Hadamard_gate.svg.png

Z1gvp0j.gif


CNOT gate - Controlled (cX cY cZ) gates

Controlled gates act on 2 or more Qubits, where one or more Qubits act as a control for some operation. For example, the controlled NOT gate (or CNOT or cX) acts on 2 Qubits, and performs the NOT operation on the second Qubit only when the first Qubit is {\displaystyle |1\rangle }|1\rangle , and otherwise leaves it unchanged.

150px-CNOT_gate.svg.png

Toffoli gate (CCNot gate)

As an extended version of CNot gate, Toffoli gate does the Not operation depending on two control Qubits. Result of the And operation between two control bits are used as the final control bit for the Not gate.

Toffoli gate => Quantum equivalent of a universal logic gate.

Toffoli gate can be used to achieve several other logic operations as follows.

In classical computing when we need to transfer some logical state to several other logic gates we just connect all the lines as in the image. Physically also we can transfer the low, high states to several other logic gates via wires. But in quantum mechanics, we cannot send a single Qubit to two destinations. To do that we need to clone the quantum state of the Qubits. Which is not possible according to No-Cloning theorem. Instead, we must use some special gates called fanout gates. Note: Fanout gates does not copy superposed and entangled states. Creating a fanout gate using Toffoli gate:

SWAP gate

built from a circuit containing only CNOT gates. The first CNOT is the controlled by the first Qubit (CNOTa), and second one is controlled by the second Qubit (CNOTb).

3-s2.0-B9780444527820500051-f03-03-9780444527820.gif


Fredkin gate (Controlled Swap gate)

Fredking gate has one control Qubit and two input Qubits. When control bit is 1 it swaps the two input Qubits.


Measure operation

a special type of operations done on Qubits at the end of a circuit to get the final values of the Qubits after the operations have been conducted. Compared to the gates above, Measurement is irreversible and hence, is not a Quantum Gate.

Quantum Instruction Sets


cQASM

Youtube search... ...Google search

cQASM, also known as common QASM, is a hardware-agnostic QASM which guarantees the interoperability between all the quantum compilation and simulation tools.

  • QI Editor Guide
  • Quantum Inspire (QI) a quantum computing platform designed and built by QuTech. Quantum Inspire (QI) is initiated by QuTech the advanced research center for quantum computing and quantum internet founded by TU Delft and TNO.
  • QuTech Academy "QuTech gives students a large perspective of what is happening in the field of quantum!" Discover quantum computers and the quantum internet. Learn the principles and promises behind these developments and how they will impact our future in 2 new online courses. The course Quantum Computers and [[Quantum Internet: How can they change the world? will dive into the potential impact of a quantum computer and a quantum internet. The course Building Blocks of a Quantum Computer will give you insight in the several layers of a quantum computer, ranging from Qubits to software. Both courses are available on EdX.org.


OpenQASM

Youtube search... ...Google search

OpenQASM is the intermediate representation introduced by IBM for use with Qiskit and the IBM Q Experience. Wikipedia

Quil

Youtube search... ...Google search

Quil is an instruction set architecture for quantum computing that first introduced a shared quantum/classical memory model. Many quantum algorithms (including quantum teleportation, quantum error correction, simulation, and optimization algorithms) require a shared memory architecture.

Quil is being developed for the superconducting quantum processors developed by Rigetti Computing through the Forest quantum programming API. A PPython library called pyQuil was introduced to develop Quil programs with higher level constructs. A Quil backend is also supported by other quantum programming environments. Computing developed a Quantum Virtual Machine in Common Lisp that simulates the defined Quantum Abstract Machine on a classical computer and is capable of the parsing and execution of Quil programs with possibly remote execution via HTTP

PyQuil serves three main functions:

  • Easily generating Quil programs from quantum gates and classical operations
  • Compiling and simulating Quil programs using the Quil Compiler (quilc) and the Quantum Virtual Machine (QVM)
  • Executing Quil programs on real quantum processors (QPUs) using Quantum Cloud Services (QCS)

Blackbird

Youtube search... ...Google search

Blackbird is a quantum assembly language for continuous-variable quantum computation, that can be used to program Xanadu's quantum photonics hardware and Strawberry Fields simulator.

Quantum Functions & Algorithms


Schnorr's Algorithm

It is estimated that a quantum computer using 372 qubits running their algorithm could crack any of the cryptosystems in use today. Not mentioned in their work is one caveat that remains—today's quantum computers have error rates so high that it would be impossible to use them to crack cryptosystems. If systems with much lower error rates do arise in the near future, cryptosystem makers could increase the size of the prime numbers used to generate their keys—but only for so long. A more likely prospect for securing computer systems in the future will use quantum-secure communications, specifically quantum key distribution. - Modification to Shor's algorithm may mean less powerful quantum computers could crack cryptosystems | Bob Yika - Tech Xplore

modification-to-shors.jpg

Shor's Period Finding Algorithm

Performing prime factorization of integers; Shor's algorithm is difficult to understand because it mixes together ideas from quantum physics, signal processing, number theory, and computer science.

  • Quirk
  • Quantum Cryptographic Technology
  • Shor's algorithm - why doesn't the final collapse of the auxiliary qubits cripple the computation? In the factoring algorithm, there are three kinds of qubits. In the OP's notation, there are "input qubits", which start in a superposition of all possible values, and which you eventually take the Fourier transform of. There are "value qubits", in which you compute the function ya(modN), where a is the value in the input qubits. And there are "auxiliary qubits", which you use as workspace to help do this computation. In order to make the factoring algorithm work properly, you need to reset all the auxiliary qubits, which started as |0⟩ at the beginning of the computation, to |0⟩ at the end of the computation. This is called "uncomputing" these qubits. (Actually, you can set them to anything you please as long as it is a constant independent of the workings of the algorithm.) Theorems about reversible classical computation ensure that it is possible to do this. If you reset the auxiliary qubits to |0⟩, then if the environment, or somebody, measures them, nothing is revealed about the computation, and the computation is not "crippled". If you forget to reset them to |0⟩, you probably won't get the right answer, whether or not anybody measures them.
  • Shor's Quantum Factoring Algorithm | Algorithmic Assertions


Grover's Search

Searches for a specified entry in an unordered database, employing an important technique in quantum algorithm design known as amplitude amplification

Deutsch-Jozsa Algorithm

One of the first quantum algorithms with nice speedup over its classical counterpart. Consider This is an “hello world” in quantum computing. Consider a function f that takes 0 or 1 as input and outputs either 0 or 1. Our functions in mind are either balanced or constant. A function f is called balanced if it outputs 0 half the time and 1 the other half. It is a constant function if its output is a constant (1 or 0) regardless of input.

We are given an oracle whose input is n bits and whose output is one bit. We are promised that out of the 2n possible inputs, either all of them, none of them, or half of them yield output 1. The task is to distinguish the balanced case (half of all inputs yield output 1) from the constant case (all or none of the inputs yield output 1). It was shown by Deutsch that for n=1, this can be solved on a quantum computer using one query, whereas any deterministic classical algorithm requires two. This was historically the first well-defined quantum algorithm achieving a speedup over classical computation. A single-query quantum algorithm for arbitrary n was developed by Deutsch and Jozsa. Although probabilistically easy to solve with O(1) queries, the Deutsch-Jozsa problem has exponential worst case deterministic query complexity classically. Algebraic and Number Theoretic Algorithms | Stephen Jordan

Simon’s Algorithm

Much of the functionality is the same as the Bernstien-Vazirani algorithm. Circuit | DaftWullie - Stack Exchange


Bernstein-Vazirani Algorithm

Correctly guesses a string of binary numbers in one shot. It's a restricted version of the Deutsch–Jozsa algorithm where instead of distinguishing between two different classes of functions, it tries to learn a string encoded in a function. Bernstein–Vazirani algorithm | Wikipedia, which solves the Bernstein–Vazirani problem

We are given an oracle whose input is n bits and whose output is one bit. Given input x∈{0,1}n, the output is x⊙h, where h is the "hidden" string of n bits, and ⊙ denotes the bitwise inner product modulo 2. The task is to find h. On a classical computer this requires n queries. As shown by Bernstein and Vazirani, this can be achieved on a quantum computer using a single query. Furthermore, one can construct recursive versions of this problem, called recursive Fourier sampling, such that quantum computers require exponentially fewer queries than classical computers. Algebraic and Number Theoretic Algorithms | Stephen Jordan

Bell Inequality Test (CHSH)

Determining the exclusive-or (XOR) mask over which a given black-box function is invariant

Quantum as a service (QaaS)

YouTube search... ...Google search

Quantum as a Service (QaaS) is a cloud-based service that provides access to quantum computing platforms over the internet. It combines the potential of quantum computing with the simplicity of cloud computing, and is similar to other "as-a-Service" models like Software-as-a-Service (SaaS), Platform-as-a-Service (PaaS), and Infrastructure-as-a-Service (IaaS). QaaS resources are typically available via subscriptions or pay-as-you-go bases.

companies offer Quantum-as-a-Service (QaaS):

  • Amazon Braket - cloud-based quantum computing services offered by Amazon Web Services
  • Azure Quantum - Microsoft Azure
  • qBraid
  • Strangeworks
  • Terra Quantum, which offers "Quantum Algorithms as a Service", "Quantum Computing as a Service", and "Quantum Security as a Service".
  • Oxford Quantum Circuits, which offers cloud access to its quantum computers in Europe through a private cloud and in partnership with AWS.
  • Xanadu, which provides quantum computing hardware and software through its Xanadu Quantum Cloud (XQC) service and Strawberry Fields application library.
  • D-Wave Systems, which is the world's first commercial supplier of quantum computers and offers quantum computing services.
  • Baidu, which provides quantum computing capabilities through its Baidu Quantum platform and Quantum-as-a-Service offering.
  • Intel, which offers quantum computing services through its Intel Quantum platform and Quantum-as-a-Service.

Quantum Development Algorithms & Kits

SDKs with access to quantum processors

The following software development kits can be used to run quantum circuits on prototype quantum devices, as well as on simulators.

Qiskit

Youtube search... ...Google search


ProjectQ

TensorFlow Quantum

Youtube search... ...Google search

ProjectQ is an open-source compilation framework capable of targeting various types of hardware and a high-performance quantum computer simulator with emulation capabilities, and various compiler plug-ins.


Forest

Youtube search... ...Google search


Braket

Youtube search... ...Google search

a new cloud computing service that gives developers and researchers a way to tinker with quantum circuits. According to an Amazon news release, users will be able to build out their own quantum circuits and applications and test them on Amazon’s machine. Amazon didn’t actually build a quantum computer — instead, it partnered with other organizations that did — Instead, it partnered with three companies — D-Wave, IonQ, and Rigetti — that did build their own. Amazon Is Now Letting Anyone Run Programs On Its Quantum Computer | Dan Robitzski

Qilimanjaro

Youtube search... ...Google search

  • Qilimanjaro build a unique first-to-market full-stack coherent quantum annealing computer with an easy-to-use advanced algorithmic toolset to effectively address complex optimization problems in multiple real-world industry use cases.
  • Address existing quantum hardware platforms
  • Development of HPC quantum simulators
  • Cloud access to quantum computing resources
  • Long Qubit coherence, low-system noise
  • High connectivity Qubit architecture
  • Cost-effective solutions
  • Quantum annealing programming: mapping mathematical models to device hardware
  • For hard combinatorial optimization problems



D-Wave

Youtube search... ...Google search

The quantum bits—also known as Qubits—are the lowest energy states of the superconducting loops that make up the D-Wave QPU. These states have a circulating current and a corresponding magnetic field. As with classical bits, a Qubit can be in state of 0 or 1. But because the Qubit is a quantum object, it can also be in a Superposition of the 0 state and the 1 state at the same time. At the end of the quantum annealing process, each Qubit collapses from a Superposition state into either 0 or 1 (a classical state). The physics of this process can be shown (visualized) with an energy diagram. This diagram changes over time, as we can see in (a), (b), and (c). To begin, there is just one valley (a), with a single minimum. The quantum annealing process runs, the barrier is raised, and this turns the energy diagram into what is known as a double-well potential (b). Here, the low point of the left valley corresponds to the 0 state, and the low point of the right valley corresponds to the 1 state. The Qubit ends up in one of these valleys at the end of the anneal. Introduction to Quantum Annealing | D-Wave


Quantum Brilliance

Youtube search... ...Google search

An Australian/German company is developing powerful quantum accelerators the size of graphics cards. They work at room temperature, undercutting and outperforming today's huge, cryo-cooled quantum supercomputers, and soon they'll be small enough for mobile devices. Properties of the nitrogen-vacancy (NV) centre in diamonds. NV centres in diamond have the longest coherence time of any room temperature quantum state. This means that as qubits they can operate anywhere a classical computer can.

The nitrogen-vacancy center (N-V center or NV center) is one of numerous point defects in diamond. Its most explored and useful property is its photoluminescence, which allows observers to read out its spin-state. The NV center's electron spin, localized at atomic scales, can be manipulated at room temperature by external factors such as magnetic, or electric fields, microwave radiation, or light, resulting in sharp resonances in the intensity of the photoluminescence. These resonances can be explained in terms of electron spin related phenomena such as quantum entanglement, spin–orbit interaction and Rabi oscillations, and analysed using advanced quantum optics theory. An individual NV center can be used as a basic unit for a quantum computer, a qubit, used f.e. for quantum cryptography. Further potential applications in novel fields of electronics and sensing include spintronics, masers, and quantum sensors. If the charge is not specified the term "NV center" refers to the negatively charged NV− center.Wikipedia

?url=http%3A%2F%2Fnewatlas-brightspot.s3.amazonaws.com%2Fed%2F39%2F3e2507b14282933f1b3871e17d21%2Funtitled-1.jpg


Quantum Software Development Kit (SDK)

SDKs based on simulators

Public access to quantum devices is currently planned for the following SDKs, but not yet implemented.

Intel Quantum Software Development Kit

The Intel Quantum SDK includes an intuitive user interface based on C++, a low-level virtual machine (LLVM)-based compiler toolchain with a quantum runtime environment optimized for executing hybrid quantum-classical algorithms and a high-performance Intel® Quantum Simulator (IQS) qubit target backend. Future releases will feature different qubit target backends, including a quantum dot qubit simulator and, eventually, an Intel quantum dot qubit device as the target backend will also be offered.

Microsoft Quantum Development Kit

Youtube search... ...Google search

Cirq

Youtube search... ...Google search

  • Cirq | Google
  • Cirq - a Python library for writing, manipulating, and optimizing quantum circuits and running them against quantum computers and simulators. | Google]
  • PennyLane a cross-platform Python library for quantum machine learning

A Python framework for creating, editing, and invoking Noisy Intermediate Scale Quantum (NISQ) circuits; running them against quantum computers and simulators.

Strawberry Fields

Youtube search... ...Google search

  • Xanadu
  • PennyLane a cross-platform Python library for quantum machine learning
  • Blackbird Quantum Instruction Set
  • TensorFlow Quantum
  • Quantum Machine Learning 1.0 | Maria Schuld - Xanadu - Medium
  • Strawberry Fields - is a full-stack Python library for designing, simulating, and optimizing continuous variable quantum optical circuits. | Xanadu
    • An open-source software architecture for photonic quantum computing
    • A full-stack quantum software platform, implemented in Python specifically targeted to the CV model
    • Quantum circuits are written using the easy-to-use and intuitive Blackbird quantum programming language
    • Powers the Strawberry Fields Interactive web app, which allows anyone to run a quantum computing simulation via drag and drop
    • Includes quantum computer simulators implemented using NumPy and Tensorflow - these built-in quantum compiler tools convert and optimize Blackbird code for classical simulation
    • Future releases will aim to target experimental backends, including photonic quantum computing chips

thumbnail1.gif


">t|ket>

>+quantum Youtube search... >+quantum ...Google search

A quantum programming environment developed by Cambridge Quantum Computing, that targets simulators and quantum hardware. It is for use with the hardware produced by the NQIT hub, as well as Oxford Quantum Circuits.

Silicon Devices

Youtube search... ...Google search


TensorFlow Quantum

TensorFlow Quantum simplifies the swift development of hybrid quantum-classical machine learning models. Those engaged in quantum algorithm and application research can harness the power of Google's quantum computing frameworks seamlessly through TensorFlow. TensorFlow Quantum is dedicated to quantum data processing and constructing hybrid quantum-classical models. It seamlessly incorporates quantum computing algorithms and logical constructs from Cirq while offering quantum computing primitives that seamlessly blend with existing TensorFlow APIs. Additionally, it comes equipped with high-performance quantum circuit simulators for efficient experimentation.

Simulating and Graphing

QuTIP

Youtube search... ...Google search

QuTiP is open-source software for simulating the dynamics of open quantum systems. The QuTiP library depends on the excellent Numpy, SciPy, and Cython numerical packages. In addition, graphical output is provided by Matplotlib. QuTiP aims to provide user-friendly and efficient numerical simulations of a wide variety of Hamiltonians, including those with arbitrary time-dependence, commonly found in a wide range of physics applications such as quantum optics, trapped ions, superconducting circuits, and quantum nanomechanical resonators. QuTiP is freely available for use and/or modification on all major platforms such as Linux, Mac OSX, and Windows*. Being free of any licensing fees, QuTiP is ideal for exploring quantum mechanics and dynamics in the classroom.

Concepts

Concepts: Intrinsic Properties

  • Bell State - a maximally entangled quantum state of two qubits. a concept in quantum information science, are specific quantum states of two Qubits that represent the simplest (and maximal) examples of quantum entanglement. The Bell states are a form of entangled and normalized basis vectors. This normalization implies that the overall probability of the particle being in one of the mentioned states is 1. Bell states can be generalized to represent specific quantum states of multi-Qubit systems, such as the Greenberger–Horne–Zeilinger (GHZ) State for 3 subsystems. ...Wikipedia

220px-H_CNOTGate.png

  • Greenberger–Horne–Zeilinger (GHZ) State - a certain type of entangled quantum state that involves at least three subsystems (particles). Extremely non-classical properties of the state have been observed. There is no standard measure of multi-partite entanglement because different, not mutually convertible, types of multi-partite entanglement exist. Nonetheless, many measures define the GHZ state to be maximally entangled state. ... ...Wikipedia To create such a GHZ state, we start with a three-qubit quantum register. By default, each qubit in the register is initialized to |0⟩. To make the GHZ state, we apply the following gates:
  • Hadamard gate 𝐻 on qubit 0, which puts it into the superposition state (|0⟩+|1⟩)/2⎯⎯√.
  • controlled-Not operation (𝐶𝑋) between qubit 0 and qubit 1.
  • controlled-Not operation between qubit 0 and qubit 2.

web.png

IFM_SpinFlipp_GHZ_Final-700x580.jpg


  • Quantum tunneling - able to bypass any barriers i.e move through walls ... ...Wikipedia

  • Quantum Spin - intrinsic form of angular momentum carried by elementary particles, composite particles (hadrons), and atomic nuclei. Spin is one of two types of angular momentum in quantum mechanics, the other being orbital angular momentum. The orbital angular momentum operator is the quantum-mechanical counterpart to the classical angular momentum of orbital revolution and appears when there is periodic structure to its wavefunction as the angle varies. ... ...Wikipedia


  • Quantum Wave - a complex-valued probability amplitude, and the probabilities for the possible results of measurements made on the system can be derived from it. If you've studied light, you may already know a bit about quantum theory. You might know that a beam of light sometimes behaves as though it's made up of particles (like a steady stream of cannonballs), and sometimes as though it's waves of energy rippling through space (a bit like waves on the sea). That's called wave-particle duality and it's one of the ideas that comes to us from quantum theory. It's hard to grasp that something can be two things at once—a particle and a wave. ...Wikipedia and Quantum computing | Chris Woodford - Explain That Stuff

280px-QuantumHarmonicOscillatorAnimation.gif

  • Wave Function Collapse - occurs when a wave function—initially in a superposition of several eigenstates—reduces to a single eigenstate due to interaction with the external world. This interaction is called an "observation". It is the essence of a measurement in quantum mechanics which connects the wave function with classical observables like position and momentum. Collapse is one of two processes by which quantum systems evolve in time; the other is the continuous evolution via the Schrödinger equation. ... ...Wikipedia

Quantum coherence and quantum entanglement are two landmark features of quantum physics, and now physicists have demonstrated that the two phenomena are "operationally equivalent"—that is, equivalent for all practical purposes, though still conceptually distinct.

  • Decoherence - happens when anything gets in the way of a Qubit's job, The interaction of Qubit with their environment in ways that cause their quantum behavior to decay and ultimately disappear. Qubit's quantum state is extremely fragile. The slightest vibration or change in temperature—disturbances known as “noise” in quantum-speak—can cause Qubit to tumble out of Superposition before their job has been properly done. That’s why researchers do their best to protect Qubits from the outside world in those supercooled fridges and vacuum chambers. But despite their efforts, noise still causes lots of errors to creep into calculations. Smart quantum algorithms can compensate for some of these, and adding more Qubits also helps. However, it will likely take thousands of standard Qubits to create a single, highly reliable one, known as a “logical” Qubit. This will sap a lot of a quantum computer’s computational capacity. - #1 enemy of quantum computing. Explainer: What is a quantum computer? | Martin Giles - MIT Technology Review ...Wikipedia

  • Quantum Negativity - is a measure of quantum entanglement. Quasi-probability allows negative probabilities, like a -100%, to explain concepts such as quantum entanglement. Quantum particles can carry an unlimited amount of information about things they have interacted with and could enable far more precise measurements and power new technologies, such as super-precise microscopes and quantum computers....We are used to dealing with probabilities that range from 0% (never happens) to 100% (always happens). To explain results from the quantum world however, the concept of probability needs to be expanded to include a so-called quasi-probability, which can be negative. This quasi-probability allows quantum concepts such as Einstein’s ‘spooky action at a distance’ and wave-particle duality to be explained in an intuitive mathematical language. For example, the probability of an atom being at a certain position and traveling with a specific speed might be a negative number, such as -5%. An experiment whose explanation requires negative probabilities is said to possess ‘quantum negativity.’ Quantum Negativity can be used to take more precise measurements of everything from molecular distances to gravitational waves. Ultra-Precise Measurements Powered by Quantum Negativity – “Highly Counterintuitive and Truly Amazing!” | University of Cambridge - SciTechDaily


  • Locality - an object is directly influenced only by its immediate surroundings. The concept is that for an action at one point to have an influence at another point, something in the space between those points such as a field must mediate the action. To exert an influence, something, such as a wave or particle, must travel through the space between the two points, carrying the influence. This is an alternative to the older concept of instantaneous "action at a distance". In 1935 Albert Einstein, Boris Podolsky and Nathan Rosen in their EPR paradox theorized that quantum mechanics might not be a local theory, because a measurement made on one of a pair of separated but entangled particles causes a simultaneous effect, the collapse of the wave function, in the remote particle (i.e. an effect exceeding the speed of light). In 1964 John Stewart Bell formulated the "Bell inequality", which, if violated in actual experiments, implies that quantum mechanics violates either locality or realism, another principle which relates to the value of unmeasured quantities. The two principles are commonly referred to as a single principle, local realism. ... Wikipedia
  • Renormalization - In physics, certain universal features of a quantum many-body system, such as the phase (e.g., liquid, gas, solid, etc.) of materials do not depend on (or are not sensitive to) microscopically detailed information of the system, but rather governed by only a few important hidden parameters. Renormalization is a theory technique to identify those important parameters starting from microscopic description of a quantum system. The theory of self-similar geometric structures, that are used to treat infinities arising in calculated quantities by altering values of quantities to compensate for effects of their self-interactions. ... Wikipedia


  • Quantum Dot (QD) - are tiny semiconductor particles a few nanometres in size, having optical and electronic properties that differ from larger particles due to quantum mechanics. They are a central topic in nanotechnology. When the quantum dots are illuminated by UV light, an electron in the quantum dot can be excited to a state of higher energy. ... ...Wikipedia

  • Interference - a phenomenon in which two waves superpose to form a resultant wave of greater, lower, or the same amplitude. Constructive and destructive interference result from the interaction of waves that are correlated or coherent with each other, either because they come from the same source or because they have the same or nearly the same frequency. Interference effects can be observed with all types of waves, for example, light, radio, acoustic, surface water waves, gravity waves, or matter waves. The resulting images or graphs are called interferograms. ... ...Wikipedia

defb684fef583b3d7cf1ab26b47578dc.gif


Quantum Double Slit Experiment

One of the deepest mysteries in quantum physics is the wave-particle duality: every quantum object has properties of both a wave and a particle. Nowhere is this effect more beautifully demonstrated than in the double-slit experiment: streams of particles, photons and electrons are directed at a barrier with two narrow openings. While each particle shows up at the detector individually, the population as a whole creates an interference pattern as though they are waves. Neither a pure wave nor a pure particle description has proven successful in explaining these experiments.

Quantum laser pointers brings you the infamous double slit experiment right in the palm of your hand. In 1801 English physicist Thomas Young performed this experiment to determine if light was a particle or a wave. A laser shines a coherent beam of light through a film disc containing two parallel slits. Light striking the wall behind the slits producers a classic interference pattern. This surprising result means light passes through the parallel slits not as particles but as waves. When the peaks of two waves overlap it creates a band of light. When the peak of one wave meets the valley of another, light is cancelled out. Variations of this experiment spurred public debates between Albert Einstein and Neils Bohr on the true nature of reality. It’s been called the granddaddy of all quantum weirdness.

  • Diffraction - refers to various phenomena that occur when a wave encounters an obstacle or a slit. It is defined as the bending of waves around the corners of an obstacle or through an aperture into the region of geometrical shadow of the obstacle/aperture. The diffracting object or aperture effectively becomes a secondary source of the propagating wave. ... ...Wikipedia


The delayed-choice quantum eraser experiment investigates a paradox. If a photon manifests itself as though it had come by a single path to the detector, then "common sense" (which Wheeler and others challenge) says that it must have entered the double-slit device as a particle. If a photon manifests itself as though it had come by two indistinguishable paths, then it must have entered the double-slit device as a wave. If the experimental apparatus is changed while the photon is in mid‑flight, then the photon should reverse its original "decision" as to whether to be a wave or a particle. ... ...Wikipedia

SuperLASER_Drupal_1.1.png


  • Absolute Zero - The lowest temperature possible, equivalent to -273.15°C (or 0° on the absolute Kelvin scale), at which point atoms cease to move altogether and molecular energy is minimal. The idea that it is impossible, through any physical process, to lower the temperature of a system to zero is known as the Third Law of Thermodynamics. The lowest limit of the thermodynamic temperature scale, a state at which the enthalpy and entropy of a cooled ideal gas reach their minimum value, taken as 0°. The fundamental particles of nature have minimum vibrational motion, retaining only quantum mechanical, zero-point energy-induced particle motion. ... ...Wikipedia

Concepts: Mechanisms for Understanding

  • Qubit - the fundamental object of information in quantum computing ... Wikipedia


  • Bloch sphere - a geometrical representation of the pure state space of a two-level quantum mechanical system (Qubit) Quantum mechanics is mathematically formulated in Hilbert space or projective Hilbert space. The space of pure states of a quantum system is given by the one-dimensional subspaces of the corresponding Hilbert space (or the "points" of the projective Hilbert space). For a two-dimensional Hilbert space, this is simply the complex projective line ℂℙ1. This is the Bloch sphere.... Wikipedia

Bloch Sphere Visualization (Python) | Tyler Dwyer - GitHub ... Python

  • Quantum Operator - a function over a space of physical states to another space of physical states. The simplest example of the utility of operators is the study of symmetry (which makes the concept of a group useful in this context). Because of this, they are very useful tools in classical mechanics. Operators are even more important in quantum mechanics, where they form an intrinsic part of the formulation of the theory.Wikipedia


  • Hilbert Space - an abstract vector space possessing the structure of an inner product that allows length and angle to be measured ...Wikipedia

220px-Standing_waves_on_a_string.gif 210px-Discrete_complex_vector_components.svg.png 214px-Continuous_complex_vector_components.svg.png


  • Dirac Notation .. Bra–ket - notation is a standard notation for describing quantum states, composed of angle brackets and vertical bars. It can also be used to denote abstract vectors and linear functionals in mathematics. It is so called because the inner product (or dot product) of two states is denoted by a ⟨bra|c|ket⟩ ...Wikipedia


  • Schrödinger's Equation - a linear partial differential equation that describes the wave function or state function of a quantum-mechanical system ... Wikipedia


  • Quantum Numbers, Atomic Orbitals, and Electron Configurations - By solving the Schrödinger equation (Hy = Ey), we obtain a set of mathematical equations, called wave functions (y), which describe the probability of finding electrons at certain energy levels within an atom. A wave function for an electron in an atom is called an atomic orbital; this atomic orbital describes a region of space in which there is a high probability of finding the electron. Energy changes within an atom are the result of an electron changing from a wave pattern with one energy to a wave pattern with a different energy (usually accompanied by the absorption or emission of a photon of light). Each electron in an atom is described by four different quantum numbers. The first three (n, l, ml) specify the particular orbital of interest, and the fourth (ms) specifies how many electrons can occupy that orbital. Angelo State University ...Wikipedia


  • MIP*=RE

The class MIP* of languages that can be decided by a classical verifier interacting with multiple all-powerful quantum provers sharing entanglement is equal to the class RE of recursively enumerable languages. MIP*=RE | Z. Ji, A. Natarajan, T. Vidick, J. Wright, and H. Yuen

MIP* = RE is not a typo. It is a groundbreaking discovery. Major quantum computational breakthrough is shaking up physics and maths | Ittay Weiss - Yahoo! News

Halting Problem

The problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. Wikipedia


  • Oracle Function

An oracle O is a "black box" operation that is used as input to another algorithm. Quantum Oracles | Microsoft A super smart or a super slick quantum circuit). It uses the quantum parallelism concept to compute all values of f(x) from the superposition in polynomial time, instead of growing exponentially with the number of bases. … The key idea is the Oracle function will output values that after applying interference (a transformation), we will measure 0 for all constant functions or 1 for balanced functions.QC — Quantum Algorithm with an example | Jonathan Hui

Quantum Biology

Quantum biology is the study of applications of quantum mechanics and theoretical chemistry to biological objects and problems. Many biological processes involve the conversion of energy into forms that are usable for chemical transformations, and are quantum mechanical in nature. Such processes involve chemical reactions, light absorption, formation of excited electronic states, transfer of excitation energy, and the transfer of electrons and protons (hydrogen ions) in chemical processes, such as photosynthesis, olfaction and cellular respiration. Quantum biology | Wikipedia

Quantum Cryptographic Technology

How DLTs could withstand the advent of quantum computers? | Rodny Palomino - Medium


National Institute of Standards and Technology (NIST) Computer Security Resource Center (CSRC)

In recent years, there has been a substantial amount of research on quantum computers – machines that exploit quantum mechanical phenomena to solve mathematical problems that are difficult or intractable for conventional computers. If large-scale quantum computers are ever built, they will be able to break many of the public-key cryptosystems currently in use. This would seriously compromise the confidentiality and integrity of digital communications on the Internet and elsewhere. The goal of post-quantum cryptography (also called quantum-resistant cryptography) is to develop cryptographic systems that are secure against both quantum and classical computers, and can interoperate with existing communications protocols and networks.

Physics and Cryptology

Computers and cryptographic hardware eventually are no Turing machines living in a Platonic world, but real, physical objects that can be touched and accessed, and which consume power, dissipate radiation, or are susceptible to faults and invasive manipulation. This simple observation has had a massive impact both for codemakers and codebreakers over the last decades. On the side of codebreakers, various attacks have been developed that specifically target the physical nature of electronic hardware; they include invasive and semi-invasive read-out techniques, fault injection, photonic emission analysis, power or other side channels, and also hardware Trojans, only naming a few. Complementary to that, physical phenomena like quantum effects or optical interference can allow faster computations than classical Turing machines for certain cryptographically relevant problems. This enables novel computational attack vectors based on physics, too. On the other hand, physics provides equally powerful tools for codemakers. Call for Papers: Special Section on Physics and Cryptology--an Inevitable Couple

Leading Experts

  • Peter Shor: Shor is a professor of mathematics at MIT and is known for developing Shor's algorithm, which is a quantum algorithm for integer factorization.
  • Amir Yacoby: Yacoby is a professor of physics at Harvard University and is known for his work on quantum computing with superconducting circuits.
  • Ludwig M. Duan: Duan is a professor of physics at the University of Chicago and is known for his work on quantum computing with trapped ions.
  • Raymond Laflamme: Laflamme is a professor of physics at the University of Waterloo and is known for his work on quantum computing with NMR.
  • John Preskill: Preskill is a professor of theoretical physics at Caltech and is known for his work on quantum computing theory.
  • Seth Lloyd: Lloyd is a professor of mechanical engineering and applied physics at MIT and is known for his work on quantum computing theory.
  • Christoph Simon: Simon is a professor of physics at the University of Vienna and is known for his work on quantum algorithms.
  • Daniel Gottesman: Gottesman is a professor of physics at the Perimeter Institute for Theoretical Physics and is known for his work on quantum error correction.
  • Michel Devoret: Devoret is a professor of physics at Yale University and is known for his work on quantum measurement and control.
  • Isaac Chuang: Chuang is a professor of electrical engineering and computer science at the University of Chicago and is known for his work on quantum information theory.
  • David Awschalom: Awschalom is a professor of physics at the University of Chicago and is known for his work on quantum computing with spin qubits.
  • David DiVincenzo: DiVincenzo is a professor of physics at the University of Maryland and is known for his work on the requirements for a scalable quantum computer.
  • Hartmut Neven: Neven is a vice president of Google AI and is known for his work on Google's quantum computing project, Sycamore.
  • Michele Mosca: Mosca is a professor of computer science at the University of Toronto and is known for his work on quantum algorithms.
  • Terry Rudolph: Rudolph is a professor of physics at the University of Oxford and is known for his work on quantum error correction.
  • Luigi Amico: Amico is a professor of physics at the University of Catania and is known for his work on quantum many-body systems.
  • Paolo Zanardi: Zanardi is a professor of physics at the University of Pavia and is known for his work on quantum algorithms and quantum error correction.
  • Liang Jiang: Jiang is a professor of physics at the University of Chicago and is known for his work on quantum many-body systems and quantum information theory.
  • Jianfeng Lu: Lu is a professor of physics at the University of Science and Technology of China and is known for his work on quantum information theory and quantum communication.
  • Xiao-Gang Wen: Wen is a professor of physics at the Massachusetts Institute of Technology and is known for his work on quantum many-body systems and topological quantum computation.

Courses

Learn Quantum Computation using Qiskit

Quantum Computing for the Determined | Michael Nielsen


University of Toronto

In this course we will introduce several quantum machine learning algorithms and implement them in Python. This massively open online online course (MOOC) on edX is offered by the University of Toronto on edX with an emphasis on what benefits current and near-future quantum technologies may bring to machine learning. These notebooks contain the lecture notes and the code for the course. The content is organized in four modules, with an additional introductory module to the course itself. Since the course is hands-on, we found it important that you can try the code on actual quantum computers if you want to. There isn't a single, unified programming framework that would allow to address all available quantum hardware. For this reason, the notebooks are available in two versions: one in Qiskit targeting the IBM Q hardware and the Forest SDK targetting the Rigetti quantum computer. The notebooks also cover quantum annealing -- for that, the D-Wave Ocean Suite is used. For more details on setting up your computational environment locally.


Quantum Computation at CMU | Ryan O'Donnell


Quantum Mechanics - Univ. of California, Berkeley | Umesh V. Vazirani


Quantum Computing Math Skills

Texts and Notes

Quantum Supremacy

Quantum supremacy is the potential ability of quantum computing devices to solve problems that classical computers practically cannot. Experts forecast that quantum supremacy will become a reality within a matter of years for a limited number of computing problems.

Grim, With Hope

Quantum Chess

What exactly is quantum chess? It's a complicated version of regular chess that incorporates the quantum concepts of superposition, entanglement, and interference. “It’s like you’re playing in a multiverse but the different boards [in different universes] are connected to each other,” said Caltech physicist Spiros Michalakis during a livestream of the tournament. “It makes 3D chess from Star Trek look silly.” Quantum chess (as played in the tournament) is the brainchild of Chris Cantwell of Quantum Realm Games. We have a winner in the world’s first quantum chess tournament | Jennifer Ouellette


Exploring Quantum History

Albert Einstein was not a fan of quantum mechanics. He was annoyed by the uncertain, random nature of the universe it implied (hence the famous quote "God does not play dice with the universe"). So, Einstein tried to develop a unified theory that would circumvent what he saw as quantum mechanics' flaws; the "unruly child" of quantum mechanics, and how the famed physicist came up with the Special Theory of Relativity.