The technique, called Argument Reweighting (AR), was developed by researchers from the University of Tokyo and the China Academy of Engineering Physics. The researchers say it can be applied across a broad range of quantum-error-correcting codes and decoding algorithms because it does not require a fundamentally different error-correction architecture.

Quantum computers are highly sensitive to disturbances and noise. Their basic information units, or qubits, can lose their intended state during computation, making error correction essential for building machines capable of carrying out long and complex calculations reliably.

The new approach focuses on a problem that occurs after error-correction data have been processed: determining whether the decoder’s proposed correction is itself reliable.

Researchers use repeated decoding to test stability

In conventional quantum-error-correction decoding, measurements from a quantum processor are analyzed to determine which errors most likely occurred and what correction should be applied.

The researchers’ AR method deliberately changes the weighting of the leading correction candidate and then runs the decoding process again. If the decoding produces the same result despite the change, the result is considered stable enough to retain. If the outcome changes, the result is rejected through a process known as post-selection.

The method effectively uses the stability of a decoding result as an additional indication of whether that result can be trusted.

That makes AR different from simply attempting to correct more errors. Instead, it provides a mechanism for identifying correction results that may be unreliable and filtering them out.

Tests showed a large reduction in logical errors

In tests involving a family of quantum codes known as BB codes, the researchers reported that rejecting only about one result in every 70,000 could reduce the logical error rate to one-sixtieth or less.

The researchers described the method as particularly attractive because of its simplicity and broad compatibility. Their findings were published in Physical Review Letters under the title “Simple, Efficient, and Generic Post-Selection Decoding for qLDPC Codes.”

The reported results are experimental and computational evidence for the method rather than a demonstration that large-scale fault-tolerant quantum computing has been achieved.

That distinction is important. Quantum-error correction remains one of the central obstacles to building useful large-scale quantum computers, and substantial additional hardware and engineering work is required before techniques such as AR can be deployed in practical systems.

The method could apply beyond quantum computing

The researchers said the technique could have implications across quantum-information technologies that rely on quantum-error correction.

Those include quantum communication, quantum sensing and quantum cryptography, where errors can similarly undermine the reliability of information encoded in quantum states.

Japan is pursuing quantum-error correction through several parallel research programs.

The country’s Moonshot Goal 6 program is targeting a fault-tolerant universal quantum computer by 2050, with the second phase beginning in 2026. The program has set an objective of demonstrating quantum-error correction by 2028 and a small-scale fault-tolerant quantum-computing proof of concept by 2030.

Other Japanese research teams are pursuing hardware approaches alongside improvements to error-correction algorithms. A project led by Kyoto Institute of Technology, for example, is developing a scalable, highly integrated quantum-error-correction system, while RIKEN-led research is targeting fault-tolerant silicon quantum-computing technologies.

The University of Tokyo team’s latest work therefore represents one component of a much broader effort to make quantum computation sufficiently stable for practical use.

For the technology to become commercially useful, researchers must ultimately combine reliable error correction with scalable quantum hardware capable of maintaining large numbers of logical qubits while controlling the physical errors generated during computation.

Reporting Credit: The University of Tokyo — research findings and description of the Argument Reweighting method; Physical Review Letters — publication of the research; Japan Science and Technology Agency — Japan’s Moonshot Goal 6 quantum-computing targets.

The post Japan Develops New Quantum Error-Correction Method for More Reliable Quantum Computers appeared first on Journos News - Breaking News, World News, Top Stories, Todays Headlines and Flash Reports.

Google has unveiled a groundbreaking quantum computing chip, named “Willow”, claiming it can solve complex problems in just five minutes—tasks that would take the world’s fastest supercomputers an astonishing 10 septillion years to complete. This development marks a significant step in the quest for ultra-powerful computing based on quantum mechanics.

What Makes Willow Revolutionary?

Google describes Willow as a chip that incorporates key breakthroughs in quantum computing and believes it is a milestone on the path to a functional, large-scale quantum computer. Hartmut Neven, head of Google’s Quantum AI lab and self-proclaimed “chief optimist,” expressed confidence that Willow would contribute to practical applications in the near future.

While still experimental, Willow is a glimpse into a future where quantum computers could revolutionize industries by simulating intricate systems and solving previously insurmountable problems.

How Quantum Computing Works

Quantum computers differ fundamentally from traditional ones. Instead of using bits (binary values of 0 or 1), they process data in qubits, which can exist in multiple states simultaneously. This ability, stemming from the bizarre nature of quantum mechanics, allows quantum computers to tackle calculations exponentially faster than conventional systems.

Key features of quantum particles include:

• Superposition: The ability to exist in two places or states at once.
• Entanglement: A mysterious connection between particles that persists even across vast distances.

Credits CNET: Google Quantum AI Reveals Willow Quantum Computing Chip

Potential Applications and Implications

Quantum computing holds immense promise for solving problems across various fields, such as:

• Healthcare: Accelerating drug discovery and understanding complex biological processes.
• Energy: Designing nuclear fusion reactors and improving battery technology.
• Security: Developing or breaking encryption systems.

However, this power also raises concerns. Quantum computers could potentially bypass modern encryption techniques, prompting companies like Apple to introduce “quantum-proof” encryption to protect sensitive data.

When Will Quantum Computing Become Practical?

Neven predicts that commercial-grade quantum computers capable of real-world applications won’t emerge until the end of the decade. Initial use cases are likely to involve simulations where quantum effects are crucial, such as pharmaceutical development, energy systems, and advanced materials research.

A Quantum Future Awaits

While Willow is not yet a universal solution, it represents a significant step toward the quantum era. The ability to simulate and solve real-world challenges using quantum mechanics could revolutionize science, industry, and technology.

Quantum computing is still years—and billions of dollars—away from full maturity, but Google’s new chip gives us a tantalizing glimpse of a future that could redefine what computers are capable of achieving.

Source

The post Google’s Willow Chip: A Quantum Leap Towards Supercomputing Supremacy appeared first on Journos News - Breaking News, World News, Top Stories, Todays Headlines and Flash Reports.