How far can we push computing? Nowadays big advances are made by scaling up--think more chips packed into ever-bigger data centers. But as we near the ceiling of what we can build, there's still plenty of room below, at the fundamental physical limits of computing. Richard Feynman speaks at CERN in Geneva, Switzerland, in 1965. On the evening of December 29, 1959, at an American Physical Society meeting at Caltech, the physicist Richard Feynman gave a lecture called "There's Plenty of Room at the Bottom," on how we might manipulate and control things on an extremely small scale. There is no physical law stopping us from writing the entire on the head of a pin, he argued, or from storing every book ever written in something the size of a dust speck--or, ultimately, from arranging matter atom by atom. Biology already did versions of this (a living cell keeps its instructions in a wisp of DNA), so all of this was plainly permitted by the laws of physics. We simply had not built the tools yet.

Plus: Scientists in Austria and China have built the first nuclear clocks. The hype around humanoid robots is reaching fever pitch. Much of it comes from the idea that the same AI advances behind ChatGPT and Claude could enable robots to imitate human movement the way chatbots imitate human language. But many researchers are skeptical. They argue that such assumptions minimize the challenges of using an intelligence built on language and images to master the infinite variability of the physical world. They also point out that conflating humanoids with so-called generalist machines is misleading.

What can we learn from the brain about building better computers? Oliver Rhodes discusses how neuromorphic computing draws on the brain's architecture to develop new approaches to more efficient information processing. Can you give me an overview of your background and the research that you're involved with? Neuromorphic computing is quite a broad subject, which essentially looks to biology as inspiration to develop next-generation computing systems. We work off this principle: we know the brain is this really amazing computer, and it's able to do things that a lot of modern computing systems aren't able to do, and it also does them in an incredibly energy efficient way. We'd like to try to replicate that with some of the systems we build. In the context of the current climate around AI, while we've seen that it's made really big steps forward and is able to do really impressive things, there are certain things that it still can't do that the brain is able to do. So we look to the brain for inspiration to try and solve some of those next generation challenges. Neuromorphic computing covers all aspects of this: from looking at algorithms that might be solving a particular problem, to the systems and subsystems that would be running those algorithms, right down to a chip or devices level. We often use neural networks, which are also employed in artificial intelligence models, such as in deep learning and transformer models.

China's DeepSeek developing its own AI chip, sources say DeepSeek is designing its own chip for inference, the stage of artificial intelligence computing in which a trained model generates responses for users, sources said. Chinese startup DeepSeek is developing its own artificial intelligence chip, according to three people familiar with the matter, a push that could reduce its reliance on Nvidia and Huawei chips, which it has depended on to train and run its globally popular models. The chip is designed for inference -- the stage of AI computing in which a trained model generates responses for users -- rather than for training new models, the sources said. If successful, DeepSeek's expansion into semiconductor development would mark a major strategic shift for a company widely hailed in China as the country's AI champion, potentially adding to challenges faced by Chinese tech giant Huawei. In a time of both misinformation and too much information, quality journalism is more crucial than ever.

The US government wants to get hold of a quantum computer good enough to contribute to scientific breakthroughs in just two years. It will use it to try to accelerate the research and development of new materials, pharmaceuticals and molecules useful in agriculture and manufacturing. Once a dream of theoretical physicists, quantum computers are now undoubtedly real, but have yet to prove unambiguously useful or to have broad commercial value. Their computational power depends on their size - how many components called qubits they comprise - and how reliable they are. Existing devices are still too small and too error-prone.

Quantum Implicit Neural Representations (QINRs) have emerged as a promising paradigm that leverages parametrised quantum circuits to encode and process classical information. However, significant challenges remain in areas such as ansatz architecture design, the effective utility of quantum-mechanical properties, training efficiency, and the integration with classical modules. This paper advances the field by introducing a novel QINR architecture for 2D image and 3D geometric field learning, which we collectively refer to as Quantum Visual Field (QVF). QVF encodes classical data into quantum statevectors using neural amplitude encoding grounded in a learnable energy manifold, ensuring meaningful Hilbert space embeddings. Our ansatz follows a fully entangled design of learnable parametrised quantum circuits, with quantum (unitary) operations performed in the real Hilbert space, resulting in numerically stable training with fast convergence. QVF does not rely on classical post-processing--in contrast to the previous QINR learning approach--and directly employs measurements to extract learned signals encoded in the ansatz. Experiments on a quantum hardware simulator demonstrate that QVF outperforms existing quantum approach and competes widely used classical foundational baselines in terms of visual representation accuracy across various metrics and model characteristics. We also show applications of QVF in 2D and 3D field completion and 3D shape interpolation, highlighting its practical potential.

As the economic and environmental costs of training and deploying large vision or language models increase dramatically, analog in-memory computing (AIMC) emerges as a promising energy-efficient solution. However, the training perspective, especially its training dynamics, is underexplored. In AIMC hardware, the trainable weights are represented by the conductance of resistive elements and updated using consecutive electrical pulses. While the conductance changes by a constant in response to each pulse, in reality, the change is scaled by asymmetric and non-linear response functions, leading to a non-ideal training dynamics. This paper provides a theoretical foundation for gradient-based training on AIMC hardware with nonideal response functions.

Computing Nash equilibria of zero-sum games in classical and quantum settings is extensively studied. For general-sum games, computing Nash equilibria is PPAD-hard and the computing of a more general concept called correlated equilibria has been widely explored in game theory. In this paper, we initiate the study of quantum algorithms for computing $\varepsilon$-approximate correlated equilibria (CE) and coarse correlated equilibria (CCE) in multi-player normal-form games. Our approach utilizes quantum improvements to the multi-scale Multiplicative Weight Update (MWU) method for CE calculations, achieving a query complexity of $\tilde{O}(m\sqrt{n})$ for fixed $\varepsilon$. For CCE, we extend techniques from quantum algorithms for zero-sum games to multi-player settings, achieving query complexity $\tilde{O}(m\sqrt{n}/\varepsilon^{2.5})$. Both algorithms demonstrate a near-optimal scaling in the number of players $m$ and actions $n$, as confirmed by our quantum query lower bounds.

The parameter size of modern large language models (LLMs) can be scaled up to the trillion-level via the sparsely-activated Mixture-of-Experts (MoE) technique to avoid excessive increase of the computational costs. To further improve training efficiency, pipelining computation and communication has become a promising solution for distributed MoE training. However, existing work primarily focuses on scheduling tasks within the MoE layer, such as expert computing and all-to-all (A2A) communication, while neglecting other key operations including multi-head attention (MHA) computing, gating, and all-reduce communication. In this paper, we propose FlowMoE, a scalable framework for scheduling multi-type task pipelines.

Quantum computing is an emerging field recognized for the significant speedup it offers over classical computing through quantum algorithms. However, designing and implementing quantum algorithms pose challenges due to the complex nature of quantum mechanics and the necessity for precise control over quantum states. Despite the significant advancements in AI, there has been a lack of datasets specifically tailored for this purpose. In this work, we introduce QCircuitBench, the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms in the form of quantum circuit codes. Unlike using AI for writing traditional codes, this task is fundamentally more complicated due to highly flexible design space. Our key contributions include: 1. A general framework which formulates the key features of quantum algorithm design task for Large Language Models.2. Implementation for quantum algorithms from basic primitives to advanced applications, spanning 3 task suites, 25 algorithms, and 120,290 data points.3.