Articles tagged with Boson Sampling
Scientists develop novel LDPC quantum error correction codes that can handle hundreds of thousands of logical qubits and approach the theoretical hashing bound. The new codes achieve extremely high decoding performance, demonstrating a frame error rate as low as 10^-4, even for large-scale numerical simulations.
Researchers from OIST develop new quantum AI method for image recognition based on boson sampling, achieving highly accurate results without complex training. The approach uses a linear optical network and preserves information, outperforming classical methods in various datasets.
Researchers demonstrate novel method of boson sampling using ultracold atoms in a two-dimensional optical lattice, overcoming previous limitations in simulations and photon-based experiments. The achievement showcases the potential of quantum devices for performing non-classical computational tasks.
Researchers have developed a novel encoding scheme called critical Schrödinger cat code, which could revolutionize the reliability of quantum computers. This technique uses a hybrid regime to operate close to the critical point of a phase transition, resulting in enhanced error suppression capabilities.
Researchers have discovered a fundamental limit on the transition probabilities of linear optical systems, constraining their ability to transfer bosons. This discovery leads to a negative answer to Professor Scott Aaronson's open problem on quantum supremacy in decision problems.
A world-first criterion for quantum supremacy has been established using the Tianhe-2 supercomputer, demonstrating a significant advantage over classical computing in boson sampling tasks. The research sets the stage for future quantum computing advancements and paves the way for experimental implementation of quantum devices.
Researchers found that super-powerful quantum computers must be even more powerful than previously thought to outperform ordinary PCs. The team simulated boson sampling for 20-50 photons on laptops and servers, pushing the boundary of what is possible.
Researchers have discovered a new way to run a quantum algorithm that could solve problems classically impossible, using simpler methods than previously thought. This breakthrough has increased the likelihood of demonstrating a quantum device beating a classical computer, which would be a major milestone.
Researchers from the University of Vienna and University of Jena have successfully realized a boson sampling computer utilizing photon mobility. This breakthrough may lead to the first outperformance of classical computers in near future.