IBM suppresses logical errors in a surface-code memory on the cloud

A team has demonstrated logical error suppression in a rotated surface-code memory implemented on a cloud-accessible IBM Nighthawk r2 superconducting processor. Quantum error correction can reduce the logical error rate exponentially with code distance when physical noise is below threshold, but turning that promise into hardware requires coordinating gates, mid-circuit measurements and qubit coherence in the face of device variation, asymmetric noise and spatiotemporal correlations. The authors optimized the syndrome extraction circuit by combining short readout, fused measurement and reset, and an XX echo on data qubits during ancilla readout. Compared with standard readout without reset or echo, the recipe cuts the median per-round logical error rate by a factor of 3.8 in the X basis and 1.4 in the Z basis. Performance also varies across the tested qubit placements on the processor, which they attribute to differences in qubit quality. In memory experiments of up to 150 rounds, the advantage associated with code distance weakens and long-lived correlations appear that may reflect a persistent error component. Under the applied optimization, increasing the protected distance from 3 to 6 — while holding the other fixed — lowers the per-round logical error rate from 0.53 % to 0.24 % in Z memory and from 0.52 % to 0.22 % in X memory, with maximum-likelihood-decoding error-suppression factors of 1.68 and 1.85, respectively. The results link circuit compilation and optimization to surface-code memory performance — and its limitations — and point toward quantum-processor and error-correction-circuit codesign as a route to fault-tolerant quantum computing primitives on current cloud-accessible quantum hardware.

New Complexity Measure for Quantum State Preparation in Spin Glasses

Researchers have developed a new method to quantify the complexity of state preparation in dense quantum $p$-spin Hamiltonians, operating on $n$ qubits. This approach extends beyond limitations based solely on quantum circuit light cones, introducing "effective profile complexity" derived from the metric entropy of Pauli profiles. These profiles record the expectations of all Pauli operators supported on exactly $p$ qubits. This advancement allows for a more precise characterization of the computational difficulty in achieving certain quantum states. The study reveals that classes of states with uniformly bounded quadratic effective profile complexity remain separated from the ground-state energy by a positive multiple of $\sqrt{n}$ for sufficiently large fixed $p$. At subquadratic effective profile complexity, the class cannot outperform a suitable benchmark class at leading order, with product states providing a universal benchmark. The proof of these results combines an adaptation of a nonsymmetric quantum de Finetti theorem with Gaussian process entropy bounds. Applying this framework, it is shown that attaining near-ground-state energy requires $\Omega(n^2/\log n)$ one- and two-qubit gates, even with arbitrary discardable ancillas. The work also obtains depth-width tradeoffs, entanglement-depth and matrix product state bond-dimension lower bounds. Furthermore, obstructions are identified for both orientations at every fixed level of Parham's magic hierarchy, with a total circuit width of $O(n)$. For the first-level reverse magic class, where a shallow circuit is followed by an unrestricted Clifford circuit, the bounds also allow arbitrarily many clean ancillas at fixed shallow-circuit depth. A sharper benchmark shows that Clifford+$T$ circuits with $o(n)$ $T$-gates have no leading-order energy advantage over product stabilizer states, even with unrestricted Clifford operations and arbitrary discardable ancillas.

New Quantum Algorithm Accelerates Equilibrium Correlation Function Calculation

Researchers have developed a novel quantum algorithm that significantly optimizes the calculation of equilibrium correlation functions, a fundamental quantity for describing the dynamic properties of physical systems. Unlike conventional quantum methods, which require a distinct quantum circuit for each time point, this new approach allows all time points to be computed simultaneously with a single circuit. This represents a substantial improvement in computational efficiency, drastically reducing the required quantum resources. Previous quantum algorithms for these functions, such as the Hadamard test or variational methods, scaled with a complexity of at least O(Nₜ) circuit shots and O(Nₜ²) quantum gates, where Nₜ is the number of time points. The new algorithm, however, uses O(log Nₜ) ancilla qubits to encode time as a quantum variable. This effective parallelization allows the circuit to be run only O(log Nₜ) times, resulting in a total complexity of O(Nₜ log Nₜ) quantum resources for large systems. The authors demonstrate that this scaling is optimal and validate their method by calculating the Green's function of a one-dimensional spinless Hubbard model. The ability to efficiently calculate equilibrium correlation functions is crucial for understanding and predicting the behavior of complex quantum materials and systems. This advance could accelerate research in fields such as materials science, quantum chemistry, and the design of new devices. The optimization in quantum resource usage brings closer the possibility of performing simulations of quantum systems that are currently intractable for classical computers, opening new avenues for scientific discovery.

