New Method for Characterizing Large-Scale Quantum Systems

Researchers have developed a new method, called Error Per Circuit Layer (EPCL), to evaluate the performance of large-scale quantum systems. This approach is a significant milestone because it allows measuring the accumulated effect of noise in quantum operations without the need for costly classical simulations or structured gate sets, making it compatible with a wide variety of quantum architectures, including those with non-Clifford gates. EPCL works by applying identical random circuits to two disjoint quantum registers and measuring the overlap between their output states as a function of circuit depth. The decay of this overlap provides an estimate of the effective layer polarization. Unlike other benchmarking methods, EPCL avoids the need for classically simulating ideal output distributions or recovering a known reference state, which significantly simplifies the characterization process. Numerical simulations have shown that EPCL recovers the predicted polarization under weak local stochastic noise and remains well-described by a single-exponential decay even at stronger stochastic noise levels. Coherent errors associated with fixed entangling layers may require techniques such as Pauli twirling or randomized compiling to produce the expected decay. Experiments conducted on IBM quantum hardware with 8- and 16-qubit implementations have demonstrated clear EPCL decay, validating its utility for measuring aggregate register performance without the limitations of previous methods.

Verifiable Quantum Advantage with Extremely Low-Depth Circuits

Researchers have demonstrated verifiable quantum advantage using extremely low-depth quantum circuits. They have designed a sampling problem that can be solved by these shallow circuits, yet is computationally hard for classical polynomial-time algorithms, based on lattice assumptions. The quantum solution is, furthermore, efficiently verifiable by a classical computer. This advance is significant because it shows that even very simple quantum circuits possess the necessary structure to tackle computational tasks that are intractable for classical computing, and whose results can be efficiently confirmed. The proposed quantum sampler can be implemented in two ways: one uses log-logarithmic-depth quantum circuits with one- and two-qubit gates (QNC^0[log log] circuits), and the other employs constant-depth quantum circuits with unbounded fan-in gates (QAC^0 circuits). This work builds upon the LWE (Learning with Errors)-based single-round proof of quantumness by Arabadjieva et al. (2025), but compiles it to a much lower depth. The price paid for this compilation is the reliance on less standard, though well-motivated, assumptions: in addition to the lattice knowledge assumption, a strengthened variant of the adaptive-hardcore-bit property of LWE is required, for which the authors provide supporting evidence. Unlike previous low-depth proofs of quantumness, the quantum computation here requires no mid-circuit measurements or feed-forward. It consists only of running a shallow circuit and sampling from its output distribution. This simplifies implementation and reduces the complexity of the quantum devices needed. This finding underscores the potential of shallow quantum circuits to solve hard computational problems, opening new avenues for the development of quantum computing with more modest hardware requirements.

New Rydberg Quantum Logic Gate with Dynamic Population Suppression

Researchers have developed a new two-qubit quantum logic gate based on Rydberg atoms that operates in a single step, significantly simplifying the process. This advance addresses a key challenge in quantum computing: the fidelity and speed of gate operations. The technique introduces a dynamic population suppression method that mitigates decoherence and losses associated with long-lived Rydberg states, allowing for greater robustness in qubit manipulation. Rydberg gates are fundamental for neutral-atom quantum computers, but their implementation often requires complex sequences of laser pulses. This new approach uses a single pulse that excites atoms to a Rydberg state in a controlled manner, avoiding unwanted transitions that can degrade coherence. Dynamic population suppression is achieved by temporally modulating laser fields, allowing atoms to pass through the Rydberg state efficiently without remaining in it for an extended period, thereby reducing the probability of errors. This method not only simplifies gate operation but also promises to improve the scalability of neutral-atom-based quantum processors. By reducing the complexity of control pulses and minimizing exposure to decoherence, it opens the door to creating larger and more reliable quantum circuits. The ability to perform high-fidelity gate operations in a single step is an important step towards building a fault-tolerant quantum computer.

New Neural Network Decoder Improves Concatenated Quantum Codes

Researchers have developed a new neural network-based decoder for concatenated quantum codes, a key strategy for error correction in quantum computing. This method, which uses a neural message-passing framework, allows "soft beliefs" to propagate bidirectionally across concatenation levels, while lightweight neural networks learn only to aggregate incoming messages. This approach promises to significantly improve fault tolerance in future quantum computers. Tested on the concatenated [[15,7,3]] quantum Hamming code, the decoder achieved substantially higher error thresholds than state-of-the-art bidirectional hard-decision decoders. Specifically, the depolarizing pseudo-threshold nearly doubled, from 6.5% to 12.3%. This advance is crucial because concatenated quantum codes are fundamental for building fault-tolerant quantum computers, where inherent qubit errors must be efficiently corrected. For many-hypercube codes, a decoder fine-tuned on circuit-level errors in Knill's teleportation-based error correction achieved lower logical-CNOT failure rates than dedicated decoders. This was accomplished using a fixed number of message-passing iterations, in contrast to the extensive combinatorial search required by other methods. This new framework provides a generic tool for exploring the design space of concatenated codes, including non-CSS constructions, paving the way for low-overhead fault tolerance.

Enhanced Optical Readout and Control of Nuclear Spin Qubits

A team of researchers has achieved a significant breakthrough in the control and readout of nuclear spin qubits, a key component for quantum computing. The study, published in Nature, demonstrates a method that uses optical cavities to enhance the interaction between light and nuclear spins, enabling more efficient manipulation and detection of these qubits. This development is crucial because nuclear spins offer exceptionally long coherence times, making them promising candidates for quantum information storage. Traditionally, the weak interaction of nuclear spins with their environment, while beneficial for coherence, makes their readout and control challenging. The new approach overcomes this limitation by integrating nuclear spin qubits into a high-quality optical cavity. This cavity amplifies the optical signal emitted or absorbed by the spin, facilitating its detection. Furthermore, the enhanced interaction allows for more precise control of the spin's quantum state using light pulses, opening new avenues for coherent manipulation of these systems. This advance has important implications for the development of robust quantum computers. The ability to efficiently read out and control nuclear spin qubits could enable the construction of quantum architectures with higher fidelity and scalability. Although still at a fundamental research stage, this work lays a solid foundation for future explorations in nuclear spin-based quantum computing, as well as for the development of high-precision quantum sensors.

Efficient Quantum Simulations of Yang-Mills Theory

A new quantum algorithmic framework promises efficient simulation of Yang-Mills theories, including SU(3) gauge theory in Quantum Chromodynamics (QCD). This breakthrough addresses one of the biggest challenges in theoretical physics: simulating fundamental particle interactions that are too complex for classical computers, especially in non-perturbative regimes. The method's key lies in using the maximal-tree gauge choice, which removes local redundancies in gauge field variables, significantly simplifying the problem. The resulting gauge-fixed formulation, with digitization in the field-amplitude basis, allows for efficient implementation of Hamiltonian time evolution via quantum singular value transformation (QSVT). This technique is crucial for ensuring that complex calculations can be performed with limited quantum resources. Researchers have derived upper bounds on the total number of qubits and gate complexity, showing polynomial scaling with the inverse simulation precision (1/εs), lattice volume (V), gauge coupling (g), and target energy scale (E). These results provide a rigorous complexity-theoretic demonstration that non-Abelian Yang-Mills theories can be efficiently simulated on quantum computers. This paves the way for first-principles quantum simulations of non-perturbative QCD dynamics, a fundamental area for understanding the structure of protons and neutrons, as well as nuclear matter under extreme conditions. The work represents a significant step towards solving long-standing problems in particle physics using quantum computing.

