Google Deepmind LLM Solves Major Open Question in Math. AI Advancing Science is Huge Progress to AGI

Google’s Gemini LLMs (Large Language Model) produced a new math discoveries and solves real-world problems. This is a significant step to AGI. The AI is speeding up progress in math and science. This is the first time a new discovery has been made for challenging open problems in science or mathematics using LLMs. FunSearch discovered …

Read more

Lengthy Academic Talk on Quantum Computing Reality and Hype

Here is a three-hour talk on quantum computing and quantum theory reality and hype. Scott Aaronson is a professor of computer science at University of Texas at Austin and director of its Quantum Information Center. Previously he received his PhD at UC Berkeley and was a faculty member at MIT in Electrical Engineering and Computer …

Read more

Entangle Quantum Entangled Machines Can Verify Solutions Up to Halting Problem Hardness Level

A major new proof has combined Albert Einsteins Quantum Physics with Alan Turing’s Computing Theories. The new proof shows that quantum entangled machines can be used to verify solutions to problems that are as complicated and hard as the halting problem. Turing showed that Halting problem cannot be solved but we can use entangled systems …

Read more

Airbus CTO Predicts a Quantum Computing Era in Aerospace

Airbus chief technology officer (CTO) Grazia Vittadini predicts a quantum era in aerospace. Vittadini made this prediction in a Wall Street Journal article. Quantum computing research is being applied to tough flight physics problems. This is even with the small quantum computer systems that are available today. Nextbigfuture believes the pre-error corrected quantum computers that …

Read more

Classical Verification of Quantum Computations – QIP 2019 Keynote

Is it possible for an efficient classical verifier (a BPP machine) to verify the output of an efficient quantum prover (a BQP machine)? The answer is Yes. Researchers show that a classical polynomial time verifier (a BPP machine) can interact with an efficient quantum prover (a BQP machine) in order to verify BQP computations. They …

Read more

Analog Solver Could Find the Best Solutions to NP-hard Problems

Zoltan Toroczkai and collaborators have been working toward developing a novel analog mathematical approach that will help advance computation beyond the digital framework. They have a mathematical, analog “solver” that can potentially find the best solution to NP-hard problems. NP-hardness is a theory of computational complexity, with problems that are famous for their difficulty. And …

Read more

IBM proves a quantum computing advantage over classical

IBM scientists have mathematically proven that there are certain problems that require only a fixed circuit depth when done on a quantum computer no matter how the number of inputs increase. On a classical computer, these same problems require the circuit depth to grow larger. The proof is that there will be problems that can …

Read more

Patterns found in Prime Numbers

A new analysis by Princeton University researchers has uncovered patterns in primes that are similar to those found in the positions of atoms inside certain crystal-like materials. The discovery may aid research in both mathematics and materials science. “Prime numbers have beautiful structural properties, including unexpected order, hyperuniformity and effective limit-periodic behavior,” said Torquato. “The …

Read more