All Quantum Unitaries Can Have Constant Depth Circuits

A new study has revealed that any n-qubit unitary operation can be approximated with ε precision by a quantum circuit of depth polynomial in n and log(1/ε), using an exponential number of ancilla qubits. This finding is surprising, as it was traditionally assumed that implementing general unitaries required exponential depth. The ability to "parallelize" these operations to polynomial depth opens new avenues for quantum algorithm design. The advance is based on a novel connection between the unitary synthesis problem, previously explored by Aaronson and Kuperberg, and concepts from complexity theory and cryptography, such as locally-decodable codes and private information retrieval. This interconnection has allowed for the development of a construction that challenges previous assumptions about the complexity of quantum circuits. Furthermore, the researchers demonstrated that if unbounded fan-out gates are permitted (i.e., one output can be the input to multiple gates), these circuits can be further reduced to constant depth. This implies that, under certain hardware conditions, the execution of complex quantum operations could be performed in a computationally very short time, regardless of the number of input qubits, which has profound implications for large-scale quantum computing.

Optimal Performance Achieved in Chaotic Floquet Quantum Battery

Researchers have explored a new strategy to optimize the performance of quantum batteries, devices that store energy in quantum systems. The study focuses on a battery composed of N qubits interacting uniformly. The charging process begins from the system's ground state, applying periodic kicks in a transverse direction and, crucially, introducing disorder in the interaction direction. This approach allows the system's dynamics, even though the Hamiltonian and initial state preserve permutation symmetry, to deviate from the symmetric subspace, resulting in a larger amount of stored energy compared to systems without disorder. A key finding is that, in the limit of large disorder, the possibility of a chaotic charging phase emerges. In this regime, the stored energy can be precisely calculated using random matrix theory. More importantly, energy fluctuations decrease and become negligible in this large disorder limit, which is precisely when the stored energy reaches its maximum. This condition is highly desirable for the optimal functioning of a quantum battery, as it ensures maximum and stable charge. The battery cycle is completed by considering the storage phase in the presence of dephasing noise. The results indicate that, for larger disorder strengths, the ergotropy—the maximum extractable energy—remains close to the stored energy. This suggests nearly complete energy extractability, with an efficiency approaching unity. This advance could lay the groundwork for the development of more efficient and reliable quantum batteries, leveraging quantum mechanics principles to overcome the limitations of conventional energy storage devices.

Ultrafast Exciton Dynamics in 2D Silicon Carbide

Researchers have successfully characterized phonon-assisted exciton dynamics and ultrafast photoluminescence in two-dimensional (2D) silicon carbide (SiC) monolayers. This breakthrough is crucial for understanding the fundamental properties of this emerging material, which holds great promise for applications in optoelectronics and quantum computing. The ability to control and comprehend the behavior of excitons, which are bound electron-hole pairs, is essential for the development of 2D SiC-based devices. The study focused on observing phonon-assisted photoluminescence transitions, indicating a strong interaction between excitons and the crystal lattice vibrations of 2D SiC. Using ultrafast spectroscopy, scientists were able to map the temporal evolution of these excitons, revealing relaxation and recombination processes occurring on picosecond timescales. These results provide a detailed insight into how energy dissipates and converts into light within this material. Understanding exciton dynamics in 2D SiC is vital for optimizing its performance in future applications. For instance, in optoelectronics, efficient excitonic recombination is key for light-emitting devices. In quantum computing, exciton coherence and their interaction with phonons can influence the stability of SiC-based qubits. This work lays the groundwork for designing more efficient and robust devices that harness the unique properties of two-dimensional silicon carbide.

Fault-Tolerant Quantum Computation with Logarithmic Time Overhead

Researchers have demonstrated that fault-tolerant quantum computation can be achieved with strictly logarithmic time overhead and constant space overhead. This advancement improves upon previous results that included additional subpolylogarithmic factors, bringing closer the feasibility of robust and scalable quantum computers. Fault tolerance is crucial for quantum computing, as qubits are inherently fragile and prone to errors due to decoherence and environmental interactions. The main construction proposed utilizes polynomial-subrank transversal logical $\CCZ$ gates on good quantum locally testable codes (qLTCs) to implement addressable universal computation. This is achieved by transferring batches of logical qubits between dense storage and active logical subspaces while reusing the same ancillary workspace. The $\CCZ$ gates are implemented directly by the transversal operation, meaning only stabilizer resource states require separate preparation, simplifying the process. Furthermore, an alternative construction is presented that also achieves purely logarithmic time overhead. This is based on modifying the quantum Reed-Solomon magic-state distillation scheme. Recursively applying a fixed distillation circuit, protected by qLTCs of increasing block length, eliminates the subpolylogarithmic time factor. These methods offer promising avenues for overcoming one of the biggest challenges in quantum computing development: efficient error management with limited resources.

