Intel’s Quantum Computing Research Melds Old-school Silicon With Latest Quantum Tech | Digital Trends

Quantum computers, once they become common, will complete difficult tasks thousands of times more quickly than current PCs. That could obviously threaten a classic chipmaker like Intel, but it plans to use its knowledge of silicon production to build quantum chips more quickly than its peers.

About #Quantum computing design, @intel Chief says : We’re essentially using the same process lines, same tools, same design rules to do this, and that’s an advantage for Intel

Source : Intel’s Quantum Computing Research Melds Old-school Silicon With Latest Quantum Tech | Digital Trends

Why This Quantum-Encrypted Video Hangout Is a Big Deal – But there are limits …

Even if this is a big improvment I quoted the following part :

…So Pan’s group had to incorporate conventional telecom technology to propagate their quantum signals. At several points in their network, they had to convert quantum information (polarizations) into classical information (voltages and currents) and then back into quantum. This isn’t ideal, because the absolute security of a quantum key relies on its quantum-ness. Anytime the key gets converted into classical information, normal hacking rules apply…

Just what we all wanted: super secret, super long meetings that span the entire world.

Source : Why This Quantum-Encrypted Video Hangout Is a Big Deal | WIRED

How to test the “quantumness” of a quantum computer?

I posted this question in the forum of IBM quantum Experience web site :

How to test the “quantumness” of a quantum computer?

As Quantum computer would be first accessible via the Cloud, I wonder if there are existing tips & tric to test the “quantumness” of my programs and if they really run on a real Quantum hardware and not a simulator…

Seems to be an attractive and shared interest with the community has the statistic of the post are quit important

 

What the community told us

  1. I noted the terminology of one guy : is like a “turing test” for a quantum computer 🙂

  2.  We have to create non-classical states, for example entangled states and perform measurements to show that these states are not behaving classically.  There are examples of this in the tutorial.

  3. The standard way to test the quantumness of a general system is to carry out the Bell test (see section III.4 in the Library)

  4. You only need to do the Bell test for a large enough system, then no classical simulator can compete in preparing the entangled state of >50 qubits

  5. you could try to do some sort of integer randomness test with outputs from a thoruoughly entangled code?

  6. The other way to verify ‘quantumness’ is to run a sequence of a hard algorithm, where every next iteration is double the problem size of the previous iteration.  If you see the running time only increase linearly then you have an indication the hardware is indeed using quantum resources.

  7. I don’t believe you can, practically speaking. They already have an ideal simulation of it, the difference between a simulation of something and the real thing is the error involved

  8.  Although, the idea proposed by simon_yin of doubling the problem size for each next iteration could work.   Nice discussion!

  9. your answer is almost perfect, but quantumness is not about “randomness”, is about “correlations”, “tunneling” and other features.

  10. Classical systems can be random, while we do not forget the deterministic nature of quantum computing –you beforehand know all the resulting matrices in a product (and time evolution is unitary until measuring the whole quantum system). The error of measurements is not the guide we need, so noise isn’t a clue as important as we can think. The pattern of quantum results is what makes sense to classify them apart from classical systems outcomes. Randomness is the preferred feature of cheap books about “quantum and sciences”, but written from an amateur sight (closer to journalists than to scientists). If I’m wrong, Bernoulli family should have been awaiting Planck’s birth to develop the mathematical statistics, joining forces with Chebyshev, Laplace and other thinkers.

  11.  I guess I was not clear.  I realize that the unitary evolution of an initial quantum state is deterministic up to the point of measurement.  But randomness occurs at the point of measurement.

Finally IBM guys answer with their proposal :

Hi @yannallain this is a hard question. The method we like is the quantum volume. Check out @levsbishop video here for a brief overview. There is a technical white paper that can be found here.

Source of all detailed discussion

The Double Slit experiment with hacker style :-)

Wave & Particles behavior experiments with style (Hacker & DIY mode on)

Could help to understand why a “Quantum bit” (or for short a “Qubit”) could be a “more powerful” hardware support to leverage computing as it’s rely on quantum mechanic behavior – Qubit = more than one state at a time !

Today, I wish to share with you my last experiment about my beginning journey to the understanding of quantum mechanic and quantum computing domain. May be you  already known that everything in the Univers could behave as a Wave and as a Particule at the same time. And ,as far I understand, each peaces of matters in the univers could behave like that until we observe it ! Those “small particules behavior phenomena” seems to be one of the fondamental aspect of quantum mechanic (again,  as I understand it for now)

OK… but How to verify that ? here is come the “Double Slit Experiment” but, as a security guy, we will try to conduct this experiment with….style

  • and more precisely …. with a hacker and Do It Yourself  mind style.

