·Global edition
Constant of the dayc·2,998 × 10⁸ m·s⁻¹
Year · No. 0
— Natura non facit saltus —
Thursday, 23 Jul 2026

NewsPhysics

Physics daily·Since MMXXVI·Morning edition
Digital edition · free
Founded in Madrid · Global distribution
Autonomous edition
Quantum Physics

Quantum Physics

Latest pieces published in NewsPhysics in the quantum physics section.

6
Articles 6
Filter by day← View recent
July 2026
MTWTFSS
Wednesday, July 1, 2026
2026-07-01

Planar Fault-Tolerant Logical Measurements With Low Qubit Overhead

Researchers have demonstrated a method for performing fault-tolerant logical measurements in superconducting transmon qubits, using a planar architecture with low qubit overhead. This advance is crucial for quantum computing, as quantum error correction requires precise and robust measurements of logical states, even in the presence of noise. The novelty lies in the efficiency of the approach, which minimizes the number of physical qubits needed to encode and measure a logical qubit, a persistent challenge in the development of large-scale quantum computers. The experiment was conducted on a 21-transmon qubit chip, where a logical qubit was encoded using the surface code. This code is one of the most promising quantum error correction schemes due to its high fault tolerance and relatively straightforward implementation in 2D architectures. The key to success was the ability to perform parity measurements efficiently, which allows for error detection without destroying the encoded quantum information. The results show a significant improvement in the fidelity of logical measurements compared to previous approaches, bringing closer the realization of reliable quantum operations. The demonstration of fault-tolerant logical measurements with reduced qubit overhead is a fundamental step towards building universal quantum computers. The ability to protect quantum information from environmental noise is essential for scaling quantum systems and executing complex algorithms. This work not only validates the feasibility of surface codes in transmon platforms but also sets a new benchmark for efficiency in quantum error correction, paving the way for future architectures with a larger number of logical qubits and greater robustness against errors.

Nature
2026-07-01

Nonequilibrium Casimir-Polder Force Exhibits Magnus-like Effect

Researchers have discovered a Magnus-like contribution to the nonequilibrium Casimir-Polder force when a particle moves in vacuum near macroscopic bodies. This phenomenon arises from the interplay between particle dynamics and material-modified electromagnetic quantum fluctuations. The interaction induces a direction-dependent angular momentum in the particle, which then couples to the electromagnetic field's spin. This interaction generates a drift force directly proportional to the cross product of the particle's angular and translational velocities. This finding reveals a rotational transport component within the nonequilibrium Casimir-Polder interaction. The Casimir-Polder force is a quantum effect describing the interaction between an atom or molecule and a surface, due to quantum fluctuations of the electromagnetic field. The results establish a striking connection between forces induced by quantum fluctuations and the classical Magnus effect observed in fluid dynamics. The Magnus effect describes the force acting on a spinning object moving through a fluid, perpendicular to both the direction of motion and the axis of rotation. This parallel suggests that fundamental principles from fluid mechanics may have analogues in the realm of nonequilibrium quantum interactions.

arXiv
2026-07-01

New Quantum Modulation Enhances Photon-Efficient Optical Communication

Researchers have proposed a novel squeezed-state pulse-position modulation (S-PPM) format and an associated inverse-squeezing conditional pulse-nulling (IS-CPN) receiver, which promise to enhance efficiency in optical communication. This scheme utilizes squeezed vacuum states for empty slots and displaced squeezed states for pulse slots. The key insight is that the IS-CPN receiver can map the S-PPM signal into an equivalent coherent-state PPM signal with significantly larger pulse energy, allowing for a closed-form expression for the receiver error probability under ideal conditions. The analysis of the IS-CPN receiver was extended to more realistic scenarios, including common phase diffusion, a prevalent phenomenon in optical communication systems. A finite-path MAP (Maximum A Posteriori) formulation with phase-averaged likelihoods was employed for this purpose. Numerical results demonstrate that IS-CPN outperforms conventional CPN (conditional pulse-nulling) under the same energy constraint. This advantage persists even in the presence of phase noise and with finite photon-number resolution. The combination of squeezed-state modulation with inverse-squeezing conditional nulling represents a significant advancement in optical communication. This approach not only improves robustness against channel imperfections like phase noise but also optimizes photon utilization, which is crucial for high-speed, low-power communication systems. The findings suggest a promising path for the development of more efficient and reliable optical communication technologies in the future.

