Search arXiv⌕ Search

arXiv subjects

Wolfgang Lechner

Publications and source records attributed to Wolfgang Lechner.

At least 19 recordsLinked to original sources

Demonstrating Record Fidelity for the Quantum Fourier Transform

We demonstrate the Parity Architecture on quantum hardware, using the quantum Fourier transform (QFT) as a benchmark. As a result, a record performance in both fidelity and qubit count is achieved using quantum processors with a native CZ-based instruction set. On the IBM Heron r3 chip, a process fidelity of the QFT algorithm of ${F \approx 10^{-2}}$ for ${N=50}$ qubits is achieved. The scaling of the speedup compared to previous swap-based methods is super-exponential $\mathcal{O}(\exp(N^2))$. Furthermore, we show that the scaling can be improved further by including iSWAP gates in the instruction set.

quant-ph↗

Evaluation of attenuation-based simulated X-ray images for image-guided radiotherapy

In image-guided radiation therapy (IGRT), in-room X-rays are often used for patient positioning and monitoring, however, usually default imaging settings are utilized for each indication. Obtaining patient-specific imaging settings before treatment is achievable using simulated X-rays, which can facilitate IGRT workflow optimization. This study evaluated the image quality of simulated X-rays for thoracic, cranial and pelvic regions. Simulated X-rays were created from computed tomography (CT) scans with indication-specific default settings using a pre-release pilot software, which mimics the geometry of the room-mounted ExacTrac Dynamic (ETD) system (Brainlab SE, Germany). The basis of this algorithm was the Beer-Lambert law. Linear attenuation coefficients were approximated from the CT hounsfield units, while incident intensities were defined by flood images. CT scans were included from three anthropomorphic phantoms and 57 patients (13 lung, 20 glioblastoma, 24 prostate). For evaluation, real X-rays were used as ground truth. Three image quality metrics - Structural Similarity Index (SSIM), Normalized Cross Correlation (NCC), Normalized Mean Absolute Error (NMAE) - complemented by histogram and intensity profile comparisons were used for evaluation. SSIMs for phantom and patient average were 0.87 and 0.80 for the thoracic, 0.94 and 0.88 for the cranial and 0.85 and 0.79 for the pelvic region. Corresponding NCCs yielded values of 0.99 and 0.89, 0.99 and 0.99 and 0.99 and 0.60. NMAEs were 4.1% and 10.7% (lung), 2.6% and 3.2% (brain) and 2.6% and 4.0% (pelvis). Histograms of real X-rays and simulated X-rays (sX-rays) were slightly shifted and showed differences at the background pixel value. Intensity profiles exhibited similar trends with some differences in absolute values. The investigated simulated X-rays demonstrated promising quality for individualized IGRT treatment preparation.

physics.med-ph↗

Error-Corrected Quantum Optimization via Rydberg Atom Array Embeddings

Rydberg atom quantum optimizers naturally encode the maximum independent set problem on geometric graphs. However, to solve general combinatorial optimization problems on more complex topologies, an embedding is required to overcome the limited-range native interactions. Such embeddings use gadgets, specific arrangements of atoms, which inevitably introduce ancillary atoms. Here, we show that this apparent overhead instead provides an intrinsic resource for error correction. Specifically, we demonstrate that the Parity Architecture-based Rydberg embedding naturally forms a classical error-correcting code, a principle that extends to other Rydberg blockade-based embeddings. Within superatom substructures, exact Rydberg-excitation-number constraints provide local error syndromes at no additional hardware cost and give rise to a strictly nonlinear code. To correct bit-flip errors, we introduce the precisely tailored Cluster decoder, which exploits these local constraints and the underlying gadget structure. Numerically, this approach achieves an error threshold of $p_{\text{th}}\gtrsim26 \%$ across different layout geometries. Experimentally, on the QuEra Aquila QPU, the Cluster decoder recovers exact optimization solutions with an average success rate of $\gtrsim8\%$ for systems of up to 107 atoms, even when bare hardware and standard greedy post-processing find none. A Rydberg atom array embedding is therefore not merely a hardware mapping of an optimization problem, but a co-designed architecture for quantum optimization in which embedding, computation, and error correction emerge from the same physical structure.

