Archive for Google

AIxcuse me?!

Posted in Statistics with tags , , , , , , , on May 3, 2023 by xi'an

matrix multiplication [cover]

Posted in Books, pictures, Statistics, University life with tags , , , , , , , , , , , , , , on December 15, 2022 by xi'an

Google scholar error 403

Posted in Statistics with tags , , , on September 10, 2021 by xi'an

quantum simulation or supremacy?

Posted in Books, Statistics, University life with tags , , , , , on November 11, 2019 by xi'an

d41586-019-03167-2_17301142Nature this week contains a prominent paper by Arute et al. reporting an experiment on a quantum computer running a simulation on a state-space of dimension 253 (which is the number of qubits in their machine, plus one dedicated to error correction if I get it right). With a million simulation of the computer state requiring 200 seconds. Which they claim would take 10,000 years (3 10¹¹ seconds) to run on a classical super-computer. And which could be used towards producing certified random numbers, an impressive claim given the intrinsic issue of qubit errors. (This part is not developed in the paper but I wonder how a random generator could handle such errors.)

“…a “challenger” generates a random quantum circuit C (i.e., a random sequence of 1-qubit and nearest-neighbor 2-qubit gates, of depth perhaps 20, acting on a 2D grid of n = 50 to 60 qubits). The challenger then sends C to the quantum computer, and asks it apply C to the all-0 initial state, measure the result in the {0,1} basis, send back whatever n-bit string was observed, and repeat some thousands or millions of times. Finally, using its knowledge of C, the classical challenger applies a statistical test to check whether the outputs are consistent with the QC having done this.” The blog of Scott Aaronson

I have tried reading the Nature paper but had trouble grasping the formidable nature of the simulation they were discussing, as it seems to be the reproduction by a simulation of a large quantum circuit of depth 20, as helpfully explained in the above quote. And checking the (non-uniform) distribution of the random simulation is the one expected. Which is the hard part and requires a classical (super-)computer to determine the theoretical distribution. And the News & Views entry in the same issue of Nature. According to Wikipedia, “the best known algorithm for simulating an arbitrary random quantum circuit requires an amount of time that scales exponentially with the number of qubits“. However, IBM (a competitor of Google in the quantum computer race) counter-claims that the simulation of the circuit takes only 2.5 days on a classical computer with optimised coding. (And this should be old news by the time this blog post comes out, since even a US candidate for the presidency has warned about it!)

Nature worries

Posted in Statistics with tags , , , , , , , , , , , , on October 9, 2019 by xi'an

In the 29 August issue, worries about the collapse of the Italian government coalition for research (as the said government had pledge to return funding to 2009 [higher!] levels), Brexit as in every issue (and the mind of every EU researcher working in the UK), facial recognition technology that grows much faster than the legal protections which should come with it, thanks to big tech companies like Amazon and Google. In Western countries, not China… One acute point in the tribune being the lack of open source software to check for biases. More worries about Amazon, the real one!, with Bolsonaro turning his indifference if not active support of the widespread forest fires into a nationalist campaign. And cutting 80,000 science scholarships. Worries on the ethnic biases in genetic studies and the All of Us study‘s attempt to correct that (study run by a genetic company called Color, which purpose is to broaden the access to genetic counseling to under-represented populations). Further worries on fighting self-citations (with John Ioannidis involved in the analysis). With examples reaching a 94% rate for India’s most cited researcher.

%d bloggers like this: