Letters
01LT01
The following article is Open access
Francesco Romeo and Jacopo Settino
We show that global properties of an unknown quantum network, such as the average degree, hub density, and the number of closed paths of fixed length, can be inferred from strictly local quantum measurements. In particular, we demonstrate that a malicious agent with access to only a small subset of nodes can initialize quantum states locally and, through repeated short-time measurements, extract sensitive structural information about the entire network. The intrusion strategy is inspired by extreme learning and quantum reservoir computing and combines short-time quantum evolution with a non-iterative linear readout with trainable weights. These results suggest new strategies for intrusion detection and structural diagnostics in future quantum Internet infrastructures.
01LT02
Jonathan Nemirovsky, Maya Chuchem and Yotam Shapira
As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence of these available gates is not unique. Thus, the fidelity of an algorithm’s implementation can be increased by choosing an optimized decomposition. This is true both for noisy intermediate-scale quantum platforms as well as for implementation of quantum error correction schemes. Here we present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit (MQ) entangling gates, that are separated by layers of single qubit rotations. We use trapped ions as an example in which MQ gates naturally arise, yet any system that has connectivity beyond nearest-neighbors may gain from our approach. We evaluate our methods using the quantum volume (QV) test over N qubits. In this context, our method replaces
two-qubit gates with
MQ gates. Furthermore, our method minimizes the magnitude of the entanglement phases, which typically enables an improved implementation fidelity, by using weaker driving fields or faster realizations. We numerically test our compilation and show that, compared to conventional realizations with sequential two-qubit gates, our compilations improves the logarithm of QV by 20% to 25%.
01LT03
Jin-Min Liang, Shuheng Liu, Shao-Ming Fei and Qiongyi He
The characterization of high-dimensional entanglement plays a crucial role in the field of quantum information science. Conventional entanglement criteria measuring coherent superpositions of multiple basis states face experimental bottlenecks on most physical platforms due to limited multi-channel control. Here, we introduce a practically efficient detection strategy based on randomized product projections. We show that the first-order moments of such projections can be used to estimate entanglement fidelity, thereby enabling practical and efficient certification of the Schmidt number (SN) in high-dimensional bipartite systems. By constructing optimal observables, it is sufficient to merely measure a single basis state, substantially reducing experimental overhead. Moreover, we present an algorithm to obtain a lower bound of the SN with a high confidence level from a limited number of experimental data. Our results open up resource-efficient experimental avenues to detect high-dimensional entanglement and test its implementations in modern information technologies.
Roadmap
012501
The following article is Open access
Steve Campbell, Irene D’Amico, Mario A Ciampini, Janet Anders, Natalia Ares, Simone Artini, Alexia Auffèves, Lindsay Bassman Oftelie, Laetitia P Bettmann, Marcus V S Bonança et al
The last two decades have seen quantum thermodynamics become a well established field of research in its own right. In that time, it has demonstrated a remarkably broad applicability, ranging from providing foundational advances in the understanding of how thermodynamic principles apply at the nano-scale and in the presence of quantum coherence, to providing a guiding framework for the development of efficient quantum devices. Exquisite levels of control have allowed state-of-the-art experimental platforms to explore energetics and thermodynamics at the smallest scales which has in turn helped to drive theoretical advances. This Roadmap provides an overview of the recent developments across many of the field’s sub-disciplines, assessing the key challenges and future prospects, providing a guide for its near term progress.
Topical Review
013001
The following article is Open access
Liam Flannigan, Mostafa Khalil, Phyllis Chiu and Chang-qing Xu
Satellite quantum key distribution technology has developed rapidly using near-infrared wavelengths and is expected to enable global quantum communication. However, link availability is still hampered by detrimental effects in the free-space channel, such as background noise from solar radiation and attenuation from turbulence and weather such as haze and fog. One potential mitigation technique is to move to the mid-infrared atmospheric transmission window (3–5 µms) where background noise and turbulence effects are significantly reduced. While mid-infrared quantum technology is not as well developed, advancements in mid-infrared entangled photon pair generation and nonlinear upconversion single-photon detectors could be poised to enable daytime satellite downlinks with increased reliability. This review compares the state of the art for quantum transmitters and receivers in the mid-infrared to the more established near-infrared technology. The goal is to identify gaps in transmitter and/or receiver technology in the mid-infrared, and to determine if the mid-infrared can offer significant advantages over the near infrared for quantum communication.
Papers
015001
Donghwa Ji, Junseo Lee, Myeongjin Shin, IlKwon Sohn and Kabgyun Jeong
In classical information theory, uncommon information refers to the amount of information that is not shared between two messages, and it admits an operational interpretation as the minimum communication cost required to exchange the messages. Extending this notion to the quantum setting, quantum uncommon information is defined as the amount of quantum information necessary to exchange two quantum states. While the value of uncommon information can be computed exactly in the classical case, no direct method is currently known for calculating its quantum analogue. Prior work has primarily focused on deriving upper and lower bounds for quantum uncommon information. In this work, we propose a new approach for estimating these bounds by utilizing the quantum Donsker–Varadhan representation and implementing a gradient-based optimization method. Our results suggest a pathway toward efficient approximation of quantum uncommon information using variational techniques grounded in quantum neural architectures.
015002
The following article is Open access
Miguel Casanova and Francesco Ticozzi
The present work analyzes state-stabilization techniques for decoupling a subsystem from environmental interactions. The proposed framework uses analytical and numerical tools to find an approximate decoherence-free subspace with improved passive noise isolation. Active state-stabilizing control on a subsystem mediating dominant environmental interactions, which we call the wall subsystem, creates an effective quantum wall state. The proposed method controls only the wall subsystem, leaving the logical subsystem untouched. This simplifies logic operations in the protected subsystem, and makes it suitable for integration with other quantum information protection techniques, such as dynamical decoupling (DD). We demonstrated its effectiveness in improving the performance of selective or complete DD. Under suitable conditions, our method maintains the purity of the system above a threshold for all times, achieving eternal purity preservation. Theoretical analysis links this behavior to the asymptotic spectrum of the Hamiltonian when the control gain grows unbounded.
015003
The following article is Open access
Paulo J Paulino, Albert Cabot, Gabriele De Chiara, Mauro Antezza, Igor Lesanovsky and Federico Carollo
Open many-body quantum systems can exhibit intriguing nonequilibrium phases of matter, such as time crystals. In these phases, the state of the system spontaneously breaks the time-translation symmetry of the dynamical generator, which typically manifests through persistent oscillations of an order parameter. A paradigmatic model displaying such a symmetry breaking is the boundary time crystal (BTC), which has been extensively analyzed experimentally and theoretically. Despite the broad interest in these nonequilibrium phases, their thermodynamics and their fluctuating behavior remain largely unexplored, in particular for the case of coupled time crystals. In this work, we consider two interacting BTCs and derive a consistent interpretation of their thermodynamic behavior. We fully characterize their average dynamics and the behavior of their quantum fluctuations, which allows us to demonstrate the presence of quantum and classical correlations in both the stationary and the time-crystal phases displayed by the system. We furthermore exploit our theoretical derivation to explore possible applications of time crystals as quantum batteries, demonstrating their ability to efficiently store energy.
015004
The following article is Open access
T Sanchez Mejia, L Nicolas, A Gelmini Rodriguez, P Goldner and M Afzelius
Optical quantum memories are essential components for realizing the full potential of quantum networks. Among these, rare-earth-doped crystal memories stand out due to their large multimode storage capabilities. To maximize the multimode capacity in the time domain, it is key to simultaneously achieve large memory bandwidth and long optical storage time. Here, we demonstrate an atomic frequency comb optical memory in 171Yb3+:Y2SiO5, with a memory bandwidth of 250 MHz and a storage time of up to 125 µs. The efficiency reaches 20% at short storage times, and 5% at 125 µs. These results were enabled by an optimized optical pumping scheme, guided by numerical modelling. Our approach is specifically designed for future spin-wave storage experiments, with the theoretical bandwidth limit set at 288 MHz by the hyperfine structure of 171Yb3+:Y2SiO5. Additionally, we introduce an efficient method for synthesizing the optical pumping waveforms required for generating combs with tens of thousands of teeth, as well as a simple yet frequency-agile laser setup for optical pumping across a 10 GHz bandwidth.
015005
The following article is Open access
Simone Bordoni, Andrea Papaluca, Piergiorgio Buttarini, Alejandro Sopena, Stefano Giagu and Stefano Carrazza
In the current era of quantum computing, robust and efficient tools are essential to bridge the gap between simulations and quantum hardware execution. In this work, we introduce a machine learning approach to characterize the noise impacting a quantum chip and emulate it during simulations. Our algorithm leverages reinforcement learning (RL), offering increased flexibility in reproducing various noise models compared to conventional techniques such as randomized benchmarking or heuristic noise models. The effectiveness of the RL agent has been validated through simulations and testing on real superconducting qubits. Additionally, we provide practical use-case examples for the study of renowned quantum algorithms.
015006
The following article is Open access
George Mihailescu, Saubhik Sarkar, Abolfazl Bayat, Steve Campbell and Andrew K Mitchell
The theoretical foundation of quantum sensing is rooted in the Cramér–Rao formalism, which establishes quantitative precision bounds for a given quantum probe. In many practical scenarios, where more than one parameter is unknown, the multi-parameter Cramér–Rao bound (CRB) applies. Since this is a matrix inequality involving the inverse of the quantum Fisher information matrix (QFIM), the formalism breaks down when the QFIM is singular. In this paper, we examine the physical origins of such singularities, showing that they result from an over-parameterization on the metrological level. This is itself caused by emergent metrological symmetries, whereby the same set of measurement outcomes are obtained for different combinations of system parameters. Although the number of effective parameters is equal to the number of non-zero QFIM eigenvalues, the Cramér–Rao formalism typically does not provide information about the effective parameter encoding. Instead, we demonstrate through a series of concrete examples that Bayesian estimation can provide deep insights. In particular, the metrological symmetries appear in the Bayesian posterior distribution as lines of persistent likelihood running through the space of unknown parameters. These lines are contour lines of the effective parameters which, through suitable parameter transformations, can be estimated and follow their own effective CRBs.
015007
The following article is Open access
Kapil Goswami, Gagan Anekonda Veereshi, Peter Schmelcher and Rick Mukherjee
The travelling salesman problem (TSP) is a popular NP-hard combinatorial optimization problem that requires finding the optimal way for a salesman to travel through different cities once and return to the initial city. The existing methods of solving TSPs on quantum systems are either gate-based or binary variable-based encoding. Both approaches are resource-expensive in terms of the number of qubits, while performing worse compared to existing classical algorithms, even for small-sized problems. A novel encoding scheme is needed to map the TSP problem onto a quantum system, which is addressed in this work. We introduce a distinct geometric approach to encode the TSP on a single qubit and present a quantum-inspired algorithm to solve the problem by invoking the principle of quantum superposition. The cities are represented as quantum states on the Bloch sphere, while the preparation of superposition states allows us to traverse multiple paths at once. The underlying framework of our algorithm is a quantum-inspired version of the classical Brachistochrone approach. Optimal control methods are employed to create a selective superposition of the quantum states to find the shortest route of a given TSP. The numerical simulations solve a sample of four to nine cities for which exact solutions are obtained. The algorithm can be implemented on any quantum platform capable of efficiently rotating a qubit and allowing state tomography measurements. For the TSP problem sizes considered in this work, our algorithm is more resource-efficient and accurate than existing quantum algorithms, with the potential for scalability.
015008
The following article is Open access
J A Montañez-Barrera, G P Beretta, Kristel Michielsen and Michael R von Spakovsky
As quantum processing units (QPUs) scale toward hundreds of qubits, diagnosing noise-induced correlations (crosstalk) becomes critical for reliable quantum computation. In this work, we introduce Zero-Entropy Classical Shadows (ZECS), a diagnostic tool that uses information of a rank-one quantum state tomography reconstruction from classical shadow information to make a crosstalk diagnosis. We use ZECS on trapped ion and superconductive QPUs including ionq_forte (36 qubits), ibm_brisbane (127 qubits), and ibm_fez (156 qubits), using from 1000 to 6000 samples. With these samples, we use the ZECS to characterize crosstalk among disjoint qubit subsets across the full hardware. This information is then used to select low-crosstalk qubit subsets on ibm_fez for executing the quantum approximate optimization algorithm on a 20-qubit problem. Compared to the best qubit selection via Qiskit transpilation, our method improves solution quality by 10% and increases algorithmic coherence by 33%. ZECS offers a scalable and measurement-efficient approach to diagnosing crosstalk in large-scale QPUs.
015009
Naeimeh Mohseni, Thomas Morstyn, Corey O’Meara, David Bucher, Jonas Nüßlein and Giorgio Cortiana
The formation of energy communities is pivotal for advancing decentralized and sustainable energy management. Within this context, coalition structure generation (CSG) emerges as a promising framework. The complexity of CSG grows rapidly with the number of agents, making classical solvers impractical for even moderate sizes. This suggests CSG as an ideal candidate for benchmarking quantum algorithms against classical ones. Facing ongoing challenges in attaining computational quantum advantage for exact optimization, we pivot our focus to benchmarking quantum and classical solvers for approximate optimization. Approximate optimization is particularly critical for industrial use cases requiring real-time optimization, where finding high-quality solutions quickly is often more valuable than achieving exact solutions more slowly. Our findings indicate that quantum annealing (QA) on DWave can achieve solutions of comparable quality to our best classical solver, but with more favorable runtime scaling, showcasing an advantage. This advantage is observed when compared to solvers, such as Tabu search, simulated annealing, and the state-of-the-art solver Gurobi in finding approximate solutions for energy community formation involving over 100 agents. DWave also surpasses 1-round QAOA on IBM hardware. Our findings represent the largest benchmark of quantum approximate optimizations for a real-world dense model beyond the hardware’s native topology, where D-Wave demonstrates a scaling advantage.
015010
The following article is Open access
Akihiro Mizutani, Shun Kawakami and Go Kato
The decoy-state Bennett–Brassard 1984 (BB84) quantum key distribution (QKD) protocol is widely regarded as the de facto standard for practical implementations. On the receiver side, passive basis choice is attractive because it significantly reduces the need for random number generators and eliminates the need for optical modulators. Despite these advantages, a finite-key analytical security proof for the decoy-state BB84 protocol, where the basis is chosen passively with a biased probability, has been lacking. In this work, we present a simple analytical finite-key security proof for this setting, yielding a closed-form secret-key rate formula that can be directly evaluated using experimentally accessible parameters. Numerical simulations show that the key rates of passive- and active-measurement implementations are nearly identical, indicating that passive measurement does not compromise key-generation efficiency in practical QKD systems.
015011
M Tahir Naseem
Controlling heat flow at the quantum level is essential for the development of next-generation thermal devices. We investigate thermal rectification in a quantum harmonic oscillator coupled to two thermal baths via both single-photon (linear) and two-photon (nonlinear) exchange processes. At low temperatures, rectification emerges from a state-dependent thermal blockade: the cold bath drives the oscillator into low-occupancy states, suppressing two-photon emission and impeding energy flow. At higher temperatures, rectification is governed by the asymmetric scaling of higher-order moments associated with two-photon absorption and emission. We systematically explore various bath coupling configurations and identify the conditions under which nonlinear dissipation leads to directional heat flow. Furthermore, we propose an implementation scheme based on coupling an auxiliary two-level system to the oscillator, enabling effective two-photon dissipation. We also extend our analysis to three-photon processes and show that rectification increases systematically with photon interaction order. These results contribute to the understanding of quantum heat transport in the presence of nonlinear dissipation and may support future efforts in nanoscale thermal rectification design.
015012
The following article is Open access
Diego García-Martín, Paolo Braccia and M Cerezo
Parametrized and random unitary (or orthogonal) n-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as
—the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators
for the symplectic algebra
, consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in
cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t-designs over
. To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.
015013
The following article is Open access
Wolfgang Dür
We propose a quantum computation architecture based on geometries with nearest-neighbor interactions, including e.g. planar structures. We show how to efficiently split the role of qubits into data and entanglement-generation qubits. Multipartite entangled states, e.g. 2D cluster states, are generated among the latter, and flexibly transformed via mid-circuit measurements to multiple, long-ranged Bell states, which are used to perform several two-qubit gates in parallel on data qubits. We introduce planar architectures with n data and n auxiliary qubits that allow one to perform
long-ranged two-qubit gates simultaneously, with only one round of nearest neighbor gates and one round of mid-circuit measurements. We also show that our approach is applicable in existing superconducting quantum computation architectures, with only a constant overhead.
015014
The following article is Open access
K H Kua, Alessio Serafini and Marco G Genoni
According to the Maxwell demon paradigm, additional work can be extracted from a classical or quantum system by exploiting information obtained through measurements on a correlated ancillary system. In the quantum setting, the maximum work extractable via unitary operations in such measurement-assisted protocols is referred to as daemonic ergotropy. In this work, we explore this concept in the context of continuous-variable quantum systems, focusing on Gaussian states and general-dyne (Gaussian) measurements. We derive a general expression for the daemonic ergotropy and examine two key scenarios: (i) bipartite Gaussian states where a general-dyne measurement is performed on one of the two parties, and (ii) open Gaussian quantum systems under continuous general-dyne monitoring of the environment. Remarkably, we show that for single-mode Gaussian states, the ergotropy depends solely on the state’s energy and purity. This enables us to express the daemonic ergotropy as a simple function of the unconditional energy and the purity of the conditional states, revealing that enhanced daemonic work extraction is directly linked to measurement-induced purification. We illustrate our findings through two paradigmatic examples: extracting daemonic work from a two-mode squeezed thermal state and from a continuously monitored optical parametric oscillator. In both case we identify the optimal general-dyne strategies that maximize the conditional purity and, in turn, the daemonic ergotropy.
015015
The following article is Open access
Valentin Guichard, Leonid Vidro, Dario A Fioretto, Petr Steindl, Daniel Istrati, Yehuda Pilnyak, Mathias Pont, Martina Morassi, Aristide Lemaître, Isabelle Sagnes et al
Quantum states of light with many entangled photons are key resources for photonic quantum computing and quantum communication. In this work, we exploit a highly resource-efficient generation scheme based on a linear optical circuit embedding a fibered delay loop acting as a quantum memory. The single photons are generated with a bright single-photon source based on a semiconductor quantum dot, allowing to perform the entangling scheme up to 6 photons. We demonstrate 2, 3, 4 and 6-photon entanglement generation at respective rates of 6 kHz, 120 Hz, 2.2 Hz, and 2 mHz, corresponding to an average scaling ratio of 46. We introduce a method for real-time control of entanglement generation based on partially post-selected measurements. The visibility of such measurements enables discrimination and correcting for experimental phase drifts or entangling gate fidelity variations, and thus carries faithful information to monitor the entanglement process, an important feature for the practical implementation of photonic measurement-based quantum computation.
015016
Carlos Barahona-Pascual, Hong Jiang, Alan C Santos and Juan José García-Ripoll
This work introduces a theoretical framework to model the collective dynamics of quantum emitters in highly non-Markovian environments, interacting through the exchange of photons with significant retardations. The formalism consists on a set of coupled delay differential equations for the emitter’s raising/lowering operators
, supplemented by input–output relations that describe the field mediating the interactions. These equations capture the dynamics of both linear (bosonic) and nonlinear (two-level) emitter arrays. It is exact in some limits—e.g. bosonic emitters or generic systems with up to one collective excitation—and can be integrated to provide accurate results for larger numbers of photons. These equations support a study of collective spontaneous emission of emitter arrays in open waveguide-QED environments. This study uncovers an effect we term cascaded super- and sub-radiance, characterized by light-cone-limited propagation and increasingly correlated photon emission across distant emitters. The collective nature of this dynamics for two-level systems is evident both in the enhancement of collective emission rates, as well as in a superradiant burst with a faster than linear growth. While these effects should be observable in existing circuit QED devices or slight generalizations thereof, the formalism put forward in this work can be extended to model other systems such as network of quantum emitters or the generation of correlated photon states.
015017
The following article is Open access
Naman Jain and Amir Kalev
We introduce quantum feature extraction (QuFeX), a novel quantum machine learning module. The proposed module enables feature extraction in a reduced-dimensional space, significantly decreasing the number of parallel evaluations required in typical quantum convolutional neural network (NNs) architectures. Its design allows seamless integration into deep classical NNs, making it particularly suitable for hybrid quantum–classical models. As an application of QuFeX, we propose Qu-Net—a hybrid architecture which integrates QuFeX at the bottleneck of a U-Net architecture. The latter is widely used for image segmentation tasks such as medical imaging and autonomous driving. Our numerical analysis indicates that the Qu-Net can achieve superior segmentation performance compared to a U-Net baseline. These results highlight the potential of QuFeX to enhance deep NNs by leveraging hybrid computational paradigms, providing a path towards a robust framework for real-world applications requiring precise feature extraction.
015018
The following article is Open access
Fabrizio Sgobba, Francesco Di Lena, Danilo Triggiani, Deborah Katia Pallotti, Cosmo Lupo, Piergiorgio Daniele, Gennaro Fratta, Giulia Acconcia, Ivan Rech and Luigi Santamaria Amato
We demonstrate an experimental scheme for high-precision position measurements based on transverse-momentum-resolved two-photon interferometry with independent photons and single photon avalanche diode (SPAD) arrays. Our scheme extends the operative range of Hong–Ou–Mandel interferometry beyond its intrinsic constraints due to photons indistinguishability, paving the way to applications in high-resolution imaging. We assess the experimental results against the ultimate precision bounds as determined by quantum estimation theory. Our experiment ultimately proves that transverse-momentum resolved measurements of fourth-order correlations in the fields can be employed to overcome spatial distinguishability between independent photons. The relevance of our results extends beyond sensing and imaging towards quantum information processing, as we show that partial photon distinguishability and entanglement impurity are not necessarily a nuisance in a technique that relies on two-photon interference.
015019
The following article is Open access
J Settino, G G Luciano, A Di Bartolomeo, P Silvestrini, M Lisitskiy, B Ruggiero and F Romeo
We investigate the influence of topology on the magnetic response of inductively coupled superconducting flux-qubit networks. Using exact diagonalization methods and linear response theory, we compare the magnetic response of linear and cross-shaped array geometries, used as paradigmatic examples. We find that the peculiar coupling matrix in cross-shaped arrays yields a significant enhancement of the magnetic flux response compared to linear arrays, this network-topology effect arising from cooperative coupling among the central and the peripheral qubits. These results establish quantitative design criteria for function-oriented superconducting quantum circuits, with direct implications for advancing performance in both quantum sensing and quantum information processing applications. Concerning the latter, by exploiting the non-linear and high-dimensional dynamics of such arrays, we demonstrate their suitability for quantum reservoir computing technology. This dual functionality suggests a novel platform in which the same device serves both as a quantum-limited electromagnetic sensor and as a reservoir capable of signal processing, enabling integrated quantum sensing and processing architectures.
015020
The following article is Open access
Florian Lange, Lukas Heunisch, Holger Fehske, David P DiVincenzo and Michael J Hartmann
Cross-talk between qubits is one of the main challenges for scaling superconducting quantum processors. Here, we use the density-matrix renormalization group to numerically analyze lattices of superconducting qubits from a perspective of many-body localization. Specifically, we compare different architectures that include tunable couplers designed to decouple qubits in the idle state, and calculate the residual ZZ interactions as well as the inverse participation ratio in the computational basis states. For transmon qubits outside of the straddling regime, the results confirm that tunable C-shunt flux couplers are significantly more efficient in mitigating the ZZ interactions than tunable transmons. A recently proposed fluxonium architecture with tunable transmon couplers is demonstrated to also maintain its strong suppression of the ZZ interactions in larger systems, while having a higher inverse participation ratio in the computational basis states than lattices of transmon qubits. Our results thus suggest that fluxonium architectures may feature lower cross talk than transmon lattices when designed to achieve similar gate speeds and fidelities.
015021
The following article is Open access
Haiyue Kang, Younghun Kim, Eromanga Adermann, Martin Sevior and Muhammad Usman
Errors in the current generation of quantum processors pose a significant challenge towards practical-scale implementations of quantum machine learning (QML) as they lead to trainability issues arising from noise-induced barren plateaus, as well as performance degradations due to the noise accumulation in deep circuits even when QML models are free from barren plateaus. Quantum error correction (QEC) protocols are being developed to overcome hardware noise, but their extremely high spacetime overheads, mainly due to magic state distillation, make them infeasible for near-term practical implementation. This work proposes the idea of partial QEC for QML models and identifies a sweet spot where distillations are omitted to significantly reduce overhead. By assuming error-corrected two-qubit Controlled-Zs (Clifford operations), we demonstrate that the QML models remain trainable even when single-qubit gates are subjected to
depolarizing noise, corresponding to a gate error rate of
under randomized benchmarking. Further analysis based on various noise models, such as phase-damping and thermal-dissipation channels at low temperature, indicates that the QML models are trainable independent of the mean angle of over-rotation, or can even be improved by thermal damping that purifies a quantum state away from depolarizations. While it may take several years to build quantum processors capable of fully fault-tolerant QML, our work proposes a resource-efficient solution for trainable and high-accuracy QML implementations in noisy environments.
015022
Giovanni Scala, Anindita Bera and Gniewomir Sarbicki
We compute all third-order local invariants accessible via randomized measurements and employ them to derive separability criteria. The reconstruction of the invariants yields experimentally accessible entanglement criteria for multipartite states with arbitrary local dimensions. The results show that third-order invariants capture inter-subsystem correlations beyond second-order spectral criteria within more feasible entanglement detection protocols than full tomography. As an example, for Werner states in d = 3, the entanglement is detected for
for the second-order correlations and it is improved to
at the third-order.
015023
Michelle Wynne Sze, Yao Tang, Silas Dilkes, David Muñoz Ramo, Ross Duncan and Nathan Fitzpatrick
The linear combination of unitaries (LCU) method has proven to scale better than existing product formulas in simulating long time Hamiltonian dynamics. However, given the number of multi-control gate operations in the standard prepare-select-unprepare architecture of LCU, it is still resource-intensive to implement on the current quantum computers. In this work, we demonstrate LCU implementations on an ion trap quantum computer for calculating squared overlaps
of time-evolved states. This is achieved by an optimized LCU method, based on pre-selecting relevant unitaries, coupled with a compilation strategy which makes use of quantum multiplexor gates, leading to a significant reduction in the depth and number of two-qubit(2Q) gates in circuits. For L Pauli strings in a Taylor series expanded n-qubit-mapped time evolution operator, we find a 2Q gate count of
. We test this approach by simulating a Rabi–Hubbard Hamiltonian.
015024
The following article is Open access
Rishi Goel, Casey R Myers and Sally Shrapnel
Modern machine learning (ML) methods typically fail to adequately capture causal information. Consequently, such models do not handle data distributional shifts, are vulnerable to adversarial examples, and often learn spurious correlations (Schölkopf and von Kügelgen 2022 (arXiv:2204.00607) [cs.AI]). Causal ML, or causal inference, aims to solve these issues by estimating the expected outcome of counterfactual events, using observational and/or interventional data, where causal relationships are typically depicted as directed acyclic graphs. It is an open question as to whether these causal algorithms provide opportunities for quantum enhancement. In this paper we consider a recently developed family of non-parametric, continuous causal estimators and derive quantum algorithms for these tasks. Kernel evaluation and large matrix inversion are critical sub-routines of these classical algorithms, which makes them particularly amenable to a quantum treatment. Unlike other quantum ML algorithms, closed form solutions for the estimators exist, negating the need for gradient evaluation and variational learning. We describe several new hybrid quantum–classical algorithms and show that uniform consistency of the estimators is retained. Furthermore, if one is satisfied with a quantum state output that is proportional to the true causal estimand, then these algorithms inherit the exponential complexity advantages given by quantum linear system solvers.
015025
The following article is Open access
Felix Huber and Jens Siewert
In a seminal article, Higuchi and Sudbery showed that a pure four-qubit state cannot be maximally entangled across every bipartition. Such states are now known as absolutely maximally entangled (AME) states. Here we give a series of old and new proofs of the fact that no four-qubit AME state exists. These are based on invariant theory, methods from coding theory, and basic properties from linear algebra such as the Pauli commutation relations.
015026
The following article is Open access
Nicolas Dirnegger, Moein Malekakhlagh, Vikesh Siddhu, Ashutosh Rao, Chi Xiong, Muir Kumph, Jason Orcutt and Abram Falk
A promising quantum computing architecture comprises modules of superconducting quantum processors linked via optical channels using quantum transducers. As quantum transducer hardware improves, a need has arisen to understand the quantitative relationship between transducer-device characteristics and the strength of the resulting remote entanglement. Using Monte Carlo simulations that incorporate 2-to-1 and 3-to-1 entanglement distillation methods, our model maps transducer device performance up to system-level channel performance, thereby allowing the performance of remote entanglement approaches to be compared and optimized. We find the extreme photon loss (EPL) distillation protocol to be particularly high performing. Moreover, even without distillation, present-day transducers with added noise of
photons are at the threshold of enabling remote Bell pairs with fidelities exceeding 50%. If the next generation of transducers can improve by 3 orders of magnitude in added noise, efficiency, and repetition rates, then they would allow for remote two-qubit gates achieving 99.7% fidelities at MHz rates. These results set practical targets for transducers to be ready for deployment into modular quantum computing systems.
015027
The following article is Open access
Maria-Andreea Filip and Nathan Fitzpatrick
We consider a quantum algorithm for ground-state preparation based on a Chebyshev series approximation to the wall function. In a classical setting, this approach is appealing as it guarantees rapid convergence. We analyse the asymptotic scaling and success probabilities of different quantum implementations and provide numerical benchmarks, comparing the performance of the wall-Chebyshev projectors with current state-of-the-art approaches. We find that this approach requires fewer serial applications of the Hamiltonian oracle to achieve a given ground state fidelity, but is severely limited by exponentially decaying success probability. However, we find that some implementations maintain non-trivial success probability in regimes where wall-Chebyshev projection leads to a fidelity improvement over other approaches. As the wall-Chebyshev projector is highly robust to loose known upper bounds on the true ground state energy, it offers a potential resource trade-off, particularly in the early fault-tolerant regime of quantum computation.
015028
The following article is Open access
Danilo Triggiani and Cosmo Lupo
The Rayleigh diffraction limit imposes a fundamental restriction on the resolution of direct imaging systems, hindering the identification of incoherent optical sources, such as celestial bodies in astronomy and fluorophores in bioimaging. Recent advances in quantum sensing have shown that this limit can be circumvented through spatial demultiplexing (SPADE) and photon detection, i.e. a semi-classical detection strategy. However, the general optimality for arbitrary intensity distributions and bright sources remains unproven. In this work, we develop a general model for incoherent light with arbitrary intensity undergoing diffraction. We employ this framework to compute the quantum Chernoff exponent for generic incoherent-source discrimination problems, focusing on the sub-diffraction regime. We show that, surprisingly, SPADE measurements saturate the quantum Chernoff bound only when certain compatibility conditions are met. These findings suggest that collective measurements may actually be needed to achieve the ultimate quantum Chernoff bound for the discrimination of specific incoherent sources. For the fully general case, our analysis can still be used to find the best SPADE configurations, generally achieved through a rotation of the SPADE interferometer that depends on the discrimination task. We also simulated the efficiency of a simplified Bayesian test that we developed for this identification task and show that the saturation of the Chernoff bound is already achieved for a finite number of repetitions
. Our results advance the theory of quantum-limited optical discrimination, with possible applications in diagnostics, automated image interpretation, and galaxy identification.
015029
The following article is Open access
Alon Levi, Ziv Ossi, Eliahu Cohen and Amit Te’eni
A hybrid quantum–classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subsequent quantum operations. These algorithms are especially valuable in the noisy intermediate-scale quantum era, where quantum resources are constrained and classical optimization plays a central role. Here, we improve the performance of a hybrid algorithm through principled, information-theoretic optimization. We focus on Quantum Likelihood Estimation (QLE)–-a hybrid algorithm designed to identify the Hamiltonian governing a quantum system by iteratively updating a weight distribution based on measurement outcomes and Bayesian inference. While QLE already achieves convergence using quantum measurements and Bayesian inference, its efficiency can vary greatly depending on the choice of parameters at each step. We propose an optimization strategy that dynamically selects the initial state, measurement basis, and evolution time in each iteration to maximize the mutual information between the measurement outcome and the true Hamiltonian. This approach builds upon the information-theoretic framework recently developed in Te’eni et al (2024 arXiv:2409.15549), and leverages mutual information as a guiding cost function for parameter selection. Our implementation employs a simulated annealing routine to minimize the conditional von Neumann entropy, thereby maximizing information gain in each iteration. The results demonstrate that our optimized version significantly reduces the number of iterations required for convergence, thus proposing a practical method for accelerating Hamiltonian learning in quantum systems. Finally, we propose a general scheme that extends our approach to solve a broader family of quantum learning problems.
015030
The following article is Open access
Leander Grech, Matthias G Krauss, Mirko Consiglio, Tony J G Apollaro, Christiane P Koch, Simon Hirlaender and Gianluca Valentino
Noisy intermediate-scale quantum computers hold the promise of tackling complex and otherwise intractable computational challenges through the massive parallelism offered by qubits. Central to realizing the potential of quantum computing are perfect entangling (PE) two-qubit gates, which serve as a critical building block for universal quantum computation. In the context of quantum optimal control, shaping electromagnetic pulses to drive quantum gates is crucial for pushing gate performance toward theoretical limits. In this work, we leverage reinforcement learning (RL) techniques to discover near-optimal pulse shapes that yield PE gates. A collection of RL agents is trained within robust simulation environments, enabling the identification of effective control strategies even under noisy conditions. Selected agents are then validated on higher-fidelity simulations, illustrating how RL-based methods can reduce calibration overhead when compared to quantum optimal control techniques. Furthermore, the RL approach is hardware agnostic with the potential for broad applicability across various quantum computing platforms.
015031
The following article is Open access
Asghar Ullah, Özgür E Müstecaplıoğlu and Matteo G A Paris
We investigate the optimization of graph topologies for quantum sensing networks designed to estimate weak magnetic fields. The sensors are modeled as spin systems governed by a transverse-field Ising Hamiltonian in thermal equilibrium at low temperatures. Using a genetic algorithm (GA), we evolve network topologies to maximize a perturbative spectral sensitivity measure, which serves as the fitness function for the GA. For the best-performing graphs, we compute the corresponding quantum Fisher information (QFI) to assess the ultimate bounds on estimation precision. To enable efficient scaling, we use the GA-generated data to train a deep neural network, allowing extrapolation to larger graph sizes where direct computation becomes prohibitive. Our results show that while both the fitness function and QFI initially increase with system size, the QFI exhibits a clear non-monotonic behavior—saturating and eventually declining beyond a critical graph size. This reflects the loss of superlinear scaling of the QFI, as the narrowing of the energy gap signals a crossover to classical scaling of the QFI with system size. The effect is reminiscent of the microeconomic law of diminishing returns: beyond an optimal graph size, further increases yield reduced sensing performance. This saturation and decline in precision are particularly pronounced under Kac scaling, where both the QFI and spin squeezing plateau or degrade with increasing system size. We also attribute observed even–odd oscillations in the spectral sensitivity measure and QFI to quantum interference effects in spin phase space, as confirmed by our phase-space analysis. These findings highlight the critical role of optimizing interaction topology—rather than simply increasing network size—and demonstrate the potential of hybrid evolutionary and learning-based approaches for designing high-performance quantum sensors.
015032
The following article is Open access
Xuan Zuo, Zi-Xu Lu and Jie Li
The strong coupling between light and matter gives rise to polaritons. Further coupling polaritons to phonons leads to the formation of hybrid polaromechanical systems. Recent experiments have achieved the strong coupling between polaritons and phonons in two configurations, namely, the magnon–photon–phonon and exciton–photon–phonon systems, which enables the control of mechanical motion via manipulating polaritons. Here, we present a polaromechanical cooling theory and explicitly show how two polaritons can be used to simultaneously cool two mechanical modes. The unique advantage of our protocol lies in the fact that the continuous tunability of the polariton frequencies over a wide range allows for the cooling of any two mechanical modes with their frequency difference falling within this range. We further discuss how to extend the theory to cool multiple mechanical modes. The protocol is designed for cooling mechanical motion in various emerging polaromechanical platforms, such as magnon-, exciton-, and plasmon-polaromechanical systems, which is the first step towards quantum states generation in these hybrid systems.
015033
The following article is Open access
Christopher Mastandrea, Costin Iancu, Hao Guo and Chih-Chun Chien
A spin-1 system can exhibit an intermediate-temperature topological regime with a quantized Uhlmann phase sandwiched by topologically trivial low- and high-temperature regimes. We present a quantum circuit consisting of system and ancilla qubits plus a probe qubit which prepares an initial state corresponding to the purified state of a spin-1 system at finite temperature, evolves the system according to the Uhlmann process, and measures the Uhlmann phase via expectation values of the probe qubit. Although classical simulations suggest the quantized Uhlmann phase is observable on International Business Machines (IBM’s) noisy intermediate-scale quantum (NISQ) computers, an implementation of the circuit without any optimization exceeds the gate count for the error budget and results in unresolved signals. Through a series of optimization with Qiskit and BQSKit, the gate count can be substantially reduced, making the jumps of the Uhlmann phase more visible. A recent hardware upgrade of IBM quantum computers further improves the signals and leads to a clearer demonstration of interesting finite-temperature topological phenomena on NISQ hardware.
015034
Dmitrii Khitrin, Kenneth R Brown and Abhinav Anand
Unitary errors, such as those arising from fault-tolerant (FT) compilation of quantum algorithms, systematically bias observable estimates. Correcting this bias typically requires additional resources, such as an increased number of non-Clifford gates. In this work, we present an alternative method for correcting bias in the expectation values of observables. The method leverages a decomposition of the ideal quantum channel into a probabilistic mixture of noisy quantum channels. Using this decomposition, we construct unbiased estimators as weighted sums of expectation values obtained from the noisy channels. We provide a detailed analysis of the method, identify the conditions under which it is effective, and validate its performance through numerical simulations. In particular, we demonstrate unbiased observable estimation in the presence of unitary errors by simulating the time dynamics of the Ising Hamiltonian. Our strategy offers a resource-efficient way to reduce the impact of unitary errors, improving methods for estimating observables in noisy near-term quantum devices and FT implementation of quantum algorithms.
015035
The following article is Open access
Qiaofeng Liu, Ian Low and Zhewei Yin
015036
The following article is Open access
Mu-En Liu, Kai-Siang Chen, Chung-Yun Hsieh, Gelo Noel M Tabia and Yeong-Cherng Liang
Generic bipartite pure states of sufficiently large dimensions are overwhelmingly likely to be highly entangled. However, unlike the bipartite setting, the entanglement of generic multipartite pure states, and specifically their multipartite marginals, is far less understood. Here, we show that sufficiently large marginals of generic multipartite pure states, accounting for approximately half or more of the subsystems, are entangled across all bipartitions. These pure states are thus robust to losses in entanglement distribution. Moreover, even without assuming that the global state is pure, a small number of overlapping entangled marginals of generic pure states—as we show in this work—must induce entanglement in other marginals when some mild dimension constraints are satisfied, i.e. entanglement transitivity is a generic feature of various many-body pure states. Numerically, we further observe that the genericity of (1) entangled marginals, (2) unique global compatibility, and (3) entanglement transitivity may also hold beyond the analytically established dimension constraints. We also discuss potential applications of these features of generic pure states in quantum information processing.
015037
The following article is Open access
Jiheon Seong, Anindita Bera, Beatrix C Hiesmayr, Dariusz Chruściński and Joonwoo Bae
Entanglement witnesses (EWs) are a versatile tool to detect entangled states and characterize related properties of entanglement in quantum information theory. The verification of entangled states via EWs relies on the fact that separable states form a convex set; this also means that the framework presented by EWs generally applies to other quantum resources where free resources contain the convexity. A witness W corresponds to an observable satisfying
for all separable states
; entangled states are detected once the inequality is violated. Recently, mirrored EWs have been introduced by showing that there exist non-trivial upper bounds to EWs,
An upper bound to a witness W signifies the existence of the other one M, called a mirrored EW, such that
. The framework of mirrored EWs shows that a single EW can be even more useful, as it can detect a larger set of entangled states by lower and upper bounds. In this work, we develop and investigate mirrored EWs for multipartite qubit states and also for high-dimensional systems, to find the efficiency and effectiveness of mirrored EWs in detecting entangled states. We provide mirrored EWs for n-partite GHZ states, graph states such as two-colorable states and tripartite bound entangled states. We also show that optimal EWs can be reflected with each other. For bipartite systems, we present mirrored EWs for existing optimal EWs and also construct a mirrored pair of optimal EWs in dimension three. Finally, we generalize mirrored EWs such that a pair of EWs can be connected by another EW, i.e.
is also an EW. Our results enhance the capability of EWs to detect a larger set of entangled states in multipartite and high-dimensional quantum systems.
015038
Himanshu Badhani, Dhanuja GS, Swati Choudhary, Vishal Anand and Siddhartha Das
The erasure of information is fundamentally an irreversible logical operation, carrying profound consequences for the energetics of computation and information processing. We investigate the thermodynamic costs associated with erasing (and preparing) quantum processes. Specifically, we analyze an arbitrary bipartite unitary gate acting on logical and ancillary input-output systems, where the ancillary input is always initialized in the ground state. We focus on the adversarial erasure cost of the reduced dynamics—that is, the minimal thermodynamic work cost to erase the logical output of the gate for any logical input, assuming full access to the ancilla but no access to any purifying reference of the logical input state. We determine that this adversarial erasure cost is directly proportional to the negative min-entropy of the reduced dynamics, thereby giving the dynamical min-entropy a clear operational meaning. The dynamical min-entropy can take positive and negative values, depending on the underlying quantum dynamics. The negative value of the erasure cost implies that the extraction of thermodynamic work is possible instead of its consumption during the process. A key foundation of this result is the quantum process decoupling theorem, which quantitatively relates the decoupling ability of a process with its min-entropy. This insight bridges thermodynamics, information theory, and the fundamental limits of quantum computation.
015039
Ji-Qian Qin, Yunlong Yu and Xiang-Bin Wang
015040
The following article is Open access
Alejandro Villoria, Henning Basold and Alfons Laarman
Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum hardware, and has the potential to significantly improve their performance when optimisation techniques are added to the process. One such optimisation technique is reducing the number of quantum gates that are needed to execute a circuit. For instance, methods for reducing the number of non-Clifford gates or CNOT gates from a circuit are an extensive research area that has gathered significant interest over the years. For certain hardware platforms such as trapped-ion quantum computers, we can leverage some of their special properties to further reduce the cost of executing a quantum circuit in them. In this work we use global interactions, such as the Global Mølmer–Sørensen (MS) gate present in trapped-ion hardware, to optimise and synthesise quantum circuits. We design and implement an algorithm that is able to compile an arbitrary quantum circuit into another circuit that uses global gates as the entangling operation, while optimising the number of global interactions needed. The algorithm is based on the ZX-calculus and uses a specialised circuit extraction routine that groups entangling gates into Global MS gates. We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations in comparison to a naive algorithm and the Qiskit optimiser.
015041
The following article is Open access
Félix Hoffet, Alexey Vylegzhanin, Emanuele Distante, Lukas Heller, Síle Nic Chormaic and Hugues de Riedmatten
A promising platform for quantum information research relies on cavity coupled atomic spin-waves, enabling efficient operations such as quantum memories, quantum light generation and entanglement distribution. In this work, we study the strong coupling between non-classical collective spin excitations generated by Raman scattering in a cold
atomic ensemble, and a single cavity mode. We report on an intracavity spin wave to single photon conversion efficiency of up to
in the quantum domain, as evidenced by a violation of the Cauchy–Schwarz inequality. Our work establishes a relationship between the retrieval of an atomic spin wave in the non-classical regime and the vacuum Rabi splitting. We show that this relationship emerges within the efficiency spectrum, and we finally provide the optimal operational conditions to achieve the maximum intrinsic retrieval efficiency. Our data is well reproduced by simulations based on optical Bloch equations. This work deepens the understanding of cavity-enhanced spin wave readout and its potential applications.
015042
The following article is Open access
Árpád Lukács, Róbert Trényi, Tamás Vértesi and Géza Tóth
We discuss efficient methods to optimize the metrological performance over local Hamiltonians in a bipartite quantum system. For a given quantum state, our methods find the best local Hamiltonian for which the state outperforms separable states the most from the point of view of quantum metrology. We show that this problem can be reduced to maximizing the quantum Fisher information over a certain set of Hamiltonians. We present the quantum Fisher information in a bilinear form and maximize it by an iterative see-saw method, in which each step is based on semidefinite programming. We also solve the problem with the method of moments that works very well for smaller systems. Our approach is one of the efficient methods that can be applied for an optimization of the unitary dynamics in quantum metrology, the other methods being, for example, machine learning, variational quantum circuits, or neural networks. The advantage of our method is the fast and robust convergence due to the simple mathematical structure of the approach. We also consider a number of other problems in quantum information theory that can be solved in a similar manner. For instance, we determine the bound entangled quantum states that maximally violate the computable cross norm-realignment criterion.
015043
The following article is Open access
Jaromír Fiurášek
Entanglement of continuous-variable Gaussian states can be distilled by combination of de-Gaussifying operation such as single-photon subtraction and iterative heralded Gaussification. Here we present and analyze a simplified equivalent version of such entanglement distillation protocol, where the Gaussian measurements utilized in heralded Gaussification are eliminated and are absorbed into the preparation of suitable input Gaussian states of the simplified protocol. The simplified scheme contains less detectors and its overall success probability increases in comparison with the original scheme, while producing completely equivalent outputs. Our simplification of the entanglement distillation protocol closely parallels the recently proposed simplification of a scheme for breeding optical single-mode Gottesman–Kitaev–Preskill states (Aghaee Rad et al 2025 Nature638 912 ). We investigate operation of the simplified entanglement distillation scheme for both pure and mixed input states and clarify how multicopy distillation of Gaussian entanglement emerges in a setup without any heralding Gaussian measurements.
015044
The following article is Open access
Dávid Szász-Schagrin, Daniele Cristani, Lorenzo Piroli and Eric Vernier
We provide a systematic construction for local quantum circuits hosting free fermions in disguise (FFD), both with staircase and brickwork architectures. Similar to the original Hamiltonian model introduced by Fendley, these circuits are defined by the fact that the Floquet operator corresponding to a single time step can not be diagonalized by means of any Jordan–Wigner transformation, but still displays a free-fermionic spectrum. Our construction makes use of suitable non-local transfer matrices commuting with the Floquet operator, allowing us to establish the free fermionic spectrum. We also study the dynamics of these circuits after they are initialized in arbitrary product states, proving that the evolution of certain local observables can be simulated efficiently on classical computers. Our work proves recent conjectures in the literature and raises new questions on the classical simulability of FFD.
015045
Wei-Bin Chen, Ding Fang, Cheng-Hao Zhang, Jin-Ming Cui, Yun-Feng Huang, Chuan-Feng Li and Guang-Can Guo
Trapped ions in micro-cavities constitute a key platform for advancing quantum information processing and quantum networking. By providing an efficient light–matter interface within a compact architecture, they serve as highly efficient quantum nodes with strong potential for a scalable quantum network. However, in such systems, ion trapping stability is often compromised by surface charging effects, and nearby dielectric materials are known to cause a dramatic increase in the ion heating rate by several orders of magnitude. These challenges significantly hinder the practical implementation of ion trap systems integrated with micro-cavities. To overcome these limitations, we present the design and fabrication of metal-shielded fiber-cavity mirrors, enabling the stable realization of ion trap systems integrated with fiber cavities. Using this method, we constructed a needle ion trap integrated with a fiber Fabry–Pérot cavity and successfully achieved stable trapping of a single ion within the cavity. The measured ion heating rate was reduced by more than an order of magnitude compared with unshielded configurations. This work establishes a key technique toward fully integrated ion–photon interfaces for scalable quantum networks.
015046
The following article is Open access
Hiroyoshi Kurogi, Katsuhiro Endo, Yuki Sato, Michihiko Sugawara, Kaito Wada, Kenji Sugisaki, Shu Kanno, Hiroshi C Watanabe and Haruyuki Nakano
In variational quantum algorithms (VQAs), parameterization is typically applied to single-qubit gates. In this study, we instead parameterize a generalized controlled gate and propose an algorithm to locally minimize the cost function by maximally optimizing these parameters. This method extends the free quaternion selection technique, which was originally developed for single-qubit gate optimization. To evaluate its performance, we apply the proposed method to a variety of quantum optimization tasks, including the variational quantum eigensolver for both Ising and molecular Hamiltonians, fidelity maximization in general VQAs, and unitary compilation of time evolution operators. Across these applications, our method demonstrates efficient optimization, enhanced expressibility, and the ability to construct shallower circuits compared to existing techniques. Moreover, the method can be generalized to optimize particle-number-conserving gates, which are particularly relevant for quantum chemistry. Leveraging this capability, we further demonstrate that the method achieves superior quantum compilation of molecular time-evolution operators by approximating them with shallower circuits than standard Trotter decomposition.
015047
The following article is Open access
Mitchell J Walker, Ryuji Moriya, Jack D Segal, Liam A P Gallagher, Matthew Hill, Frédéric Leroux, Zhongxiao Xu and Matthew P A Jones
015048
Yan Lu and Xiao-Feng Shi
Large-scale Greenberger–Horne–Zeilinger (GHZ) state is useful for quantum technologies but difficult to be prepared. Here, we propose fast measurement-based preparation of large-scale GHZ states by a four-qubit quantum phase gate with nuclear-spin qubits of alkaline-earth-like atoms, which is named as quantum ferromagnetic gate due to its analogy to the alignment of molecular magnetic moments in a classical magnet. A high-fidelity Rydberg-mediated QFG can be realized in a time of
with
the maximal Rydberg Rabi frequency. From a product state of three data atoms and one ancilla atom, a gluing circuit with one QFG, two single-qubit gates, and a projective measurement of the ancilla can generate a 3-qubit GHZ state, and repetition of this gluing circuit can lead to 9, 27, 81, 243
-qubit GHZ states. Analyses based on currently available techniques show that a 243-qubit GHZ state is realizable, and more qubits can be entangled with higher detection fidelity.
015049
The following article is Open access
Reyhaneh Aghaei Saem, Behrang Tafreshi, Zoë Holmes and Supanut Thanasilp
Identifying scalable circuit architectures remains a central challenge in variational quantum computing and quantum machine learning. Many approaches have been proposed to mitigate or avoid the barren plateau phenomenon or, more broadly, exponential concentration. However, due to the intricate interplay between quantum measurements and classical post-processing, we argue these techniques often fail to circumvent concentration effects in practice. Here, by analyzing concentration at the level of measurement outcome probabilities and leveraging tools from hypothesis testing, we develop a practical framework for diagnosing whether a parameterized quantum model is inhibited by exponential concentration. Applying this framework, we argue that several widely used methods (including quantum natural gradient, sample-based optimization, and certain neural-network-inspired initializations) do not overcome exponential concentration with finite measurement budgets, though they may still aid training in other ways.
015050
The following article is Open access
Özlem Erkılıç, Matthew S Winnel, Aritra Das, Sebastian Kish, Ping Koy Lam, Jie Zhao and Syed M Assad
Quantum communication enables secure information transmission and entanglement distribution, but these tasks are fundamentally limited by the capacities of quantum channels. While quantum repeaters can mitigate losses and noise, entanglement swapping via a central node is ineffective against the Pauli dephasing channel due to degradation from Bell-state measurements. This suggests that purifying distributed Bell states before entanglement swapping is necessary. Although one-way hashing codes are known to saturate the dephasing channel capacity, no explicit two-way purification protocol has previously been shown to achieve this bound. In this work, we present a two-way entanglement purification protocol with an explicit, scalable circuit that asymptotically achieves the dephasing channel capacity. With each iteration, the fidelity of Bell states increases. At the final round, the residual dephasing error is suppressed doubly-exponentially, scaling as
, enabling near-perfect Bell pairs for any fixed number of purification rounds n. The explicit circuit we propose is versatile and applicable to any number of Bell pairs, offering a practical solution for mitigating decoherence in quantum networks and distributed quantum computing.
015051
The following article is Open access
Dingjie Lu, Zhao Wang, Jun Liu, Yangfan Li, Wei-Bin Ewe and Zhuangjian Liu
This paper introduces a quantum-enhanced finite element method (FEM) designed for noisy intermediate-scale quantum (NISQ) devices, leveraging variational quantum algorithms (VQAs) to solve engineering partial differential equations. We demonstrate the framework by solving the Euler–Bernoulli beam and the NAFEMS T4 heat transfer problems, which involve Dirichlet, Neumann, and Robin boundary conditions. A key innovation is a ‘set-to-zero’ strategy that incorporates boundary conditions through a correction matrix,
, allowing for flexible imposition at any node without domain decomposition. The global stiffness matrix is decomposed into a constant number of Pauli terms, O(1), using the method by Sato et al while boundary terms are handled with a sublinearly scaling partial Pauli measurement technique. The algorithm achieves logarithmic qubit scaling (
qubits for N degrees of freedom(DOF)) and employs shallow, hardware-efficient circuits with empirically trainable depth for small-scale systems. Validation on the Qiskit statevector simulator shows high accuracy. For the Euler–Bernoulli beam problem with 4 to 64 DOF, the algorithm achieves relative errors of 0.5%–1.5% and fidelities of 0.998–0.999. For the NAFEMS T4 heat transfer benchmark, a 5.4% relative error is observed. The VQA converges robustly within 77–350 iterations, though barren plateaus are a known challenge for scaling to larger systems. This work establishes a scalable framework for quantum FEM, offering a significant memory advantage over classical methods and advancing the potential for quantum-enhanced engineering simulations.
015052
The following article is Open access
Soorya Rethinasamy, Ethan Guo, Alexander Wei, Mark M Wilde and Kristina D Launey
With a view toward addressing the explosive growth in the computational demands of nuclear structure and reactions modeling, we develop a novel quantum algorithm for neutron–nucleus simulations with general potentials, which provides acceptable bound-state energies even in the presence of noise, through the noise-resilient (NR) training method. In particular, the algorithm can now solve for any band-diagonal to full Hamiltonian matrices, as needed to accommodate a general central potential. While we illustrate the approach for exponential Gaussian-like potentials and ab initio inter-cluster potentials (optical potentials), it can also accommodate the complete form of the chiral effective-field-theory nucleon–nucleon potentials used in ab initio nuclear calculations. In this study, we provide a comprehensive analysis for the efficacy of this approach for three different qubit encodings, including the one-hot, binary, and Gray encodings, in terms of the number of Pauli strings and commuting sets involved. We also discuss the advantages of the algorithm for Hamiltonians of various band-diagonal widths, especially critical for potentials of perturbative nature, leading to a drastically reduced runtime of quantum simulations. We prove that the Gray encoding allows for an efficient scaling of the model-space size N (or number of basis states used) and is more resource efficient for band-diagonal Hamiltonians having bandwidth up to N. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity (QC) scheme. We lay out the explicit grouping of Pauli strings and the diagonalizing unitary under the DGC scheme, and we prove that it outperforms the QC scheme, at the cost of a more complex diagonalizing unitary. Lastly, we provide first solutions of the neutron–alpha dynamics from quantum simulations suitable for noisy intermediate-scale quantum processors, using an optical potential rooted in first principles, as well as a study of the bound-state physics in neutron–Carbon systems, along with a comparison of the efficacy of the one-hot and Gray encodings.
015053
Alejandro D Bendersky, Sergio S Gomez and Rodolfo H Romero
We studied the dynamics of a pair of single-electron double quantum dots (DQDs) under longitudinal and transverse static magnetic fields and time-dependent harmonic modulation of their interaction couplings. We propose to modulate the tunnel coupling between the QDs to produce one-qubit gates and the exchange coupling between DQDs to generate entangling gates, the set of operations required for quantum computing. We developed analytical approximations to set the conditions to control the qubits and applied them to numerical calculations to test the accuracy and robustness of the analytical model. The results shows that the unitary evolution of the two-electron state performs the designed operations even under conditions shifted from the ideal ones.
015054
The following article is Open access
Alena Romanova and Wolfgang Dür
We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing standard qubit measurement patterns to the qudit cluster state is suboptimal in most dimensions, so that alternative qudit resource states could enable enhanced computational efficiency. In these resources, the entangling interaction is a block-diagonal Clifford operation rather than the usual controlled-phase gate for cluster states. This simple change has remarkable consequences: the applied entangling operation determines an intrinsic single-qudit gate associated with the resource that drives the quantum computation when performing single-qudit measurements on the resource state. We prove a condition for the intrinsic gate allowing for the measurement-based implementation of arbitrary single-qudit unitaries. Furthermore, we demonstrate for prime-power-dimensional qudits that the complexity of the realization depends linearly both on the dimension and the Pauli order of the intrinsic gate. These insights also allow us to optimize the efficiency of the standard qudit cluster state by effectively mimicking more favorable intrinsic-gate structures, thereby reducing the required measurement depth. Finally, we discuss the required two-dimensional geometry of the resource state for universal measurement-based quantum computing. As concrete examples, we present multiple alternative resource states. In certain dimensions, we show the existence of resource states achieving optimal intrinsic gates, enabling more efficient measurement-based quantum information processing than the qudit cluster state and highlighting the potential of qudit stabilizer state resources for future quantum computing architectures.
015055
The following article is Open access
Isabell Jauch, Thomas Strohm, Tino Fuchs and Fedor Jelezko
Quantum optimal control in color center physics plays a crucial role in advancing sensor technology. This study focuses on optimizing microwave pulse shapes within a Ramsey sequence for nitrogen-vacancy centers to enhance sensor sensitivity and signal detection capabilities. We compare state-of-the-art optimization methods, including the dressed chopped randomized basis Nelder–Mead algorithm and covariance matrix adaptation evolutionary strategy, and extend our search to machine learning approaches, such as Gaussian processes and artificial neural networks. These machine learning techniques are specifically designed to provide robust and global solutions that can rapidly adapt to changing environmental conditions. Our results demonstrate more than a sixfold increase in convergence speed compared to conventional methods and considerable contrast improvements with a limited retraining set of 72 samples. Furthermore, we demonstrate that the optimized Ramsey contrast translates into a significant enhancement in the signal-to-noise ratio for detecting synthetic magnetic heart signals. This highlights the potential of machine learning-driven quantum optimal control for developing more flexible, adaptive, and efficient quantum sensing solutions in real-world scenarios.
015056
The following article is Open access
Dario De Santis, Salvatore Tirone, Stefano Marmi and Vittorio Giovannetti
Quantum computers have strict requirements for the problems that they can efficiently solve. One of the principal limiting factor for the performances of noisy intermediate-scale quantum (NISQ) devices is the number of qubits required by the running algorithm. Several combinatorial optimization problems can be solved with NISQ devices once that a corresponding quadratic unconstrained binary optimization (QUBO) form is derived. Numerous techniques have been proposed to achieve such reformulations and, depending on the method chosen, the number of binary variables required, and therefore of qubits, can vary considerably. The aim of this work is to drastically reduce the variables needed for these QUBO reformulations in order to unlock the possibility to efficiently obtain optimal solutions for a class of optimization problems with NISQ devices. This goal is achieved by introducing novel tools that allow an efficient use of slack variables, even for problems with non-linear constraints, without the need to approximate the starting problem. We divide our new techniques in two independent parts, called the iterative quadratic polynomial and the master-satellite methods. Hence, we show how to apply our techniques in case of an NP-hard optimization problem inspired by a real-world financial scenario called Max-Profit Balance Settlement. We follow by submitting several instances of this problem to two D-wave quantum annealers, comparing the performances of our novel approach with the standard methods used in these scenarios. Moreover, this study allows to appreciate several performance differences between the D-wave Advantage and next-generation Advantage2 quantum annealers. We show that the adoption of our techniques in this context allows to obtain QUBO formulations with significantly fewer slack variables, i.e. around 90% less, and D-wave annealers provide considerably higher correct solution rates, which moreover do not decrease with the input size as fast as when adopting standard techniques.
015057
The following article is Open access
Nikita Guseynov, Xiajie Huang and Nana Liu
We propose an explicit quantum framework for numerically simulating general linear partial differential equations (PDEs), extending previous work (Guseynov et al 2025 Phys. Rev. Res.7 033100) to incorporate (a) Robin boundary conditions—which include Neumann and Dirichlet conditions as special cases–(b) inhomogeneous terms, and (c) variable coefficients in space and time. Our approach begins with a general finite-difference discretization and applies the Schrödingerisation technique to transform the resulting system into one that admits unitary quantum evolution, enabling quantum simulation. For the Schrödinger equation corresponding to the discretized PDE, we construct an efficient block-encoding of the Hamiltonian H that scales polylogarithmically with the number of grid points N. This encoding is compatible with quantum signal processing and allows for the implementation of the evolution operator
. The explicit circuit construction in our method permits complexity to be measured in fundamental gate units–namely, CNOT gates and single-qubit rotations–bypassing the inefficiencies of oracle queries. Consequently, the overall algorithm scales polynomially with N and linearly with the spatial dimension d. Under certain input/output assumptions our method achieves a polynomial speedup in N and an exponential advantage in d for a wide class of PDEs, thereby mitigating the classical curse of dimensionality. The validity and efficiency of the proposed approach are further substantiated by numerical simulations. By explicitly defining the quantum operations and quantifying their resource requirements, our approach offers a practical alternative for numerically solving PDEs, distinct from others that rely on oracle queries and purely asymptotic scaling methods.
015058
The following article is Open access
Vinicius F Lisboa, Pedro R Dieguez, Kyrylo Simonov and Roberto M Serra
Allowing the order of quantum operations to exist in superposition is known to open new routes for thermodynamic tasks. We investigate a quantum heat engine where energy exchanges are driven by generalized measurements, and the sequence of these operations is coherently controlled in a superposition of causal orders. Our analysis explores how initial correlations between the working medium and the controller affect the engine’s performance. Considering uncorrelated, classically correlated, and entangled initial states, we show that entanglement enables the superposed causal order (SCO) to generate coherence in the working medium, thereby enhancing work extraction and efficiency beyond the separable and uncorrelated cases. Finally, we present a proof-of-principle simulation on the IBM Quantum Experience platform, realizing a quantum switch of two measurement channels with tunable strengths and experimentally confirming the predicted efficiency enhancement enabled by correlation-assisted SCO.
015059
The following article is Open access
Sofia Sevitz, Federico Cerisola, Karen V Hovhannisyan and Janet Anders
Particle-exchange machines utilize electronic transport to continuously transfer heat between fermionic reservoirs. Here, we introduce a model coupling a quantum mechanical resonator to a particle-exchange machine hosted in a quantum dot (QD) and let the system run autonomously. This way, part of the energy exchanged between the reservoirs can be stored in the resonator in the form of self-oscillations. Our analysis goes well beyond previous works by exploring the slow transport regime and accessing arbitrarily strong dot–resonator coupling. First, we introduce a faithful measure of self-oscillations, and use it to certify that they can occur in the slow-transport regime. We furthermore show that the electrical current through the dot can be used to witness self-oscillations. Finally, we establish that, under realistic conditions, self-oscillations occur only when the machine operates as a heater. We define an experimentally measurable performance metric characterizing the efficiency of current–to–self-oscillations conversion. It reveals that, counterintuitively, strong dot–resonator coupling is detrimental to the conversion performance. The framework developed here can be readily implemented in a variety of nanoscale devices, such as a suspended carbon nanotube with an embedded QD.
015060
The following article is Open access
Chenyu Shi, Vedran Dunjko and Hao Wang
The variational quantum eigensolver (VQE) is one of the most prominent algorithms using near-term quantum devices, designed to find the ground state of a Hamiltonian. In VQE, a classical optimizer iteratively updates the parameters in the quantum circuit. Among various optimization methods, the quantum natural gradient descent (QNG) stands out as a promising optimization approach for VQE. However, standard QNG only leverages the quantum Fisher information of the entire system and treats each subsystem equally in the optimization process, without accounting for the different weights and contributions of each subsystem corresponding to each local term in the Hamiltonian. To address this limitation, we propose a Weighted Approximate QNG (WA-QNG) method tailored for k-local Hamiltonians. In this paper, we theoretically analyze the potential advantages of WA-QNG compared to QNG from three distinct perspectives and reveal its connection with the Gauss–Newton method. We also show it outperforms the standard QNG descent in the numerical simulations for seeking the ground state of the Hamiltonian.
015061
The following article is Open access
Eleftherios Mastorakis, Muhammad Umer, Milena Guevara-Bertsch, Juris Ulmanis, Felix Rohde and Dimitris G Angelakis
Resource-efficient, low-depth implementations of quantum circuits remain a promising strategy for achieving reliable and scalable computation on quantum hardware, as they reduce gate resources and limit the accumulation of noisy operations. Here, we propose a low-depth implementation of a class of Hadamard test circuits, complemented by the development of a parameterized quantum ansatz specifically tailored for variational algorithms that exploit the underlying Hadamard test framework. Our findings demonstrate a significant reduction in single- and two-qubit gate counts, suggesting a reliable circuit architecture for noisy intermediate-scale quantum devices. Building on this foundation, we tested our low-depth scheme to investigate the expressive capacity of the proposed parameterized ansatz in simulating nonlinear Burgers’ dynamics. The resulting variational quantum states faithfully capture the shockwave feature of the turbulent regime and maintain high overlaps with classical benchmarks, underscoring the practical effectiveness of our framework. Furthermore, we evaluate the effect of hardware noise by modeling the error properties of real quantum processors and by executing the variational algorithm on a trapped-ion-based IBEX Q1 device. The outcomes of our demonstrations highlight the resilience of our low-depth scheme in the turbulent regime, consistently preparing high-fidelity variational states that exhibit strong agreement with classical benchmarks. Our work contributes to the advancement of resource-efficient strategies for quantum computation, offering a robust framework for tackling a range of computationally intensive problems across numerous applications.
015062
ZhiXin Xia, SiYing Wang, Yue Yan and Xiang-Bin Wang
Achieving large-scale real-time decoding requires efficient and accurate decoders. However, conventional decoding strategies for surface codes struggle to balance speed with accuracy. In this work, we propose the adaptive decision-making (ADM) strategy, which optimizes the local decisions through intermediate information during the decoding process, while maintaining rapid decoding. We compare the performance of different real-time strategies by integrating them into the union-find (UF) decoding framework. Numerical simulations under different noises show that our ADM-UF decoder significantly improves the threshold, outperforming its highly relevant competitors. Empirical evidence confirms that ADM-UF achieves an almost-linear complexity, ensuring real-time decoding for large-scale quantum codes. These results validate the efficacy of our ADM strategy.