quant-ph↗

Higher-order Parity Constraints for Quantum Approximate Optimization

The Parity Architecture was originally introduced in the context of quantum optimization algorithms to overcome hardware connectivity constraints. Here, we show that its benefits extend beyond this role by identifying specific parity transformations that enhance the success probability of the Quantum Approximate Optimization Algorithm (QAOA) for optimization problems defined on hardware-native and sparse graphs. Numerical simulations suggest that this enhancement originates from the higher-order operators introduced by the Parity representation, which accelerate the propagation of correlations across the physical device. We investigate this mechanism for the Signed Max-Cut problem on 3-regular graph instances and demonstrate its practical relevance on IBM Heron quantum processors. QAOA parameters are first classically optimized on small training instances containing up to 14 vertices and subsequently transferred to larger instances executed on quantum hardware. We consider Signed Max-Cut instances of up to 40 vertices and find that, together with an error mitigation technique, the parity-based QAOA identifies the optimal solutions for all the considered 40-vertex instances, whereas the conventional QAOA fails under the same conditions.

quant-ph↗

Fermion lattices can be simulated by same-size qubit lattices with $\mathcal{O}(1)$ interaction overhead

Local interactions among electrons underlie many complex properties of correlated materials. While the Jordan-Wigner transformation can preserve this locality along one spatial dimension, interactions along the remaining dimensions typically incur substantial overhead. We show how to simulate all geometrically local interactions on an $N$-site two-dimensional fermion lattice with no asymptotic overhead in the number of interactions and no space overhead. The primary overhead of our method is circuit depth, which on a qubit lattice matches that of fermionic swap networks, scaling as $\mathcal{O}(\sqrt{N})$, but reduces to $\mathcal{O}(\log N)$ on reconfigurable qubit arrays and to $\mathcal{O}(1)$ in lattice-surgery-based surface-code architectures. This is enabled by dynamically reorienting the Jordan-Wigner transformation to switch the lattice dimension along which locality is preserved. Furthermore, we study fermion routing, as required for the simulation of non-local interactions. When using qubit lattices, we reach resource scaling that asymptotically matches that of qubit routing, whilst on fully connected qubit devices, a depth scaling arbitrarily close to $\mathcal{O}(\log N)$ is reached. This allows the fermionic fast Fourier transform to be implemented on qubit lattices with asymptotically optimal resource scaling under these locality constraints. Notably, all of our constructions naturally extend to $d$-dimensional lattices. Beyond scaling improvements, we show explicit examples of our method, including Fermi-Hubbard-model simulations of the square-, Lieb- and kagome lattice and the fermionic fast Fourier transform.

quant-ph↗

From NISQ to Fault-Tolerance: Applications and Algorithmic Benchmarks for Spin Qubits

Motivated by recent breakthroughs in the development of spin-based quantum processing units based on exchange-only (EO) spin qubits, we provide a roadmap for the implementation of quantum algorithms on the EO platform, ranging from the NISQ to the fault-tolerant era. To provide an algorithm-driven perspective on the scaling of quantum chips, we consider a range of applications targeting different stages of hardware maturity and formulate requirements for a successful realization. We show that the compilation method Parity Twine perfectly complements the hardware's capabilities to perform tasks such as the quantum Fourier transform or QAOA. Furthermore, we describe an error detection technique native to Parity Twine, which EO qubits can leverage in a unique and advantageous way to improve algorithm performance. Finally, since both near-term algorithmic benchmarks and a long-term perspective can be found in digital quantum simulation, we specifically discuss the fermionic fast Fourier transform and the simulation of Fermi-Hubbard models. The latter is explicitly discussed in the context of quantum error correction and a partially fault-tolerant realization. By providing detailed resource estimates and identifying scaling bottlenecks on each level, our work offers a quantitative perspective on EO-based quantum computing and will inform future hardware design choices.

