New AI Algorithm Can Reduce LLM Energy Usage by 80-95%

New Linear-complexity Multiplication (L-Mul) algorithm claims it can reduce energy costs by 95% for element-wise tensor multiplications and 80% for dot products in large language models. It maintains or even improving precision compared to 8-bit floating point operations. By replacing complex floating-point multiplication with integer addition Solution in this Paper – Approximates floating-point multiplication using …

Read more

A survey of Quantum Algorithm Applications and End-to-end Complexities

Arxiv – A survey of applications and end-to-end complexities. (337 pages. Oct 2023) by Researchers at AWS Center for Quantum Computing, Institute for Quantum Information, RWTH Aachen University (Germany), Caltech, Imperial College of London, Harvard, Alfred R´enyi Institute of Mathematics, Budapest, Hungary, IT University of Copenhagen, Copenhagen, Denmark, Amazon Quantum Solutions Lab. Abstract The anticipated …

Read more

Deep Mind AlphaTensor Will Discover New Algorithms

Deep Mind has extended AlphaZero to mathematics to unlock new possibilities for research Algorithms. AlphaTensor, builds upon AlphaZero, an agent that has shown superhuman performance on board games, like chess, Go and shogi, and this work shows the journey of AlphaZero from playing games to tackling unsolved mathematical problems for the first time. The ancient …

Read more

Solving 10,000 Year Google Quantum Problem in 5 Days Using 60 GPUs

60 graphical processing units (GPUs) have been used to solve the Google quantum supremacy computer problem. Researchers generated one million correlated bitstrings with some entries fixed, from the Sycamore circuit with 53 qubits and 20 cycles, with linear cross-entropy benchmark (XEB) fidelity equals 0.739, which is much higher than those in Google’s quantum supremacy experiment. …

Read more

Breakthrough Electronic Amoeba Analog Computer For Approximate Solving Traveling Salesman Problems

Many important and valuable planning and scheduling problems in logistics and automation are combinatorial optimization problems. The most famous problem of this type is the traveling salesman problem. The salesman problem is this question: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits …

Read more

Particle Accelerator on a Chip Will Reach a Million Electron Volts by End of 2020

Scientists at Stanford and SLAC have created a silicon chip that can accelerate electrons using an infrared laser to deliver, in less than a hair’s width, the sort of energy boost that takes microwaves many feet. Above – This image, magnified 25,000 times, shows a section of an accelerator-on-a-chip. The gray structures focus infrared laser …

Read more

AI for Good: Balancing the Risks and Rewards #emTechDigital

There are series of three speakers talking about using AI for social good, defend human rights and an analysis on how to mitigate AI generated fake news. Ensuring that the era of AI benefits society at large will require developing new ethical principles for the field, and rethinking how we engage with these systems and …

Read more

Finalist Quantum Computer Resistant Algorithms Selected in Long Standardization Process

The National Institute of Standards and Technology is working with many companies and researchers to provide security for financial information and privacy when there are quantum computers powerful enough to break current encryption. They have selected 26 post-quantum algorithms after one year of testing in the second round of a massive selection process. The goal …

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

Simulated Quantum Annealing on regular computers can handle up to a million variable optimization

Supply chain optimization software vendor ServicePower can handle optimizations problems that need to analyze up to 1 million variables. Each variable is represented by a virtual Qubit. They simulate their quantum annealing using parallelization on standard server farms using normal computer hardward to make up for the slower speed compared to D-Wave’s specialized quantum hardware. …

Read more