Fundamental Assumption on Entanglement of Formation Refuted

Researchers have demonstrated that a widely accepted assumption in quantum information theory, concerning the existence of supporting affine functionals for the Entanglement of Formation (EoF), is not always valid. This assumption stated that, for any quantum state of a bipartite system, a global supporting affine functional always exists. However, the new work presents an explicit counterexample that invalidates this belief, even for the simplest case of two entangled qubits. The Entanglement of Formation (EoF) is a crucial measure of quantum entanglement, quantifying the minimum amount of entanglement needed to prepare a given state. The existence of a global supporting affine functional would imply that the EoF behaves 'smoothly' across the entire state space, facilitating its analysis and calculation. The refutation of this assumption has significant implications for the theoretical understanding of entanglement and for the development of methods for its quantification. The counterexample is based on the equivalence between the existence of a supporting affine functional and the Lipschitz lower semicontinuity of the EoF at a given state. Using Wootters' formula, the authors constructed a degenerate state for which this semicontinuity property does not hold. This finding demonstrates that the convex roof structure of the EoF and the finite dimensionality of the subsystems do not, by themselves, guarantee the existence of such functionals. The study also describes the conditions under which local and global supporting affine functionals do exist for both finite and infinite-dimensional bipartite quantum systems, and establishes Lipschitz lower semicontinuity bounds for finite-rank states.

Acoustic protection for electron spins in quantum dots

Researchers have developed a technique to protect electron spins in semiconductor quantum dots from phonon-induced decoherence. This advancement is crucial for the development of spin-based quantum computers, as qubit stability is a fundamental challenge. The ability to control and maintain spin coherence is essential for performing reliable quantum operations. The method involves creating an energy gap in the phonon spectrum around the electron spin's Larmor frequency. This is achieved by engineering a phonon nanostructure, essentially a structure that acts as an acoustic barrier, preventing phonons with specific energies from interacting with the spin. By suppressing the spin-phonon interaction, the decoherence rate is significantly reduced. Experiments demonstrated that this acoustic protection extends the electron spin coherence time, a critical parameter for quantum computing. This technique opens new avenues for improving the robustness of spin qubits and could be applicable to other quantum systems where interaction with the acoustic environment is a dominant source of decoherence. The next step will be to integrate this protection into more complex qubit architectures and explore its scalability.

Steerability of Rank-2 Two-Qubit Entangled States Explored

Scientists have investigated the 'steerability' of rank-2 two-qubit entangled states, a fundamental concept in quantum mechanics that describes the ability to influence the state of one part of an entangled system by performing measurements on the other part, without classical communication. This study focuses on a specific class of quantum states that, while not the most general, are of significant theoretical and experimental relevance in the development of quantum technologies. Steerability is a form of quantum entanglement that lies between separability (absence of entanglement) and Bell nonlocality. Unlike nonlocality, which requires the violation of Bell inequalities, steerability can be demonstrated even when these inequalities are not violated, making it a weaker but more ubiquitous property. The research aims to better understand the conditions under which this property manifests and how it can be used in practical applications, such as quantum cryptography or distributed quantum computing. The work has explored the properties of these rank-2 states, which are those that can be represented with a density matrix of maximum rank 2. Although the original text does not detail the specific methods, the nature of the research suggests a theoretical-mathematical approach, possibly complemented by simulations, to characterize the limits and conditions of steerability. Understanding these states is crucial for optimizing quantum protocols that rely on the precise manipulation of entangled information. This advance contributes to the theoretical framework of quantum information, offering a deeper understanding of the properties of entanglement. Practical implications include the design of more secure and efficient quantum communication protocols, as well as the development of new architectures for quantum computing. Future research could focus on extending these results to systems with more qubits or on the experimental implementation of protocols based on the steerability of rank-2 states.

Unitary operator bases for universal averaging in quantum computing

Researchers have developed a new method to simplify the process of universal averaging in quantum systems, a crucial step for device characterization and verification. This advance is based on the construction of unitary operator bases that act as reduced-size averaging sets, achieving the same results as traditional methods that require a significantly larger number of operators. The efficiency of this approach lies in its ability to reduce the computational and experimental complexity associated with evaluating average properties of quantum states or channels. Universal averaging is a fundamental technique in quantum metrology and quantum computing, used to characterize operation fidelity, detect errors, and verify system coherence. Traditionally, this involves averaging over a very large set of unitary operators, which can be prohibitively resource-intensive. The new proposal introduces a minimal set of unitary operators that, when applied and averaged, replicate the effect of full universal averaging, but with a fraction of the effort required. This is particularly relevant for the scalability of current and future quantum processors. The construction of these optimized unitary operator bases allows for faster and more efficient characterization of quantum components, such as qubits and logic gates. By reducing the number of measurements and operations needed, the impact of decoherence and experimental errors is minimized, leading to a more precise evaluation of quantum device performance. This method not only accelerates the development and validation of quantum hardware but also opens doors to new strategies for error mitigation and the engineering of more robust quantum systems.

Sequential preparation and measurement of multiple qubits via a single channel

Researchers have developed an innovative method for the sequential preparation and measurement of multiple qubits using a single control channel. This technique, which addresses a critical bottleneck in the scalability of quantum computers, allows for the individual manipulation and readout of several qubits without the need for a dedicated control and measurement channel for each one. This advance is crucial for overcoming the interconnection and hardware complexity limitations that arise when increasing the number of qubits in a quantum processor. Traditionally, each qubit in a quantum system requires its own set of control and readout lines, leading to a wiring and electronics complexity that grows linearly with the number of qubits. This new approach uses a time-multiplexing scheme, where the same physical channel is shared among different qubits at different times. By applying carefully sequenced microwave pulses and detecting individual responses, the system can prepare a qubit in a desired state and then measure its final state, before moving on to the next qubit in the sequence. The implementation of this method was carried out on a superconducting chip, a type of architecture commonly used in quantum computing. Experimental results demonstrate the feasibility and high fidelity of individual state preparation and measurement for multiple qubits. This achievement represents a significant step towards building large-scale quantum computers, by drastically reducing hardware requirements and simplifying the design of the cryoelectronics needed to operate these systems at very low temperatures. The ability to efficiently control and read qubits with fewer resources is fundamental for the future development of quantum computing.

Sample-efficient quantum error mitigation via classical learning

A new study has demonstrated a technique for mitigating errors in quantum computers using classical learning surrogates. This method, published in Nature, addresses one of the biggest challenges in quantum computing: the fragility of qubits and their susceptibility to decoherence and other errors. Error mitigation is crucial for extracting reliable results from current quantum processors, which have not yet achieved full fault tolerance. The technique relies on training classical models to predict the behavior of quantum circuits under different error regimes. By using these surrogate models, researchers can significantly reduce the number of quantum executions required to characterize and correct errors. This is particularly valuable in the era of noisy intermediate-scale quantum (NISQ) devices, where each quantum operation is costly in terms of time and resources. The results show that this classical learning approach can improve the accuracy of quantum computations with significantly higher sampling efficiency than traditional error mitigation methods. The ability to obtain more precise results with fewer quantum computational resources represents an important step towards the realization of practical quantum applications and the exploration of complex problems beyond the reach of classical supercomputers.

Perfect Impedance Matching Unlocks Sensitive RF Reflectometry in 2D Material Quantum Dots