quant-ph↗

Expanding the Neutral Atom Gate Set: Native iSWAP and Exchange Gates from Dipolar Rydberg Interactions

We present a native realization of iSWAP and parametrized \textit{exchange} gates for neutral-atom quantum processing units. Our approach leverages strong dipole-dipole interactions between two different dipole-coupled Rydberg states, employing optimal control techniques to design high-fidelity, time-efficient gate pulses. To minimize experimental complexity, we utilize global driving fields acting identically on all atoms and apply pulse smoothing techniques. While detrimental van der Waals interactions pose a significant challenge, we demonstrate that for both $^{133}$Cs, as a representative alkali atom, and $^{88}$Sr, an alkaline-earth species, high-fidelity pulses can nevertheless be obtained over a broad range of parameters. We identify candidate protocols with reduced susceptibility to noise and analyze their performance under realistic conditions, accounting for atomic motion, Rydberg decay, and experimentally motivated laser frequency and intensity noise. Crucially, we demonstrate that in both Alkali and alkaline-earth-based systems, we can obtain fast iSWAP gates with fidelities of $99.9\%$ under realistic experimental conditions. These results pave the way for expanding the neutral-atom gate set beyond conventional Rydberg-blockade-based entangling gates.

quant-ph↗

Quantum Optimisation for Protein-Protein Interaction Network Alignment

Protein-protein interaction (PPI) network alignment combines topological and sequence information to identify conserved modules across species, but global alignment remains challenging: heuristics sacrifice optimality, while exact methods lack scalability. We model the alignment as a weighted maximum common induced subgraph problem and reformulate it through the modular product graph to a minimum-weight vertex cover on the complement, with node weights carrying sequence similarity. To solve this problem, we develop a hybrid framework combining kernelisation, branch-and-bound, and seven Quantum Approximate Optimisation Algorithm (QAOA) formulations. These formulations differ in how the cover constraints are enforced, from penalty terms in the cost Hamiltonian to mixers confined to the feasible subspace. For single round QAOA, we derive closed-form expressions for the expected cost of four circulant mixer variants, enabling performance characterisation without circuit simulation. Applied to synthetic and real-world networks reduced to KEGG pathways, the QAOA formulations achieve high topological conservation on the aligned core while at least maintaining biological conservation comparable to leading classical aligners, at the cost of reduced node coverage. Across selected KEGG pathways, the aligned subnetworks retain disease-associated proteins, preserving biologically relevant information. Cheaper formulations leave more edges uncovered, while enforcing feasibility in the mixer raises circuit depth by one to two orders of magnitude. Together, these results highlight the potential of quantum optimisation for PPI network alignment and the resource trade-offs that will shape its scalability as quantum hardware matures.

quant-ph↗

Optimizing Atom Transport, Gate-Count and Depth with Parity Twine

We present an efficient implementation of the Parity Architecture for neutral-atom quantum processors. We adapt Parity Twine Networks (PTNs) to different atom layouts, native entangling gates, and atom-shuttling capabilities. This provides a general framework for hardware-aware optimization of gate count, circuit depth, and atom transport for quantum circuits encoding arbitrary interaction graphs in a common basis. Specifically, we develop PTN constructions based on different native entangling-gate realizations, namely CZ, CZSWAP, and iSWAP, providing flexibility to accommodate different hardware capabilities on both static and mobile neutral-atom platforms. Using the quantum Fourier transform (QFT) as a representative example, we demonstrate substantial reductions in two-qubit gate count, atom transport, and circuit depth. These resource savings translate into an estimated circuit fidelity three orders of magnitude higher than competing compilation strategies for a 30-qubit QFT. We further extend the construction to the recently introduced optimistic QFT and discuss the broader applicability of PTNs to other quantum algorithms on neutral-atom platforms.

quant-ph↗

Parity Mapping for Quantum Optimization on Frustrated Ising Rings