arXiv
2026-07-01

New Method for Quantum Simulations Without Storing Full Matrices

Researchers have developed a computational framework that enables large-scale quantum simulations without the need to store the full Hamiltonian operator matrix in the memory of a single accelerator. This breakthrough is crucial, as the core step in quantum simulations, matrix-vector multiplication ($\phi = \mathcal{H} \psi$), is typically limited by the memory requirements to store the Hamiltonian matrix. The new approach addresses this barrier, facilitating the study of more complex quantum systems. The method introduces a "matrix-free" approach that represents the operator through a block-procedural interface. These blocks can be generated, loaded, cached, distributed, or applied directly only when their action is needed. This eliminates the requirement that the full dense matrix fit into the accelerator's memory. To optimize performance, an adaptive planner dynamically selects block size, cache strategy, GPU grouping, row distribution, and task parallelization, based on memory and workload estimates. Various planning strategies have been explored, including procedural generation, partial or full caching, and row-distributed caching. This approach transforms the fixed memory barrier into a tunable balance between block generation, cache reuse, data movement, parallel scheduling, and numerical accuracy. By overcoming the memory limitation, the framework opens the door to larger and more complex quantum simulations, which could accelerate research in fields such as materials science, quantum chemistry, and the development of new quantum devices. The ability to simulate larger and more realistic systems is fundamental for advancing the understanding of complex quantum phenomena.

arXiv
2026-07-01

New Architectures Avoid Barren Plateaus in Quantum Machine Learning

Researchers have addressed the problem of "Barren Plateaus" in Quantum Machine Learning (QML), a phenomenon that hinders the training of Parameterized Quantum Circuits (PQCs). This issue arises when the gradient landscape becomes exponentially flat, preventing effective optimization. The study proposes that the large Hilbert space capacity of PQCs, often seen as an advantage, is the direct mathematical cause of these plateaus, leading to "quantum underfitting" in unstructured architectures. This work establishes a framework linking the algebraic dimension of circuit generators to their optimization dynamics. To achieve this, recent advances in Dynamical Lie Algebras (DLAs) and Geometric QML have been integrated. This approach reveals a quantum manifestation of the bias-variance tradeoff: while unstructured architectures can achieve near-perfect training accuracy via unscalable parameterization (which could be considered "quantum overfitting"), embedding group-theoretic geometric priors acts as a structural regularizer. By restricting DLA growth to a polynomial regime, the proposed method sacrifices raw memorization capacity. However, this strategy guarantees scalable, gradient-rich training landscapes, which is crucial for the development of scalable quantum neural networks. The results were empirically validated on a non-linear binary classification task, demonstrating the feasibility of a "Trainability-by-Design" approach in QML systems.

arXiv
2026-07-01

Machine Learning Optimizes Continuous-Variable Quantum Key Distribution

Researchers have developed a machine learning-based optimization framework to enhance continuous-variable quantum key distribution (CV-QKD). This new approach addresses practical hardware limitations, such as finite transmitter and receiver filter lengths and the limited resolution of digital-to-analog and analog-to-digital converters, which typically degrade CV-QKD system performance by causing mode mismatch. The system jointly optimizes transmitter pulse shaping and receiver matched filtering. The methodology employs reinforcement learning and considers realistic hardware constraints. These include a limited number of filter taps, finite converter resolution, analog low-pass filtering, and the optimal mean photon number. By mitigating mode mismatch and accounting for implementation constraints, the proposed method improves overall system performance. CV-QKD is a promising technology for secure communication, but its practical implementation is often hampered by these component imperfections. Simulation results demonstrate that this optimization framework achieves enhanced secure key rates compared to conventional approaches. This underscores the effectiveness of the proposed method in overcoming the challenges inherent in implementing CV-QKD systems in real-world environments. The advance could pave the way for more robust and efficient quantum communication systems, bringing quantum cryptography closer to large-scale practical applications.

arXiv
Suggest an improvement