Scientists have achieved high-sensitivity radio-frequency (RF) reflectometry in quantum dots fabricated from two-dimensional (2D) materials. The breakthrough hinges on a near-perfect impedance matching technique, enabling efficient detection of the minute capacitance changes associated with electron occupation in these nanodevices. This method opens new avenues for the characterization and control of quantum dots in 2D material platforms, which is crucial for the development of quantum computing and quantum sensing. RF reflectometry is a non-invasive method for probing the electronic properties of quantum dots. Traditionally, its application to 2D material quantum dots has been limited by a low signal-to-noise ratio, due to the small capacitance of these devices and the difficulty in achieving efficient impedance matching. The research team overcame this challenge by designing an optimized resonant circuit that maximizes power transfer between the quantum dot and the readout system, achieving near-perfect impedance matching. This allows for the detection of single-electron occupation changes with unprecedented sensitivity. This advance is significant because quantum dots in 2D materials, such as graphene or transition metal dichalcogenides, offer unique properties for quantum computing, including potentially long coherence times and strong spin-orbit interaction. The ability to precisely characterize and control these quantum dots through high-sensitivity RF reflectometry is a fundamental step towards their integration into scalable qubit architectures. The results suggest a promising path for exploring quantum phenomena in 2D systems and developing robust quantum technologies.

Three-qubit entanglement generated in Bethe-Heitler process

Scientists have demonstrated that the Bethe-Heitler process, a fundamental interaction in particle physics, can be utilized as a laboratory to generate and study multiparticle quantum entanglement. This work transforms a known process of photon radiation by an electron scattering off a proton ($e+p\to e+p+\gamma$) into a platform for investigating complex quantum states. The research focused on how bipartite and genuine tripartite entanglement is built up between the final state electron, proton, and photon resulting from the interaction. This entanglement emerges through a series of elementary $1\to 2$ and $2\to 2$ interactions. The results, validated by event simulations, reveal the formation of specific entangled quantum states. Below a center-of-mass energy of 5 GeV, simulations identified more than 900 Greenberger-Horne-Zeilinger (GHZ) states and 1200 W states. The fidelity of these states exceeded 99%, indicating high quality of the generated entanglement. This finding is significant as it opens a new avenue for exploring quantum entanglement in a high-energy physics context, traditionally associated with particle production and the study of fundamental forces.

Quantum circuit iteration rate accelerated with neutral atoms

Researchers have achieved a significant advance in the performance of neutral-atom quantum processors, overcoming one of the main limitations for their practical application: the low quantum circuit iteration rate (qCIR). They have demonstrated a high-throughput system that integrates a chip-based photonic interface with a 10-qubit array, achieving non-destructive readout and atom reuse. This new approach allows for a retention probability of 99.7% after readout, which is crucial for maintaining qubit coherence. The system achieved a raw qCIR of 101 Hz and a post-selected qCIR of 74.8 Hz. These values represent a substantial improvement in the speed at which quantum circuits can be executed and repeated, a key factor for debugging, characterization, and the execution of complex algorithms. Furthermore, the study verified a general throughput optimization methodology, obtaining a normalized Fisher information rate of 57.7 Hz. This represents an improvement of more than an order of magnitude in throughput compared to conventional methods. The ability to reuse atoms after non-destructive readout is a fundamental step towards more efficient and scalable quantum processors, opening a practical path for the development of high-performance neutral-atom quantum computers.

Approximate Quantum Fourier Transform with Linear Depth and Zero Ancilla Qubits

Researchers have developed a new algorithm for the approximate Quantum Fourier Transform (QFT) that significantly reduces resource requirements. This method achieves linear circuit depth, meaning the number of operations grows linearly with the number of qubits, and does so without the need for ancilla qubits. The QFT is a fundamental component in many quantum algorithms, including Shor's algorithm for factorization and the phase estimation algorithm, making improvements in its efficiency crucial for the development of fault-tolerant quantum computing. The main innovation of this work lies in combining QFT approximation with the elimination of ancilla qubits. Approximate QFT algorithms already existed, but often relied on omitting small phase rotations, which could compromise accuracy. This new approach maintains the required precision for many practical applications while optimizing the use of quantum resources, a critical aspect for current and future quantum devices with a limited number of qubits and finite coherence. The linear circuit depth is particularly relevant, as deeper circuits are more susceptible to noise and decoherence. The ability to execute an approximate QFT with linear depth and zero ancilla qubits opens new avenues for implementing complex quantum algorithms on existing hardware. This could accelerate research in areas such as quantum chemistry, materials science, and cryptography, where the QFT is an essential subroutine. Furthermore, by reducing circuit complexity, this advance contributes to the construction of more robust and scalable quantum computers, bringing us closer to the era of fault-tolerant quantum computing.

Efficient Quantum Simulation of Correlated Materials with DMFT

Scientists have achieved an efficient quantum implementation of Dynamical Mean Field Theory (DMFT), a crucial tool for studying strongly correlated materials. This breakthrough allows for more precise simulation of electron behavior in these materials, a significant challenge for condensed matter physics due to complex inter-particle interactions that cannot be adequately described by static mean-field theories or perturbation methods. DMFT transforms the many-body problem into a quantum impurity problem, which is then solved iteratively. The implementation is based on a quantum algorithm that maps the DMFT impurity problem to a quantum circuit, leveraging the capabilities of quantum computers to handle the inherent complexity of electronic interactions. This approach promises to overcome the limitations of classical methods, which often require drastic approximations or prohibitive computational resources for realistic system sizes. Efficiency is achieved through intelligent encoding of electronic states and interactions into qubits, allowing quantum hardware to explore the Hilbert space more effectively. This development is a significant step towards understanding and designing new materials with exotic properties, such as high-temperature superconductors, topological insulators, or materials with complex magnetism. By more faithfully simulating the underlying quantum phenomena, researchers can accelerate the discovery of materials with enhanced functionalities for technological applications. Furthermore, it validates the potential of quantum computing as an indispensable tool for theoretical and experimental condensed matter physics, opening new avenues for fundamental and applied research in this field.

Noise-Protected Logical Qubit in Superconducting Chain

Researchers have demonstrated the creation of a noise-protected logical qubit within an open chain of superconducting qubits. This breakthrough is crucial for quantum computing, as environmental noise is one of the biggest obstacles to maintaining qubit coherence. The implementation of logical qubits, which encode information in a larger, redundant state space, is a key strategy for quantum error correction and the scalability of quantum computers. The team utilized a chain of superconducting qubits with ultrastrong interactions, enabling precise manipulation and robust coupling between the elements. Noise protection was achieved through a specific encoding that distributes quantum information across multiple physical qubits, making the system less susceptible to local disturbances. This approach is promising for building more fault-tolerant quantum architectures, a fundamental requirement for achieving large-scale quantum computing. This achievement represents a significant step towards building reliable quantum computers. The ability to protect quantum information from environmental noise is essential for extending coherence times, which in turn allows for more complex and higher-fidelity quantum operations. Future steps will include demonstrating two-logical-qubit operations and scaling this architecture to a larger number of qubits.

New Unified Principle for Entanglement Harvesting