The frustrated Ising ring is one of the simplest models exhibiting exponential closing spectral gaps, making it a paradigmatic and challenging benchmark for quantum annealing (QA). Ground-state preparation for this model has therefore been studied extensively in both continuous-time QA and digitized protocols such as the Quantum Approximate Optimization Algorithm (QAOA). Here, we use the frustrated Ising ring to investigate how the parity mapping affects the performance of both QA and QAOA. For QA, finite-size calculations show that the parity mapping increases the minimum spectral gap under the energy normalization used in this work, thereby enabling faster continuous-time ground state preparation protocols. An ideal implementation of Parity-QA, with a single global constraint, shows no evidence of exponential gap closing over the accessible system sizes, whereas a hardware-motivated decomposition into local constraints restores the exponential decrease, albeit with a smaller fitted exponent than conventional QA. For the digitized protocol, we find that the number of Parity-QAOA layers required to prepare the exact ground state remains constant over the simulated sizes, improving upon the quadratic scaling required by conventional QAOA. To investigate the role of constraints in Parity-QAOA, we further consider a modified Ising ring instance in which the constraint term is essential for preparing the target ground state. We then compare the corresponding resource requirements with those of conventional QAOA.

quant-ph↗

Quantum optimization with globally driven neutral atom arrays

Neutral atoms trapped in configurable tweezer arrays are a promising platform for solving hard optimization problems. While such platforms natively embed unit-disk maximum weight independent set (UD-MWIS) problems, general problem classes require an embedding that maps them onto UD-MWIS instances. Implementing the necessary asymmetric weights has so far required local control of detunings at each atom. Here, we demonstrate quantum optimization using strictly global driving fields, eliminating the need for local field control. Instead, to effectively implement the required local detunings we exploit weak Rydberg interactions---too weak to generate Rydberg blockade but strong enough to effectively induce the required local detunings. For this, we introduce the concept of precisely placed anchor atoms that impose controlled energy shifts on nearby atoms which can be effectively considered as induced local detunings. We demonstrate that parity-architecture-based neutral atom embeddings of general optimization problems allow for a successful anchor placement strategy, such that all demanded local fields can be replaced by anchors. We experimentally demonstrate this concept on a Pasqal Orion Alpha machine and benchmark all standard building blocks. Finally, we solve quadratic unconstrained binary optimization (QUBO) problems on four-node all-to-all connected graphs embedded in a 43-atom array using seven precisely-placed anchor atoms. By removing the requirement for local addressing, our work overcomes a major experimental bottleneck in solving optimization problems on neutral-atom quantum hardware and can be readily integrated into existing platforms.

quant-ph↗

Bundling of bipartite entanglement

We investigate bipartite entanglement and prove that in constrained energy subspaces, the entanglement spectra of multiple bipartitions are the same across the whole subspace. We show that in quantum many-body systems the bipartite entanglement entropy is affected in such a way that it forms "bundles" under unitary time evolution. Leveraging the structure of the subspace, we present methods to verify whether the entanglement spectrum of two bipartitions is identical throughout the entire subspace. For the subspace defined by the parity embedding, we further provide an algorithm that can determine this in polynomial time.

quant-ph↗

Qudit extension of parameterized IQP circuits: A generative quantum machine learning approach to integer data

Parameterized Instantaneous Quantum Polynomial (IQP) circuits have proven useful in quantum generative learning models, particularly for binary distributions. However, when applied to non-binary datasets, they exhibit notable limitations: mapping integer values into qubit-compatible binary representations often destroys the original metric structure of the data. In this paper we aim to extend them to a qudits formulation operating on an integer mapping of the data. The IQP quantum circuit is adapted to encode each integer valued pixel into a bit-string of fixed length and quantum gates are transformed to follow the qudit formalism. As a generative machine learning approach, a suitable loss function for the circuit training and the calculation of the covariance matrix among features are developed and validated on the energy deposits from single-particle electron showers in the electromagnetic calorimeter of the CLIC detector. The method proposed in this work can be also extended to other applications that utilize quantum generative machine learning for non-binary data.

quant-ph↗

Spin Model for Quantum Annealing with Kerr Parametric Oscillators