New Quantum Locally Testable Codes from Product Expansion

Researchers have developed a new class of quantum locally testable codes (LTCs) that promise robustness for quantum computing. These codes exhibit constant rate, distance, soundness, and locality, which are crucial properties for error correction in quantum systems. The construction is based on a variant of the product expansion conjecture by Bafna and Vyas, applied to Reed-Solomon codes, known for their efficiency in classical error correction. This advance is significant because LTCs are fundamental for building fault-tolerant quantum computers, an indispensable requirement to overcome the inherent fragility of qubits. The method used for constructing these LTCs falls within the high-dimensional expansion framework proposed by Dinur, Lin, and Vidick. This theoretical framework allows for designing quantum codes with desirable properties by utilizing complex geometric structures. In this particular case, the researchers instantiated the framework with non-Abelian cubical complexes by Rungtanapirom, Stix, and Vdovina. The key to success lies in equipping these complexes with carefully chosen Reed-Solomon local codes whose symmetries are compatible with those of the underlying complex structure. This compatibility ensures that the error correction properties are maintained globally within the quantum code. The relevance of this work lies in the creation of codes that are not only efficient in detecting and correcting errors but also allow for local verification of quantum operations, without needing to access the entire quantum state. This greatly simplifies the design and operation of future quantum computers. Although the construction relies on a conjecture, its future empirical or theoretical validation could open the door to practical implementations of fault-tolerant quantum computing, bringing us closer to the realization of large-scale quantum devices.

New approach for long-range quantum gates with neutral atoms

Researchers have proposed a novel four-level architecture for neutral-atom quantum computing that aims to overcome the limitations of short-range two-qubit gates. Traditionally, these gates rely on Rydberg blockade, which requires atom shuttling to achieve long-range connectivity. The new proposal integrates ground-state qubits, known for their long lifetimes, with Rydberg states that couple to a microwave cavity. This cavity-mediated coupling would enable the implementation of long-range quantum gates, a crucial advancement for the scalability of neutral-atom quantum computers. The study analyzed the thermal dependence of two established gate protocols: the dispersive iSWAP gate, intrinsic to the Tavis-Cummings model, and a controlled-phase gate generated by driving the cavity. Simulations were performed considering factors such as Rydberg decay, thermal photons, and finite cavity linewidth, yielding fidelities that align with theoretical bounds. Furthermore, a bichromatic Raman gate was introduced, which, by virtually populating the Rydberg states, mitigates dispersive shifts and, consequently, atomic and cavity decay, achieving a fidelity of F = 0.997. The application of this technology to a full optical tweezer array within a microwave cavity demonstrates a significant impact on quantum error correction. The authors show that using a cavity-mediated gate to close the periodic boundaries of the toric code reduces the time for an error correction round by a factor of 2.3 for realistic array sizes. This improvement extends to the broader family of bivariate bicycle codes, where a 4.8-fold reduction in round time is observed for the gross code, underscoring the potential of this architecture to enhance the efficiency and robustness of quantum systems.

Real-time error mitigation for one-way quantum computation

Researchers have developed a method for real-time error mitigation in one-way quantum computation, a technique that uses entangled states of multiple qubits to perform operations. This advance is crucial for building fault-tolerant quantum computers, as the fragility of quantum states is one of the biggest challenges. The new approach allows for the identification and correction of errors during the execution of calculations, rather than at the end, which significantly improves the reliability of quantum operations. One-way quantum computation (or cluster state quantum computation) is based on the preparation of a highly entangled quantum state, known as a cluster state, and the subsequent performance of sequential measurements on individual qubits. Each measurement projects the state of the system and, depending on the result, determines the next operation to be performed. Error mitigation in this context is particularly complex due to the probabilistic nature of measurements and the propagation of errors through the entangled state. The proposed method uses machine learning techniques and optimization algorithms to predict and compensate for the effects of quantum errors in real time. This is achieved by characterizing the system's noise and dynamically adjusting the parameters of subsequent measurements or operations. Experimental results demonstrate a substantial improvement in the fidelity of quantum operations, bringing one-way quantum computation closer to practical applications. This work represents an important step towards the realization of robust and scalable quantum computers.

