
'Rosetta Stone' of Code Shrinks Quantum Computer Hardware Needs (phys.org) 37
alternative_right shares a report from Phys.org: Now, for the first time, quantum scientists at the Quantum Control Laboratory at the University of Sydney Nano Institute have demonstrated a type of quantum logic gate that drastically reduces the number of physical qubits needed for its operation. To do this, they built an entangling logic gate on a single atom using an error-correcting code nicknamed the "Rosetta stone" of quantum computing. It earns that name because it translates smooth, continuous quantum oscillations into clean, digital-like discrete states, making errors easier to spot and fix, and importantly, allowing a highly compact way to encode logical qubits.
The curiously named Gottesman-Kitaev-Preskill (GKP) code has for many years offered a theoretical possibility for significantly reducing the physical number of qubits needed to produce a functioning "logical qubit." Albeit by trading efficiency for complexity, making the codes very difficult to control. Research published in Nature Physics demonstrates this as a physical reality, tapping into the natural oscillations of a trapped ion (a charged atom of ytterbium) to store GKP codes and, for the first time, realizing quantum entangling gates between them.
Led by Sydney Horizon Fellow Dr. Tingrei Tan at the University of Sydney Nano Institute, scientists have used their exquisite control over the harmonic motion of a trapped ion to bridge the coding complexity of GKP qubits, allowing a demonstration of their entanglement. "Our experiments have shown the first realization of a universal logical gate set for GKP qubits," Dr. Tan said. "We did this by precisely controlling the natural vibrations, or harmonic oscillations, of a trapped ion in such a way that we can manipulate individual GKP qubits or entangle them as a pair." [...] Across three experiments described in the paper, Dr. Tan's team used a single ytterbium ion contained in what is known as a Paul trap. This uses a complex array of lasers at room temperature to hold the single atom in the trap, allowing its natural vibrations to be controlled and utilized to produce the complex GKP codes. This research represents an important demonstration that quantum logic gates can be developed with a reduced physical number of qubits, increasing their efficiency.
The curiously named Gottesman-Kitaev-Preskill (GKP) code has for many years offered a theoretical possibility for significantly reducing the physical number of qubits needed to produce a functioning "logical qubit." Albeit by trading efficiency for complexity, making the codes very difficult to control. Research published in Nature Physics demonstrates this as a physical reality, tapping into the natural oscillations of a trapped ion (a charged atom of ytterbium) to store GKP codes and, for the first time, realizing quantum entangling gates between them.
Led by Sydney Horizon Fellow Dr. Tingrei Tan at the University of Sydney Nano Institute, scientists have used their exquisite control over the harmonic motion of a trapped ion to bridge the coding complexity of GKP qubits, allowing a demonstration of their entanglement. "Our experiments have shown the first realization of a universal logical gate set for GKP qubits," Dr. Tan said. "We did this by precisely controlling the natural vibrations, or harmonic oscillations, of a trapped ion in such a way that we can manipulate individual GKP qubits or entangle them as a pair." [...] Across three experiments described in the paper, Dr. Tan's team used a single ytterbium ion contained in what is known as a Paul trap. This uses a complex array of lasers at room temperature to hold the single atom in the trap, allowing its natural vibrations to be controlled and utilized to produce the complex GKP codes. This research represents an important demonstration that quantum logic gates can be developed with a reduced physical number of qubits, increasing their efficiency.
Sure.... (Score:1)
Still missing (Score:1)
1. The capability of "quantum computing" to do general computing
2. A compelling use case for that waste of money
But I'm hopeful that with some vibe coding and effective LLM power application to the problem we'll soon realize that "AGI" is unreachable without "quantum computing", so zuck will dumb another shitload of money on it, enabling us to copy our consciousness directly onto his space-time social network server.
Re: (Score:2)
And are these homosexuals in the room with you now?
Re: (Score:3)
"Quantum computing" is basically mapping a specific class of problems onto a suitable physics experiment. Which is exactly the opposite of general problem solving.
Re: (Score:2)
...just described the same rants applied to transistors...
Bullshit.
Re: (Score:3)
Ever see the first transistor?
Yes. Have you?
It's about the size of a gallon of milk.
Not even close [lindahall.org]
It really didn't do much.
It's a transistor.
If you had been around at that time, you would have derided it as useless.
The utility of the first transistor was apparent immediately and was heralded in the press as a major breakthrough. If anyone thought it was useless, it was only because they didn't know what it was or what it could do.
Re: (Score:2)
Not to mention that the theory of the junction transistor operation was developed in lockstep with the general theory of quantum mechanics 22 years earlier, in 1925, the field effect transistor a decade later, and its utility was well understood. In fact, that theory prompted the work to construct the actual device, which required technological development.
Re: (Score:2)
Yeah, but calling this a single ion qubit, when it needs a bunch of lasers to hold it in place, id EXTREMELY misleading. It may well be developed into something more efficient then the current quantum computers, but it's not shrinking to even nearly the size of an atom.
Re: (Score:2)
Re: (Score:2)
1. The capability of "quantum computing" to do general computing
We will never get that, because QCs are not suitable for that at all.
2. A compelling use case for that waste of money
Well, they can currently factor 35 (or less). So if we keep throwing money at the problem, maybe they will be able to factor current RSA keys in a few centuries.
Re: (Score:2)
maybe they will be able to factor current RSA keys in a few centuries.
At which point a general algorithm may already have done that a century earlier.
Re: (Score:2)
Exactly.
Re: (Score:2)
There are many use cases where a quantum computer would be valuable. Simulating chemical interactions sounds like one of them. Actually, and IIUC, relaxation based quantum computers are already of some use. Ones that had a more general computational capacity would be more useful were they even nearly as efficient. Factoring numbers is not one of the desirable (to me) use cases, though, it's just one of the easy ones to test.
Re: (Score:2)
I, for one, have a lot of two-digit numbers to factor, so I'm waiting impatiently for quantum supremacy.
Quantum computing (Score:5, Insightful)
How many major breakthroughs are needed before we actually get a truly useful one?
Re: (Score:2)
According to a recent paper by Gutman, the actual current factorization record with QCs is 35. i.e. 5 bit. And that is after something like 50 years of research. Hence I think it will still take a few centuries. If it is possible at all, that is.
Re: (Score:2)
According to a recent paper by Gutman, the actual current factorization record with QCs is 35. i.e. 5 bit. And that is after something like 50 years of research. Hence I think it will still take a few centuries. If it is possible at all, that is.
The current factorization record for Shor's algorithm is 35. Quantum annealing systems have factored numbers much larger numbers. See e.g. https://arxiv.org/pdf/2212.12372 [arxiv.org] But 35 is also not that bad at all. Shor's algorithm factors odd, non-perfect powers. It was first used to factor 15 in 2001, and the next number after that is 21 in 2012 https://www.nature.com/articles/nphoton.2012.259 [nature.com] . I'm actually not sure where you are getting 35 from, and would be curious for a citation about that. But this also ign
Re: (Score:2)
Quantum annealers are useless for factorization outside of meaningless stunts.
Re: (Score:2)
Re: (Score:2)
Quantum annealers cannot scale to useful sizes for this application. Hence "stunts". Actual QCs may or may not scale, but quantum annealers will never even catch up to conventional computers for this application.
Re: (Score:2)
Re: Quantum computing (Score:2)
Re: (Score:2)
Re: (Score:2)
Don't understand the haters in the comments (Score:2)
Yes, sure (Score:2)
Now down from "ludicrous" to "impossible". Or not even that.
Fucking. Stupid. Shit. (Score:2)
To do this, they built an entangling logic gate on a single atom using an error-correcting code nicknamed the "Rosetta stone" of quantum computing. It earns that name because it translates smooth, continuous quantum oscillations into clean, digital-like discrete states
The Rosetta Stone didn't translate anything. It provided information which humans used to decipher languages so that things could be translated. What a fucking stupid justification for a bullshit name used for marketing purposes because it's recognizable. This is a great example of Murphy's Law, though. If a person can fuck something up, they will, and in this case they fucked up speaking English.
Re: (Score:2)
What do you mean it didn't translate anything? The Rosetta Stone was a tablet with the identical passage carved into multiple languages. A direct translation of the same set of 'words'. Sure as heck fits my definition of a translation.
So tech that translates quantum oscillations (which digital computers can't do anything with) to "clean digital-like discrete states" (which digital computers are all over) sounds like a pretty close analogy to me.
That is good stuff (Score:2)
still a problem of scale (Score:2)