Coherent states offer a promising path for near-term quantum computing due to their inherent protection against bit-flip noise. However, their large photon numbers can be challenging for numerical simulation. This paper introduces an effective model, representing coherent-state quantum annealing using spin-1/2 degrees of freedom. We demonstrate that this model yields accurate predictions for realistic experimental settings and can therefore serve as a practical tool for optimizing future quantum hardware.

quant-ph↗

Parity-unfolded distillation architecture for noise-biased platforms

We introduce the parity-unfolded architecture, a fault-tolerant quantum computing scheme that relies on direct preparation and teleportation of small-angle rotations $ Z^{1/2^{k}}$ rather than approximating them with the conventional (Clifford + $T$) gate set. The architecture is enabled by efficient distillation of gates from an arbitrary level of the Clifford hierarchy, which we refer to as parity unfolding. With it, a state $|Z_k\rangle = Z^{1/2^{k}}|{+}\rangle$ can be prepared fault-tolerantly using $2^{k+3} + O(2^{k/2})$ biased-noise qubits on a planar chip with nearest-neighbour connectivity. For algorithms requiring native $Z^{1/2^{k}}$ gates, such as the Quantum Fourier Transform and phase estimation, the proposed scheme allows to reduce resource overheads for up to $k=7$, i.e., up to $T^{1/32}$. Furthermore, when used for the synthesis of arbitrary small-angle rotations, parity-unfolded distillation of ($T$ + $\sqrt{T}$) reduces the minimum achievable logical error rate by 43% while cutting the resource requirements by 26%, when compared to unfolded distillation of only the $T$ gate.

quant-ph↗

YZ-plane measurement-based quantum computation: Universality and Parity Architecture implementation

We define the class of register-logic graphs and prove that any uniformly deterministic measurement-based quantum computation (MBQC) where the inputs coincide with the outputs must be driven on such graphs by measurements in the $YZ$ plane of the Bloch sphere. This observation is revisited in the context that goes beyond uniform determinism, where we present a universal $YZ$-plane-only measurement pattern and establish a connection between $YZ$-plane-only and $XZ$-plane-only patterns. These results conclude the line of research on universal patterns with measurements restricted to one of the principal planes of the Bloch sphere. We further demonstrate, within the framework of the Parity Architecture, that $YZ$-plane patterns with the register-logic graph can be embedded into another graph with purely local interactions, and we extend this case to the scenario of universal quantum computation.

quant-ph↗

Replacement-Type Quantum Gates

We introduce the paradigm of replacement-type quantum gates. This type of gate introduces input qubits, candidate qubits, and output qubits. The candidate qubits are prepared such, that a displacement conditional on the input qubit results in the targeted output state. Finally, the circuit continues with the output qubits constructed from the candidate qubits instead of the input qubits, thus the name "replacement-type gate". We present examples of replacement-type $X$ and $\mathrm{CNOT}$ gates realized with spin qubits and with neutral atom qubits with error rates predicted near the threshold of the XZZX surface code. By making use of the extended Hilbert space, including the position of the particles, these gates approximately preserve the innate noise bias of the qubits. The gate preserves the noise bias which motivates advanced quantum computer architectures with quantum error correction.

quant-ph↗

SWAP-less Implementation of Quantum Algorithms

We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity without qubit overhead, SWAP operations or shuttling. Instead, we leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information. We demonstrate the effectiveness of this method by applying it to the quantum Fourier transform (QFT) and the Quantum Approximate Optimization Algorithm (QAOA) with $n$ qubits. This improves upon all state-of-the-art implementations of the QFT on a linear nearest-neighbor architecture, resulting in a total circuit depth of ${5n-3}$ and requiring ${n^2-1}$ CNOT gates. For the QAOA, our method outperforms SWAP networks, which are currently the most efficient implementation of the QAOA on a linear architecture. We further demonstrate the potential to balance qubit count against circuit depth by implementing the QAOA on twice the number of qubits using bi-linear connectivity, which approximately halves the circuit depth.

quant-ph↗