Asymptotically Good Quantum Locally Testable Codes Developed

Researchers have successfully constructed explicit families of asymptotically good quantum locally testable codes (QLTCs) over qubits. This advancement is significant for the field of quantum computing, as these codes are a crucial component for the development of fault-tolerant quantum computers. The ability to detect errors locally and efficiently is fundamental for maintaining the integrity of quantum information, which is inherently fragile and susceptible to decoherence. The constructed codes are quantum low-density parity-check (LDPC) CSS (Calderbank-Shor-Steane) codes. These codes exhibit a constant rate, constant relative distance, and constant-weight local testers with constant soundness. These properties are key to ensuring that the codes can correct a constant number of errors, even as the size of the quantum system increases, making them "asymptotically good." The explicit construction of these code families represents a step forward in engineering robust quantum systems. The importance of this work lies in its contribution to the viability of large-scale quantum computing. QLTCs are essential for quantum error correction, allowing quantum computations to be performed reliably despite the inherent noise in quantum devices. The existence of codes with these characteristics opens new avenues for designing more stable and scalable quantum computing architectures, bringing closer the realization of quantum computers that can tackle currently intractable problems.

Logarithmic-depth quantum simulation of boson sampling

Researchers have shown that boson sampling, a computational problem believed to be hard for classical computers, can be simulated with a logarithmic-depth qubit circuit. This advancement places boson sampling within the realm of shallow quantum computation, which has implications for understanding the limits and capabilities of quantum computers. The proposed method allows for the simulation of an arbitrary m-mode interferometer with n single-photon inputs (where n ≤ m) with an inverse-polynomial total-variation error. The qubit circuit employs a polynomially many qubits and uses Clifford+T gates, allowing for arbitrary qubit connectivity and a single final measurement. The family of these circuits is logspace uniform, indicating an efficient construction. The key to this simulation lies in enlarging the original optical system and decomposing the resulting transformation into six quadratic shears. Each optical mode is then distributed over many submodes, which permits a fixed local occupation cutoff. From there, local basis changes and parallel phase gates are applied to construct the qubit circuit. This innovative approach allows the complexity of boson sampling to be tackled with a relatively simple quantum circuit architecture.

New Algorithm Improves Quantum Computing Efficiency Up To 100,000%

Researchers have developed a new software paradigm, called Adaptive Algorithmic Control (A2C), which optimizes the allocation of computational resources in quantum computers. This approach, based on a state-proxy equalization theorem, demonstrates that quantum computing efficiency depends not only on hardware improvements but also on how finite resources are managed during the computation process. A2C aims to equalize cumulative "computational hardness" rather than physical time, inferring this hardness directly from the evolving quantum state without needing to explicitly reconstruct the exponentially large many-body spectrum. The A2C method was tested on quantum optimization problems involving up to 156 qubits, using a combination of exact simulations, large-scale supercomputer computations, and experiments with IBM quantum hardware. The results are significant: A2C improved low-energy sampling probabilities by 22% to over 100,000% compared to previous methods, while maintaining the same circuit depths and measurement budgets. This highlights that intelligent software management can unlock substantially greater quantum performance from existing hardware. This breakthrough suggests that quantum computing performance is a dual function of both hardware and software. Adaptive algorithmic control is thus established as a complementary and crucial pathway for progress in this field, opening new possibilities for solving complex problems with current and future quantum computers. The findings demonstrate that, beyond continuous hardware improvement, optimizing how finite computational resources are organized is fundamental to maximizing the potential of quantum computing.

Generalized semi-Clifford conjecture in quantum computing disproven

Researchers have disproven a 2007 conjecture regarding the structure of quantum gates within the Clifford hierarchy, a fundamental set of operations for fault-tolerant quantum computing. The conjecture proposed that all gates in this hierarchy could be expressed in a specific form, known as generalized semi-Clifford. This new work presents a concrete counterexample, a five-qubit gate that belongs to the fifth level of the Clifford hierarchy but cannot be represented in the predicted form, thus invalidating the original hypothesis. The Clifford hierarchy is a nested sequence of sets of quantum gates that are crucial for implementing quantum error correction schemes. These gates can be performed fault-tolerantly using gate teleportation, making them essential building blocks for robust quantum computers. The 2007 Zeng-Chen-Chuang conjecture postulated that all hierarchy gates were generalized semi-Clifford, meaning they could be decomposed as C₁ΠDC₂, where C₁ and C₂ are Clifford gates, Π is a permutation gate, and D is a diagonal gate. In 2008, Beigi and Shor proved this conjecture held for all third-level gates. The counterexample constructed by the researchers not only demonstrates the falsity of the conjecture but also reveals an important aspect of the Clifford hierarchy's structure: it is not closed under inverses. This finding has implications for the design and understanding of quantum algorithms and error correction protocols, as the ability to invert operations is often a fundamental requirement. The methodology used to deduce the form of the counterexample, rather than simply presenting it, offers deeper insight into the properties of these advanced quantum gates.