Ready?

In fact , many of you should have heard or read that light is composed of small particule call “photons”.

 Thus, if I send a bunch of photon (whit a laser?) again a wall… you will see  a small spot on the wall. see on the right…

Nothing strange…for now…

 

But if we send this laser beam through a double slit made with a cutter on a solid paper (left on side below)…with a very  technical and expensive experimental tools with Word wide scientific precision  🙂

 

 

 

 

 

 

What would be the result on the wall after the light of the laser beam pass trough the double slit ?

Strange and non intuitive things arise here : You will see this on the wall

What’s going on with those crazy photons ? it seems that light behave as a wave !? (as we see interference pattern which , if I refer to littérature available on internet, is a fondamental behavior of a wave !

How it works?

(image of this simulation of those crazy photons behavior found on Wikipedia)

Thus, we could conclude that a laser beam (light) behave some time as a particule (the spot) and sometime as a wave (through the double slit)

Welcome in quantum word !

But believe me (or not) this could help us to designed a new type of computer : A quantum computer… and this experiments works if you send ELECTRON through a double slit instead of light

For all readers, we recommande to watch a complete scientific explanation done by Jim Al-Khalili presented at the royal institution in 2013 (Best Video I watched about this experiment)

Reference of this experiment is related to the work of a scientific, as mentioned by wikipedia as follow :

”  A simpler form of the double-slit experiment was performed by Thomas Young in 1801 (well before quantum mechanics). He believed it demonstrated that the wave theory of light was correct, and his experiment is sometimes referred to as Young’s experiment”

Note: this article was written in listening of “Coming Back to Life ” from Pink floyd… perfect match for those weird stuff 🙂

 

Interresting practical results about Error correction effectiveness on real QC hardware

In this post, James R. Wootton, University of Basel, shows the effectiveness of Error code correction using the 16 Qubits Processor of IBM.

What is interresting to me is the practical results obtained and how the experiments was conducted

See quote of the article below

If we try to store our bit using just a single qubit, the probability of an error over the timescale of the experiment can be between 10% and 20%. The goal of using error correction is to reduce this. The bigger the error correcting code, the less likely an error should be.

The smallest case I considered  was a repetition code with 3 code qubits (with an additional two qubits, the ancillas, helping to make measurements). When storing a 1, the probability of an error is around 4%. This is already better than a single qubit.

The largest case I considered had 8 code qubits (plus 7 ancillas). The probability of an error in this case was 0.025%, which is much better than a single qubit.

Worth reading and experiments by yourself !

Trust me : Computing’s Hardware have already change over the age !

It this video, called “Quantum Computing: Revolutionizing computation through quantum mechanics“, The Microsoft researcher of Station Q group, Dr Krysta Svore, shows in one slide that  Computing’s Hardware have already change over the age !

 

From mechanical machines,  early in 100 BC (!) to transistors based actual machines.

This slide could summary my questionning concern about people would seem to not accept that ,in some years, there could  be a evolution of hardware that support our “computing needs”. May be it will be Quantum computing, maybe DNA based computing or something else. But Computing’s hardware could change over the age.

Take a look at my quantum code experiment on a real Quantum computer : Grover Algorithm (thanks to IBM)

  • Objectif des travaux : Comprendre, par la pratique, comment et pourquoi l’algorithme Grover semble plus rapide pour faire des recherches sur des ensembles de données non structurée & tenter l’expérience sur un ordinateur quantique réel (celui d’IBM)
    Lien vers l’expérimentation (contient le “quantum programm”) https://quantumexperience.ng.bluemix.net/share/code/b46b4d115dd87bb03b6e5a312148fc08/execution/a258dc762fa84458eb589245e4b4f25f
  • Contexte de l’expérimentation : Si dans un jeux de carte de 4 cartes, nous mettons une reine de coeur et 3 autre cartes au hazard. Nous retournons le jeux face contre une table. Nous brouillons les cartes (en changeant leur position). Avec l’informatique Classique, nous pouvons tenter de deviner où est la Reine de coeur parmis les 4 cartes qui ont été “scramblé” : un algorithme classique permettrait en 2 essai et 1/4 de retrouver la place de la Reine de coeur (statistiquement). Mais avec l’informatique Quantique et l’algorithme de Grover, cette recheche semble plus rapide : Nous pouvons utiliser Grover pour trouver en 1 coup (1 seul requete de recherche ou se situe la Reine de coeur parmis les 4 positions possible)
    ( travaux issue d’une video IBM : https://www.youtube.com/watch?v=pYD6bvKLI_c)
  • Ma conclusion intermédiaire : Pas tout compris encore mais je me soigne 😉
Want to share this?
Want to share this?