Researchers have proposed a unified physical principle for entanglement harvesting, a process by which two localized detectors can extract entanglement from a quantum field. This principle states that the amount of extractable entanglement is solely determined by the localization of the field's effective spectral density. This finding is crucial for understanding how quantum correlations, even those from the vacuum, can be leveraged by localized systems. The team demonstrated this principle using an analytically solvable model of two qubits coupled to a leaky single-mode cavity, which in turn interacts with a continuous electromagnetic bath. They derived a closed-form expression for the maximum harvestable concurrence, $\mathcal{C}_{\max}(Q)=2e^{-\pi/(2Q)}(1+e^{-\pi/(2Q)})/(1+3e^{-\pi/Q})$, where $Q$ is the ratio of the qubit-cavity detuning $\Delta$ to the cavity linewidth $\kappa$. This parameter $Q$ is proportional to the inverse participation ratio (IPR) of the effective spectral density, acting as the single dimensionless parameter governing the crossover from deterministic gate-based entanglement ($Q\to\infty$) to vacuum harvesting ($Q\to0$). In the high-$Q$ limit, the maximum concurrence approaches $1-\pi^{2}/(16Q^{2})$, indicating robustness of entanglement against cavity loss. Conversely, in the low-$Q$ limit, entanglement decays exponentially to zero, consistent with the irreversible-reservoir character of a continuous field, where maximal entanglement is unattainable. This conceptual framework not only quantifies the fraction of vacuum correlations accessible to localized detectors but also reveals a formal correspondence between maximal concurrence and IPR, analogous to the conductivity-participation-ratio relation in Anderson localization. The predicted $\mathcal{C}_{\max}(Q)$ curve is, in principle, directly observable in superconducting circuit QED experiments. This advance has significant implications for the design of quantum technologies, such as quantum computing and communication, by providing a theoretical basis for optimizing entanglement extraction in the presence of noisy and dissipative environments.

New Inductively Protected Andreev Spin Qubit

Scientists have developed a new type of Andreev spin qubit (ASQ) that significantly enhances its relaxation time. This advancement is achieved by shunting the ASQ with a linear inductor, which separates the spin-qubit states into distinct potential wells in phase space. This separation drastically reduces wavefunction overlap, a key factor in decoherence for spin qubits. The resulting qubit, termed the Inductively Protected Andreev (IPA) spin qubit, combines the advantages of protected superconducting qubits, such as long coherence times, a low-frequency ground-state manifold, and large anharmonicity, with the operational benefits of a spin degree of freedom. Essentially, the IPA qubit behaves as two fluxoniums in the heavy regime, one for each spin, suggesting inherent robustness against relaxation. Andreev spin qubits are based on the spin of a quasiparticle trapped in a quantum dot Josephson junction, a semiconductor-superconductor device where the interplay between a localized spin degree of freedom and superconductivity leads to a spin-resolved Josephson potential. Inductive protection represents a step forward in qubit engineering, addressing one of the fundamental challenges in quantum computing: decoherence. This development opens new avenues for creating more stable and coherent qubits, crucial for building large-scale quantum computers.

New Method Optimizes Distributed Quantum Circuits

Researchers have developed an asymptotically optimal method for synthesizing Clifford and CNOT circuits in distributed quantum architectures. This advancement is crucial for large-scale, fault-tolerant quantum computation, where combining many small, interconnected qubit sets may be more feasible than building a single massive system. The efficiency of these non-local operations is fundamental, as they often dominate the time and error budget in distributed quantum computing. The proposed method is based on block-matrix Gaussian elimination and is applicable even when local and non-local connectivity is arbitrarily restricted. Furthermore, the authors have extended this technique to include all Clifford+RZ circuits by generalizing the Pauli exponential circuit representation. This extension naturally integrates with existing methods for optimizing T-count, a key factor in the efficiency of quantum algorithms. As a practical application, the study demonstrates how to implement CNOT circuits in a CSS code encoding for n logical qubits in k blocks. This is achieved using O(nk) inter-block transversal CNOT operations and intra-block Pauli measurements. This approach enables a more efficient construction of complex quantum systems, minimizing costly communication operations between different qubit modules.

Optical Signatures and Quantum Geometry in Proximity-Induced Topological Superconductors

Researchers have discovered distinctive optical signatures and the influence of quantum geometry in proximity-induced topological superconductors. This breakthrough is crucial for understanding the fundamental properties of these materials, which hold promise for quantum computing and other advanced technologies. Quantum geometry, which describes how a material's quantum properties intertwine with its geometric structure, plays an unexpected and significant role in the optical response of these systems. This work focuses on the interaction between a conventional superconductor and a topological material, where proximity induces superconducting properties in the latter. This approach allows for the exploration of exotic states of matter, such as Majorana fermions, which are their own antiparticles and are considered building blocks for topological qubits. The ability to observe these optical signatures opens new avenues for characterizing and manipulating these states, overcoming limitations of previous methods that often required more restrictive experimental conditions or were less sensitive to the underlying geometric properties. The scientists employed advanced spectroscopic techniques to probe the optical response of the materials. These techniques enabled the identification of specific electronic transitions directly linked to the material's topology and its quantum geometry. Experimental results, supported by theoretical simulations, revealed how Berry curvature and other quantum geometric properties influence light absorption and emission, providing a unique fingerprint for these topological states. This discovery not only deepens our understanding of topological superconductors but also offers a new, non-invasive method for their characterization. Implications range from the development of more robust quantum devices to the exploration of new phases of matter with exotic properties. Future research will focus on optimizing proximity induction and searching for materials with even more pronounced quantum geometries to enhance these optical signatures, which could accelerate the path towards fault-tolerant quantum computing.

Non-Abelian Fractional Quantum Hall States Created on Quantum Processors

Researchers have successfully prepared non-Abelian Fractional Quantum Hall (FQH) states on a programmable quantum processor. These exotic states, which host excitations known as non-Abelian anyons, are of significant interest for topological quantum computing but have proven extremely elusive to generate on conventional platforms. Surprisingly, the study demonstrates that the more complex non-Abelian FQH states are, in fact, less costly to prepare on quantum hardware than more common Abelian states, such as the Laughlin state. The key breakthrough lies in a new systematic framework that enables the cataloging and preparation of a wide variety of FQH states on quantum circuits. This approach has allowed for the creation of a parafermionic Read-Rezayi Z_3 state with a circuit depth of only 3, scaling from 8 to 118 qubits. Furthermore, full root sampling has been extended to a 154-qubit, 104-electron Read-Rezayi Z_4 state. In total, the catalog of prepared FQH states spans 18 families and has been implemented on all 156 qubits of an IBM Heron processor, limited only by existing hardware scale. Measurements performed on the prepared states confirm the expected fractional quasihole charges, with the charge estimator being exact in every symmetry-selected shot for the clustered states. Braiding data for the non-Abelian e/4 quasihole was also obtained via interferometric extensions. This work establishes a scalable route for studying FQH physics on quantum processors and opens new avenues for preparing and probing non-Abelian topological matter, extending far beyond the reach of conventional platforms.

Fast Quantum Interconnects Developed Using Neutral Atoms

Researchers have proposed a new method to generate remote quantum entanglement at rates approaching those of two-qubit gates in neutral-atom quantum processors. This breakthrough is crucial for the development of scalable quantum computers, as efficient distribution of entanglement between distant qubits is a fundamental requirement for building quantum networks. The approach relies on strong dipole-dipole interactions between atomic Rydberg states to generate entanglement between stationary qubits and propagating photons, without the need for an optical cavity. This methodology simplifies the experimental design and opens the door to greater scalability. The authors have thoroughly described the optimal conditions for this entanglement-generation protocol, considering realistic experimental parameters. The research results indicate that entanglement generation rates exceeding 3 × 10^5 s⁻¹ can be achieved using Rydberg states of ytterbium atoms. This speed is significantly high and comparable with the internal operations of current neutral-atom processors. The inherent scalability and design flexibility of this quantum interconnect position it as a promising avenue for building distributed networks based on neutral-atom quantum architectures.

Quantum Advantage Demonstrated in Star-Network Communication