New Open-Source Software for Quantum State Tomography in NMR

Researchers have developed Tomography-NMR, an open-source Python package designed to reconstruct quantum density matrices from spectroscopic measurement data. This tool addresses a gap in the documentation and availability of software for quantum state tomography (QST), a crucial process for characterizing the state of a quantum system. The package offers a transparent and reproducible implementation of the entire analysis pipeline, from spectral signal preprocessing to density matrix visualization, thereby facilitating reproducibility and standardization in quantum computing and condensed matter physics research. The software implements a complete analysis pipeline for two-qubit quantum state tomography, utilizing the product operator formalism. It begins by Fourier-transforming time-domain signals into frequency-domain spectra. Subsequently, spectral peak intensities are mapped to expansion coefficients of the density matrix, enabling the full quantum state reconstruction. Tomography-NMR provides three integration methods tailored for different scenarios: direct peak height measurement and fixed-parameter numerical integration, which require no theoretical reference and are suitable for unknown states, and a systematic parameter optimization method against a known target state. The software was validated using experimentally prepared two-qubit states measured via nuclear magnetic resonance (NMR) spectroscopy of coupled ³¹P nuclei. For a benchmark set of known states, the software achieved reconstruction fidelities of approximately 98% with the reference-free methods, and exceeded 99% with parameter optimization. Across a benchmark set of 20 two-qubit states, including computational basis states, Bell states, and the outputs of three fundamental quantum gates (CNOT, H, and T), average reconstruction fidelities ranged from 0.975 to 0.995. Although specifically developed for NMR, the package's modular architecture allows for adaptation to other spectroscopic platforms and measurement protocols, broadening its potential applications.

Zero-private-capacity quantum channels enable secure communication

A recent breakthrough in quantum information theory has resolved a long-standing problem: whether two quantum channels, each with zero private capacity, can jointly enable private communication. The answer is yes. Researchers have demonstrated that a four-level channel and a qubit erasure channel with a 50% erasure probability, both having zero individual private capacity, can be combined to achieve private communication exceeding 0.0001903 private bits per product use. This phenomenon, known as superactivation, is impossible for independent classical memoryless wiretap channels. Private communication over a noisy quantum channel requires reliable transmission to the receiver and, simultaneously, secrecy from the environment. Traditionally, a channel's private capacity was considered the sole determinant of its utility for secure communication. However, this study challenges this notion by showing that a channel's value for secure communication is not solely determined by its individual private capacity. The encoding method used in this work provides the receiver with a linear information gain, while environmental leakage is at most quadratic. This enables privacy through a fixed joint measurement and classical coding. The initial activation example was identified through interactions with large language models, and the result has been formalized using the Lean 4 proof assistant.

Environmental Noise Induces Long-Distance Entanglement in Superconducting Qubits

Scientists have successfully induced a quantum entangled state between two superconducting qubits separated by a meter of cable, utilizing environmental noise as the mechanism. This discovery challenges the conventional notion that noise is detrimental to quantum coherence, suggesting that, under certain conditions, it can be a tool for generating entangled states, which are fundamental for quantum computing and technologies. Traditionally, quantum entanglement requires highly controlled and isolated environments to minimize decoherence caused by interactions with the surroundings. However, this experiment demonstrates that noise, far from being an obstacle, can act as a catalyst for entanglement. The qubits, made from superconducting materials, were exposed to electromagnetic fluctuations from their environment, which facilitated their quantum coupling over a considerable distance for this type of system. This breakthrough opens new avenues for the development of more robust and scalable quantum architectures. If environmental noise can be effectively controlled and harnessed, it could simplify the engineering of quantum systems, reducing the need for extreme isolation and facilitating the interconnection of qubits over greater distances. This has significant implications for the construction of more complex and distributed quantum computers and quantum communication networks.

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.