Researchers have quantified the advantage of quantum communication over classical communication in star-network topologies. They designed an exclusion task that can be perfectly solved using quantum $d$-level systems (qudits), whereas a classical solution would require a large message. This work establishes a lower bound on the classical simulation cost of certain quantum correlations, highlighting that quantum communication can significantly outperform classical communication in specific scenarios. The study focuses on a scenario where multiple parties each send a quantum system to a central node for a joint measurement. The proposed exclusion task cannot be solved with certainty if each of the $n$ parties sends a classical message with fewer than $n^{(d-1)}$ symbols. This result implies an exponential advantage for quantum messages, scaling with both the dimension of the quantum system ($d$) and the number of simultaneously measured systems ($n$). This finding has significant implications for understanding quantum correlations and communication complexity. For instance, it shows that no finite-size classical description of a qubit suffices to reproduce the statistics of a joint measurement on sufficiently many qubits. This underscores the intrinsically non-classical nature of certain quantum properties and their potential to surpass classical information processing capabilities.

First Unitary Encoder for Quantum Surface Codes

Researchers have developed the first unitary encoder capable of preparing quantum states in surface codes, a promising type of quantum error correction code. This breakthrough represents a crucial step towards building fault-tolerant quantum computers, as robust encoding of quantum information is fundamental to overcome the inherent fragility of qubits. Surface codes are a topological error correction scheme that encodes a logical qubit into a lattice of physical qubits, protecting it from errors through geometric properties. However, the initial preparation of logical states in these codes has been a significant challenge. Previous methods required destructive measurements or interaction with an auxiliary qubit, introducing complexity and potential sources of error. The new unitary encoder avoids these issues by performing encoding through a sequence of quantum operations that preserve the system's coherence. This unitary encoder is an important advance because it allows the initialization of logical qubits in surface codes without destroying information or requiring additional auxiliary qubit resources. The ability to prepare logical states coherently and efficiently is essential for any quantum computing architecture aiming for fault tolerance. While large-scale quantum computers are still a distant prospect, innovations like this in error correction infrastructure are the building blocks upon which the future of quantum computing will be constructed.

Quantum heat transport models in circuits yield identical results

Researchers have compared two prominent theoretical approaches for describing heat transport by thermal microwave photons in quantum circuits, finding that both models produce identical results under certain conditions. The models analyzed are the weak-coupling Lindblad master equation and a circuit model incorporating thermal Johnson-Nyquist noise. This agreement validates the application of the Lindblad equation for analyzing heat transport in complex quantum circuits, including those with qubits or nonlinear resonators. The first model, based on the weak-coupling Lindblad master equation, determines transition rates via Fermi's golden rule, driven by thermal dissipation sources. The second approach, the circuit model, describes how thermal Johnson-Nyquist noise generated by dissipative elements induces currents and, consequently, Joule power in other parts of the circuit. This latter leads to a Landauer-type expression for heat transport, where the transmission coefficient is proportional to the circuit's transconductance. The comparison revealed that, for a linear circuit in the weak-coupling limit, both models yield identical analytical expressions for the transported power. This finding was demonstrated in an archetypal circuit where a cavity mediates heat transport between two thermal baths. This analysis not only provides a quantitative assessment of the range of validity of the weak-coupling assumption in a circuit but also reinforces confidence in the applicability of the weak-coupling Lindblad model for more complex quantum systems.

Efficient Logical Computation in High-Rate Quantum Codes

Researchers have developed a method for performing fault-tolerant logical computation on high-rate quantum low-density parity-check (qLDPC) codes. These codes are promising for quantum computing because they allow encoding many logical qubits with a relatively low overhead of physical qubits. However, implementing efficient and certifiable logical operations on these dense encodings has been a significant challenge until now. The key to the advance lies in co-designing the code and its logical instruction set, exploiting the inherent structure of a family of canonical lifted-product (LP) codes with cyclic symmetry. The team identified a "canonical logical basis" in these codes, where conjugate logical operators are organized into cyclic orbits, a feature analogous to what makes hypergraph-product codes manageable. This canonical basis enables a complete logical instruction set. This includes constant-depth Clifford gates, modular code surgeries built from a constant number of reusable seed gadgets, highly parallel logical Pauli-product measurements, and parallel magic-state injection. For instance, a [[1122,148,≤20]] type LP code requires only two surgery gadgets, while a [[4350,1224,≤20]] code needs four. These capabilities are achieved using a compact canonical extractor, which is smaller than half of the data code block for arbitrary high-weight logical measurements. This approach overcomes the limitations of generic techniques, which are often difficult to modularize and certify on complex, high-rate codes. The results obtained represent a significant step towards fault-tolerant quantum computation on ultra-high-rate quantum architectures, opening new avenues for the development of more robust and scalable quantum computers.

Robust Quantum State Certification Using Pauli Measurements

Researchers have developed a method to robustly verify whether an unknown $n$-qubit quantum state, $\rho$, is $\varepsilon$-close or $O(\varepsilon)$-far from an ideal target state $|\psi\rangle$. This advance is significant for quantum computing, where the reliability of quantum states is crucial. The protocol employs non-adaptive single-qubit Pauli measurements, which considerably simplifies the certification process compared to methods requiring complex joint measurements. The method is applicable to most target states, excluding only a $2^{-\Omega(n)}$ fraction. To achieve a confidence of $1-\delta$, the test requires $O(\varepsilon^{-2}\log(1/\delta))$ copies of the state $\rho$. This number of copies is information-theoretically optimal, even if protocols with arbitrary joint measurements were allowed. The efficiency of the method makes it practical for the characterization of quantum devices. The core technical innovation behind this protocol is a generalized uncertainty principle for weighted total influences of Boolean functions. As a simple example, the unweighted variant states that $\mathbf{Inf}[f]+\mathbf{Inf}[\widehat{f}] = \Omega(n)$, which is a natural hypercube analogue of the Heisenberg uncertainty principle, where $\widehat{\cdot}$ denotes the $2^{-n/2}$-normalized Fourier transform. The weighted case extends $\mathbf{Inf}[\cdot]$ and $\mathbf{Inf}[\widehat{\cdot}]$ to Dirichlet energies associated with Glauber dynamics for certain dual measures on the cube. This theoretical framework provides a solid foundation for the robustness of the certification protocol.

MacWilliams Transforms Unified by Spin Kinematics

A new study has revealed that the various MacWilliams transforms, fundamental in classical and quantum error-correcting code theory, can be derived from a single unified perspective based on spin kinematics. Researchers have demonstrated that these transforms, which relate the weight enumerators of a code and its dual, naturally emerge as Wigner-$D$ rotations between two canonical bases. This approach simplifies the understanding of the relationship between these transforms and highlights a common underlying principle, regardless of whether the code is classical or quantum, and whether it applies to qubits or qudits. The key to this unification lies in splitting errors into trivial and nontrivial categories. From this fundamental distinction, spin kinematics provides the framework for deriving the MacWilliams transforms. A notable finding is that, within each theory (classical or quantum), the code length $n$ does not alter the underlying rotation; the same rotational element simply reappears for a spin of $n/2$. This suggests a deep connection between the structure of codes and the fundamental properties of spin. Furthermore, the study indicates that choosing the rotation axis, while keeping $n$ fixed, allows transitioning between different classical and quantum theories. This not only provides a more coherent view of existing transforms but could also open avenues for developing new transforms or understanding their properties in emerging contexts. Identifying spin as the "hidden engine" behind these transforms is a significant conceptual advance that could impact the design and analysis of codes in quantum computing and communications.

Fault-Tolerant Logical Operations in Modular Quantum Architectures

Researchers have explored modular quantum computing, a promising approach to scale quantum computers beyond the limitations of monolithic devices. In this paradigm, multiple quantum processing units (QPUs) are interconnected via shared entanglement. The study focused on how errors at module interfaces and within individual QPUs affect fault-tolerant computation, using the rotated surface code for qubit encoding. This work goes beyond the logical-memory benchmark, simulating circuit-level fault-tolerant nonlocal CNOT gates implemented via lattice surgery between QPUs connected by noisy Bell pairs, and analyzing the resulting logical error rates. The results indicate that interfaces can tolerate noise up to an order of magnitude higher than intra-QPU noise, with only a minor reduction in the fault-tolerance threshold. This suggests unexpected robustness in inter-module connections. Furthermore, an efficient protocol has been developed for the distributed preparation of fault-tolerant logical GHZ states, reducing ancilla overhead, operation time, and nonlocal Bell-pair consumption. Ancilla minimization in this setting is equated to a vertex-cover problem on an associated graph, for which a polynomial-time heuristic algorithm is introduced to find low-overhead solutions. These findings provide quantitative evidence that distributed quantum error correction can enable scalable, fault-tolerant quantum computation in modular architectures. This advance is crucial for the development of large-scale quantum computers, as it addresses one of the main challenges: managing noise in complex, distributed systems. The ability to effectively interconnect noisy QPUs opens new avenues for the design and implementation of future quantum processors.

DOE has driven quantum research since 1985

The U.S. Department of Energy (DOE) has played a fundamental role in the development of current quantum technology, through its continuous support for basic research since 1985. This long-term investment has laid the groundwork for contemporary advances in fields such as quantum computing and quantum sensors, demonstrating the importance of sustained funding in fundamental science. Although the original text is concise, it highlights that the evolution of superconducting qubits and other quantum technologies is not a recent phenomenon, but rather the result of decades of work and funding. The initial support from the DOE allowed for the exploration of theoretical principles and physical phenomena that, at the time, might have seemed abstract, but which over time have matured into the foundation of a new technological era.

Bidirectional Quantum Analog-to-Digital Converter for Photons

Researchers have experimentally demonstrated the first bidirectional quantum analog-to-digital converter (QADC), capable of transforming a photon's properties, such as its wavefront, into discrete qubits and vice versa. This breakthrough is crucial for integrating continuous quantum signals, like light, with qubit-based quantum information processing systems, which operate with discrete states. The ability to encode and decode information between these two domains opens new avenues for hybrid quantum computing and communication. The developed device employs a novel approach for conversion, allowing information encoded in a photon's spatial wavefront to be mapped onto qubit states, and for qubit states to be transformed back into wavefront patterns. This was achieved through precise manipulation of the photons' quantum properties, leveraging phenomena such as entanglement and superposition. Bidirectionality is a key feature, as most prior efforts have focused on unidirectional conversions or less versatile systems. This QADC has significant implications for the development of quantum networks and quantum computers. By enabling an efficient interface between continuous quantum information (such as that transmitted by photons in optical fibers) and discrete quantum information (processed by qubits), it facilitates the construction of hybrid quantum architectures. These architectures could combine the advantages of long-range photonic communication with the robustness of qubit processing, overcoming some of the current limitations of each technology separately.

Optimizing Fault-Tolerant Quantum State Preparation

Researchers have developed a new method to optimize stabilizer state preparation in fault-tolerant quantum computing. This technique, based on integer linear programming (ILP) and the circuit gauge operator formalism, enables the construction of circuits with an equal or lower gate count than current methods, while detecting up to three errors. Efficient preparation of these states is crucial for logical qubit initialization and for logical-ancilla-based error correction gadgets, such as Steane and Knill codes, leading to reduced solution time and increased reliability of quantum computers. Traditionally, for small, low-distance codes like the [[7, 1, 3]] Steane code, circuits with low gate counts could be designed by inspection. However, this approach becomes impractical for larger codes, necessitating automation. Current state-of-the-art methods for automated fault-tolerant state preparation include SAT-based stabilizer measurement and the flag-at-origin technique. The new approach enhances these methodologies by reformulating the construction of flag circuits as an integer linear programming problem, leveraging the circuit gauge operator formalism. As a proof of concept, the technique was applied to derive a Steane error correction gadget for the [[24, 10, 4]] two-block group algebra code. This gadget was tested on Quantinuum's System Model H2 quantum computer, using 10,000 shots. The results showed a logical block error rate of approximately 0.00014 (or 0.000014 per logical qubit), with about 1.6% of the shots post-selected due to weight-two errors. These findings demonstrate the effectiveness of the proposed method in improving the robustness of quantum operations.

Pareto front engineering of dynamical sweet spots in superconducting qubits

Researchers have developed a methodology based on Pareto front engineering to optimize the performance of superconducting qubits. This approach allows for the identification of design configurations that maximize coherence and minimize noise sensitivity, two crucial parameters for quantum computing. The technique addresses the challenge of balancing multiple conflicting properties in qubit design, searching for so-called "dynamic sweet spots" where the device is inherently more robust against environmental fluctuations.

Roadmap for Neutral Atom Quantum Computing

A new strategic plan outlines pathways to achieve practical quantum advantage using neutral atom-based processors. This document, which merges hardware development with theoretical advancements, addresses the definition and verification of quantum advantage, as well as the design of algorithms capable of delivering it. The proposal emphasizes the importance of scaling system size, improving qubit encodings, and exploring atomic platforms beyond current performance thresholds. Future directions for neutral atom quantum processor hardware include continuous qubit reloading and fast readout. Opportunities offered by scalable integrated photonic control technologies are also explored. These hardware advancements are complemented by the need to develop new quantum error correction techniques and quantum circuit compilation, crucial elements for system reliability and efficiency. The plan also considers the possibility of networking multiple neutral atom quantum processors to form a distributed quantum computing network. This strategy aims to overcome the inherent limitations of individual systems and open new possibilities for solving complex problems. Collaboration between hardware and theory is fundamental to realizing the potential of this technology in quantum computing.

Entanglement-enhanced learning of quantum processes at scale

Scientists have demonstrated a method to characterize complex quantum processes more efficiently using quantum entanglement. This advance is crucial for the development of quantum computing, as precise characterization of operations is fundamental for building and verifying large-scale quantum processors. The technique allows for faster and less resource-intensive evaluation of quantum devices, which could significantly accelerate the engineering and control of advanced quantum systems. The main challenge in quantum computing is the fidelity of operations. As quantum processors increase in size, the number of parameters to characterize grows exponentially, making traditional methods unfeasible. This new approach addresses this limitation by using entangled quantum states to probe the process. By entangling multiple qubits and applying the process under study, information about its functioning can be extracted collectively, rather than characterizing each component individually. This drastically reduces the number of measurements required. The research focused on characterizing a general quantum process, which can represent an operation or a sequence of operations in a quantum processor. The results show that entanglement allows for a significant reduction in the complexity of characterization, achieving comparable precision to standard methods but with much greater efficiency. This improvement in scalability is a vital step towards building fault-tolerant quantum computers and implementing complex quantum algorithms. The next step will be to apply this methodology to even larger and more complex quantum systems, and to explore its application in quantum error detection and algorithm optimization.

Fidelity of Quantum Kernels Evaluated on IBM Quantum Hardware

Researchers have evaluated the fidelity of a four-qubit ZZ quantum kernel's geometry on IBM quantum hardware, specifically the ibm_fez processor. The goal was to determine how execution on real hardware preserves the data geometry encoded in a Gram matrix, a crucial aspect for the reliability of quantum machine learning methods. Twenty-four windows of indoor air quality data were used, with each circuit executed with 1024 shots under three configurations: a baseline, dynamical decoupling, and gate twirling. All configurations yielded complete, finite, positive-semidefinite Gram matrices, preserving the centered statevector geometry to a substantial, though incomplete, degree. The full-matrix centered kernel alignment (CKA) metric ranged from 0.933 to 0.989. Gate twirling proved to be the most faithful technique across all reported geometric axes, being the only one to show a statistically significant improvement over the baseline. In contrast, dynamical decoupling did not separate from the baseline at the frozen-window scale. The results suggest that residual hardware distortion, rather than finite sampling, dominates the discrepancy. Interestingly, the most faithful configuration in terms of geometric preservation showed the lowest centered kernel-target alignment, indicating that implementation fidelity and task relevance are distinct axes. This finding underscores the importance of reporting both factors in hardware quantum machine learning studies. The authors emphasize that these are descriptive results for single jobs on a specific backend and do not imply quantum advantage, hardware classifier superiority, or forecasting capabilities.

Quantum Computing: Principles and Operation for a New Technological Era

Quantum computing represents a radically different paradigm from classical computing, leveraging quantum mechanical phenomena such as superposition and entanglement. While classical computers store information in bits that can be 0 or 1, quantum computers use qubits. A qubit can exist in a superposition of 0 and 1 simultaneously, allowing it to store and process much more information than a classical bit. This principle is fundamental to the computational power of these new machines. Entanglement is another key concept. When two or more qubits are entangled, the state of one instantly depends on the state of the others, even if they are physically separated. This phenomenon allows quantum computers to perform complex operations efficiently. Furthermore, quantum interference is used to amplify correct solutions and cancel incorrect ones, guiding the computation towards the desired result. These quantum principles are the basis for algorithms like Shor's for factoring large numbers or Grover's for searching unstructured databases, which far exceed the capabilities of classical algorithms. The physical implementation of qubits varies, including ion traps, superconducting circuits, quantum dots, or topological qubits, each with its own advantages and challenges in terms of stability and scalability. The main challenge lies in maintaining qubit coherence, i.e., protecting their quantum state from interaction with the environment (decoherence), which can cause errors. Despite these challenges, progress in quantum computing is rapid, with increasingly larger and more robust systems demonstrating the viability of this technology. Quantum computers are expected to revolutionize fields such as drug discovery, materials science, artificial intelligence, and cryptography, by being able to solve problems intractable for current supercomputers.

Chiral-Interference Quantum Circuits for Benchmarking Composite Gates

Researchers have experimentally implemented compact quantum circuits that simulate the state-transfer interference underlying three- and four-level chiral-resolution protocols. These models, encoded in a two-qubit register, simulate the enantiomer-dependent sign of one of the couplings. In the four-level circuit, this is achieved by a conditional-phase operation, while in the three-level circuit, the sign of a final rotation is used. Experiments performed on an IBM quantum processor have shown that both circuits produce the expected enantiomer-dependent output states with probabilities of nearly 98%.

New Compiler Accelerates Large-Scale Quantum Circuit Simulation

Researchers have developed a new parallel compiler that enables more efficient simulation of large-scale quantum circuits. This tool addresses one of the main challenges in quantum computing development: the difficulty of testing and verifying complex quantum algorithms on classical simulators. The ability to simulate circuits with a larger number of qubits and logical gates is crucial for advancing the design and optimization of next-generation quantum hardware and algorithms. The compiler optimizes the execution of quantum circuits by reordering and merging operations, as well as by distributing the workload among multiple processors. This significantly reduces simulation time and memory requirements, making it possible to explore previously intractable circuits. Efficiency is achieved through advanced parallelization techniques and intelligent management of computational resources, making it a valuable tool for quantum computing research. This breakthrough has important implications for the quantum computing community. By facilitating the simulation of larger and more complex circuits, the compiler accelerates the design and debugging cycle of quantum algorithms. This is essential for identifying errors, evaluating the performance of different circuit architectures, and exploring new algorithmic ideas without relying solely on physical quantum hardware, which is still limited and error-prone. The tool also includes profiling capabilities that help developers better understand the behavior of their circuits and optimize them. While classical simulation of quantum systems will always have limits due to the inherent complexity of quantum mechanics, this compiler represents a significant step in extending those limits in the short to medium term. It allows researchers to validate concepts and algorithm prototypes in a controlled environment before their implementation on real quantum devices. This tool is expected to boost research and development of new quantum applications in fields such as quantum chemistry, materials science, and optimization.

Transversal Fault-Tolerant Distributed Quantum Computing Operations

Researchers have developed a new method for performing distributed quantum computing operations that are inherently fault-tolerant. This advance is crucial for building scalable quantum computers, as it addresses one of the biggest challenges in the field: the fragility of qubits and their susceptibility to errors. Fault tolerance is achieved through the use of quantum error correction codes, but their implementation in distributed systems, where qubits are physically separated, presents additional complexities. The new approach focuses on transversal operations, which apply identical transformations to each qubit in a code, simplifying error correction. The study proposes a framework for performing these transversal operations in a distributed environment, where communication between quantum nodes is a critical factor. The key lies in the ability to execute logical operations (on encoded qubits) without the need to decode and re-encode the information, which introduces fewer errors and is computationally more efficient. This method is applicable to various quantum computing architectures, including those based on ion traps, superconducting qubits, or photons, provided that reliable quantum communication channels can be established. The most significant implication of this work is that it brings closer the possibility of building a robust quantum internet and modular quantum computers. By allowing the connection of multiple smaller, fault-tolerant quantum processors, the limitation of building a single large-scale processor, which is extremely difficult due to coherence requirements, is overcome. This advance is not only relevant for quantum computing but also for secure quantum communication and distributed quantum metrology, opening new avenues for exploring large-scale quantum phenomena.

Topology of Bipartite Entangled Quantum States Unveiled

A recent study has explored the topology of the set of bipartite entangled states, $\mathsf E$, acting on the Hilbert space $\mathbb{C}^{n_1}\otimes\mathbb{C}^{n_2}$. Researchers have shown that this set is path-connected in all dimensions, and simply connected except for the specific two-qubit case. This advancement provides a deeper understanding of the mathematical structure of entanglement, a fundamental resource in quantum computing and information. For the exceptional two-qubit case, the set $\mathsf E$ is found to be homotopy equivalent to the set of maximally entangled states, which itself is homeomorphic to $\mathbb{RP}^3$. The authors have computed the complete homology of both the closure and the interior of $\mathsf E$ in this configuration. In larger dimensions, it has been shown that the homology and homotopy groups of $\mathsf E$ vanish in degrees $1\leq k\leq 2(n_1-1)(n_2-1)-2$, and all homology groups of degree $k\geq (n_1n_2)^2-3$ also vanish. This range is controlled by the space $\mathsf W$ of entanglement witnesses, which is shown to be highly connected beyond two qubits and homotopy equivalent to $\mathsf E$. Despite these vanishing results, the study reveals that $\mathsf E$ possesses non-trivial reduced homology over every field for all $n_1, n_2 \geq 2$. This was determined by computing the Euler characteristic using a torus-action fixed point argument, along with Alexander duality. These findings are crucial for understanding the complexity of quantum entanglement and could have implications for the development of future quantum technologies, by providing more robust mathematical tools for classifying and manipulating entangled states.

Fermilab and Qblox Commercialize QICK Platform for Quantum Control

The U.S. Department of Energy (DOE), Fermilab, and the company Qblox have formalized a collaboration for the commercialization of the QICK (Quantum Instrumentation Control Kit) platform. This agreement includes a commercial licensing structure to manage the manufacturing, supply chain, and distribution of the system developed by Fermilab. QICK is an open-source platform designed for the control and readout of superconducting qubits, which is crucial for the development of quantum computers. The initiative aims to accelerate the availability of high-performance quantum control hardware and reduce entry barriers for researchers and developers. The QICK platform enables more efficient integration between control software and experimental hardware, facilitating experimentation and innovation in the field of quantum computing. This step towards commercialization is fundamental for translating laboratory advances into practical applications and for standardizing certain components in the growing quantum industry. In addition to commercial distribution, the collaboration also aims to strengthen the quantum technology workforce. By making the QICK platform more accessible and supporting its use in academic and industrial settings, it is expected to foster the training of new talent and the creation of a broader community of quantum instrumentation experts. This focus on education and skill development is vital to sustain the rapid growth and complexity of quantum research and development.

New Quantum LDPC Codes Improve Error Correction

Researchers have developed new quantum low-density parity-check (LDPC) codes based on circulant permutation matrices (CPMs). These Calderbank-Shor-Steane (CSS) type codes are crucial for quantum computing, as they enable the protection of quantum information from errors inherent in qubits. The construction is parameterized by column weight J, row weight L, and prime lift size P, and uses an array of pair partitions to impose linear equations that ensure CSS orthogonality. Quantum LDPC codes are a promising avenue for quantum error correction due to their sparse structure, which facilitates decoding. Specific examples presented include a (J,L)=(4,12) code with a rate of 0.349 and a distance [[372,130,16]], and another (J,L)=(4,14) code with a rate of 0.440 and a distance [[518,228,16]]. Instances of (J,L)=(3,8) with distances [[472,122,14]] and [[488,126,14]] for lift sizes P=59 and P=61, respectively, are also reported. The distance of these codes has been established through exhaustive low-weight exclusion and the use of explicit non-stabilizer witnesses, ensuring their ability to detect and correct errors. The improvement in the coding rate and minimum distance of these new LDPC codes is a significant step towards the construction of fault-tolerant quantum computers, a fundamental requirement for the development of large-scale quantum computing.

New Algorithm Reduces Trotter Error in Quantum Simulations

Researchers have developed a high-order nested-commutator compensation (HNCC) algorithm that significantly improves the precision of Hamiltonian simulations using product formulas. This method addresses the limitation of traditional product formulas, whose circuit size scales polynomially with inverse precision, by achieving polylogarithmic precision dependence in circuit size. The key innovation lies in HNCC's ability to maintain the advantages of product formulas, such as requiring no ancillary qubits, while drastically reducing computational requirements for high precision. The HNCC algorithm employs a truncated Baker-Campbell-Hausdorff expansion to represent high-order Trotter errors as products of nested commutators. These errors are compensated at the superoperator level through randomly sampled Pauli-rotation channels, thus avoiding the need for Hadamard tests and ancillary qubits. For a K-th order product formula applied to a k-local Hamiltonian on N qubits with Γ Pauli terms and local interaction strength g₀, HNCC estimates the trace of Oe^(-i tH)ρe^(i tH) to an additive precision ε||O||. This is achieved using O(ε⁻²) repetitions and a maximum gate count per circuit of O(N^(2/(2K+1)) (k g₀ t log(1/ε))^(1+1/(2K+1)) k(Γ+log(1/ε))). The resulting time dependence of the algorithm matches that of a product formula of order 2K+1. Finite-size resource estimates for the periodic Heisenberg chain indicate that HNCC achieves the lowest CNOT and T-gate counts per circuit among the product-formula-based methods considered. This advancement is crucial for the feasibility of complex quantum simulations, where error reduction and resource optimization are decisive factors in achieving quantum advantage.

Optimal Temperature Identified for Silicon Spin Qubits

Researchers have determined the optimal operating temperature for quantum computers based on silicon spin qubits, a crucial finding for the development of commercially viable quantum systems. The study reveals that, contrary to intuition, operating these devices at extremely low temperatures (millikelvin) is not always the most efficient. The key lies in balancing quantum gate fidelity with cryogenic cooling requirements and quantum error correction overheads.

Plaquette: A Platform for Designing Fault-Tolerant Quantum Computers

Researchers have developed Plaquette, a theoretical and software platform designed to evaluate the logical performance of fault-tolerant quantum computing (FTQC) architectures based on the physical imperfections of devices. This tool addresses a critical need in the development of quantum computers, where error suppression is fundamental. Plaquette enables hardware teams to make informed decisions about which imperfections to mitigate, offering a precise view of how actual hardware noise affects the logical performance of an FTQC. Unlike stochastic Pauli models used by scalable stabilizer simulators, Plaquette considers a broader range of noise sources common in physical qubits. This includes leakage out of the computational subspace in superconducting qubits, scattering through intermediate states in neutral atoms, heating in trapped ions due to phonon absorption, and coherent errors from miscalibrated controls. The platform allows hardware error models to be specified using Kraus operators, Hamiltonian-Lindblad dynamics, or experimentally reconstructed quantum channels, automatically compiling them for different classes of samplers. Plaquette incorporates samplers such as stabilizer sampling for Pauli noise, the new XPauli sampler for leakage and environment sectors, near-Clifford samplers for coherent errors, and full-state simulation for exact reference calculations. Validation of the XPauli and near-Clifford samplers against full-state simulation has demonstrated their accuracy, matching within statistical uncertainty, while Pauli twirling can fall short depending on the error model. The tool has been demonstrated on three specific error models: leakage in superconducting qubits, intermediate-state scattering in neutral atoms, and heating in trapped ions. The discrepancy between Plaquette simulations and Clifford-only simulations varies with platform and noise process. This highlights the importance of using the most accurate simulation available to obtain reliable thresholds, error budgets, and overhead estimates. Plaquette provides a direct path from the open-system physics of a device to the evaluation of the logical performance of the FTQC built upon it, facilitating progress towards robust and functional quantum computers.

Probability of Quantum Steering in Two-Qubit States

Researchers have quantified the probability of observing quantum steering in generic two-qubit states. Steering is a manifestation of entanglement where measurements performed by one party influence the conditional states of another, without the correlations being explainable by a local hidden state model. This study addresses the question of how common this behavior is in quantum systems, which is crucial for the development of quantum information technologies. The team derived analytical expressions for the steering probability ($\mathcal{P}_S$) in Werner states for two- and three-setting scenarios, restricting the latter case to coplanar projective measurements on the Bloch sphere. For a larger number of settings and various random state ensembles, numerical analyses showed that $\mathcal{P}_S$ systematically increases with the number of measurements. Furthermore, this probability substantially exceeds the probabilities associated with Bell nonlocality. The results indicate that random states with minimal environmental coupling exhibit a high probability of steering for a finite number of measurements ($m$), approaching genuine typicality, where $\mathcal{P}_S = 100\%$, as the number of settings increases. The study provides a detailed characterization of $\mathcal{P}_S$ across different state ensembles and specific families, such as Werner and Bell-diagonal states, identifying those with the greatest non-classical potential and highlighting their relevance for protocols where steering serves as a key resource in quantum communication and computation.

Publisher Correction: A 98-qubit trapped-ion quantum computer study

NewsPhysics reports on an editorial correction related to a previously published article about a 98-qubit trapped-ion quantum computer. The correction pertains to technical details of the original study, which described a system with all-to-all connectivity between the qubits. Such corrections are common in scientific publishing and typically address minor errors or clarifications that do not invalidate the main conclusions of the work, but are important for the accuracy and reproducibility of the research. The original study focused on a significant advance in the scale and architecture of trapped-ion quantum computers, one of the most promising platforms for quantum computing.