Wolfgang Lechner
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wolfgang Lechner has a total of 99 co-authors. Here are the top co-authors by number of shared publications:
- Kilian Ender
University of Innsbruck
7 shared publications - Michael Fellner
University of Innsbruck
7 shared publications Peter Zoller
Institute for Quantum Optics and Quantum Information Austrian Academy of Sciences A-6020 Innsbruck Austria
7 shared publications- Anette Messinger
Parity Quantum Computing GmbH
6 shared publications - Clemens Dlaska
Digital Cardiology Lab, University Clinic of Internal Medicine III, Medical University Innsbruck , Innsbruck AT-6020
6 shared publications - Andreas Hartmann
Institut für Theoretische Physik, Universität Innsbruck, Technikerstraße 21A, A-6020 Innsbruck, Austria
4 shared publications
Latest Publications
- Open Access
- 1 July 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (1)
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.
- 1 July 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 114 (1)
Open AccessBundling 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.
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
Spin model for quantum annealing with Kerr parametric oscillators
- 25 June 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
Spin model for quantum annealing with Kerr parametric oscillators
- Open Access
- 24 February 2026
- Published by IOP Publishing in New Journal of Physics
- Vol. 28 (3)
Performance of parity QAOA for the signed max-cut problem
The practical implementation of quantum optimization algorithms on noisy intermediate-scale quantum devices requires accounting for their limited connectivity. As such, the Parity architecture was introduced to overcome this limitation by encoding binary optimization problems onto planar quantum chips. We investigate the performance of the Quantum Approximate Optimization Algorithm on the Parity architecture (Parity QAOA) for solving instances of the signed Max-Cut problem on complete and regular graphs. By comparing the algorithms at fixed circuit depth, we demonstrate that Parity QAOA outperforms conventional QAOA implementations based on SWAP networks. Our analysis utilizes Clifford circuits to estimate lower performance bounds for Parity QAOA for problem sizes that would be otherwise inaccessible on classical computers. For single layer circuits we additionally benchmark the recursive variant of the two algorithms, showing that their performance is equal.
- 24 February 2026
- Published by IOP Publishing in New Journal of Physics
- Vol. 28 (3)
Open AccessPerformance of parity QAOA for the signed max-cut problem
The practical implementation of quantum optimization algorithms on noisy intermediate-scale quantum devices requires accounting for their limited connectivity. As such, the Parity architecture was introduced to overcome this limitation by encoding binary optimization problems onto planar quantum chips. We investigate the performance of the Quantum Approximate Optimization Algorithm on the Parity architecture (Parity QAOA) for solving instances of the signed Max-Cut problem on complete and regular graphs. By comparing the algorithms at fixed circuit depth, we demonstrate that Parity QAOA outperforms conventional QAOA implementations based on SWAP networks. Our analysis utilizes Clifford circuits to estimate lower performance bounds for Parity QAOA for problem sizes that would be otherwise inaccessible on classical computers. For single layer circuits we additionally benchmark the recursive variant of the two algorithms, showing that their performance is equal.
- 23 February 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (2)
Replacement-type quantum gates
- 23 February 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (2)
Replacement-type quantum gates
- Top Cited PapersOpen Access
- 29 January 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (1)
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 5 n − 3 and requiring n 2 − 1 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 bilinear connectivity, which approximately halves the circuit depth.
- 29 January 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (1)
Top Cited PapersOpen AccessSWAP-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 5 n − 3 and requiring n 2 − 1 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 bilinear connectivity, which approximately halves the circuit depth.
- Open Access
- 29 January 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Parity flow formalism: Tracking quantum information throughout computation
We propose the parity flow formalism, a method for tracking the information flow in quantum circuits. This method adds labels to quantum circuit diagrams such that the action of Clifford gates can be understood as a recoding of quantum information. The action of non-Clifford gates in the encoded space can be directly deduced from those labels without backtracking. An application of flow tracking is to design resource-efficient quantum circuits by changing any present encoding via a simple set of rules. Finally, the parity flow formalism can be used in combination with stabilizer codes to further reduce quantum circuit depth and to reveal additional operations that can be implemented in parallel.
- 29 January 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Open AccessParity flow formalism: Tracking quantum information throughout computation
We propose the parity flow formalism, a method for tracking the information flow in quantum circuits. This method adds labels to quantum circuit diagrams such that the action of Clifford gates can be understood as a recoding of quantum information. The action of non-Clifford gates in the encoded space can be directly deduced from those labels without backtracking. An application of flow tracking is to design resource-efficient quantum circuits by changing any present encoding via a simple set of rules. Finally, the parity flow formalism can be used in combination with stabilizer codes to further reduce quantum circuit depth and to reveal additional operations that can be implemented in parallel.
- Open Access
- 23 October 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (4)
Improving success probability in Lechner-Hauke-Zoller parity embedding by computing with quantum walks
Lechner-Hauke-Zoller (LHZ) parity embedding is one of the front-running methods for implementing difficult-to-engineer long-range interactions in quantum optimization problems. Continuous-time quantum walks are a leading approach for solving quantum optimization problems. Because they populate excited states, quantum walks can avoid the exponential gap-closing problems seen in other continuous-time techniques such as quantum annealing and adiabatic quantum computation. An important question, therefore, is how continuous-time quantum walks perform in combination with the LHZ parity embedding. By numerically simulating continuous-time quantum walks on four-, five-, and six-logical-qubit Sherrington-Kirkpatrick Ising spin glass instances embedded onto the LHZ parity embedding, we are able to verify the continued efficacy of heuristics used to estimate the optimal hopping rate and the numerical agreement with the theory behind the location of the lower bound of the LHZ parity constraint strength. In addition, by comparing several different LHZ-based decoding methods, we identified postreadout error correction techniques which improve the success probability of the quantum walk.
- 23 October 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (4)
Open AccessImproving success probability in Lechner-Hauke-Zoller parity embedding by computing with quantum walks
Lechner-Hauke-Zoller (LHZ) parity embedding is one of the front-running methods for implementing difficult-to-engineer long-range interactions in quantum optimization problems. Continuous-time quantum walks are a leading approach for solving quantum optimization problems. Because they populate excited states, quantum walks can avoid the exponential gap-closing problems seen in other continuous-time techniques such as quantum annealing and adiabatic quantum computation. An important question, therefore, is how continuous-time quantum walks perform in combination with the LHZ parity embedding. By numerically simulating continuous-time quantum walks on four-, five-, and six-logical-qubit Sherrington-Kirkpatrick Ising spin glass instances embedded onto the LHZ parity embedding, we are able to verify the continued efficacy of heuristics used to estimate the optimal hopping rate and the numerical agreement with the theory behind the location of the lower bound of the LHZ parity constraint strength. In addition, by comparing several different LHZ-based decoding methods, we identified postreadout error correction techniques which improve the success probability of the quantum walk.
- Open Access
- 22 September 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Multiqubit parity gates for Rydberg atoms in various configurations
We present a native approach for realizing multiqubit parity phase gates in neutral-atom systems through global phase modulation of a Rydberg excitation laser. By shaping the temporal profile of the laser’s phase, we enable high-fidelity, time efficient entangling operations between multiple qubits without requiring individual qubit addressing. To mitigate intrinsic noise sources including spontaneous decay and motional effects, we develop a noise-aware optimal control framework that reduces gate errors under the presence of noise while maintaining smooth pulse profiles suitable for experimental implementation. In addition to equidistant qubit arrangements, we explore the impact of nonequidistant atomic configurations, where interaction inhomogeneity becomes significant. In these cases, the flexibility of our control approach helps to compensate for such variations, supporting reliable gate performance across different spatial layouts. These results facilitate the practical implementation of complex, multiqubit quantum operations in near-term neutral-atom quantum processors.
- 22 September 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Open AccessMultiqubit parity gates for Rydberg atoms in various configurations
We present a native approach for realizing multiqubit parity phase gates in neutral-atom systems through global phase modulation of a Rydberg excitation laser. By shaping the temporal profile of the laser’s phase, we enable high-fidelity, time efficient entangling operations between multiple qubits without requiring individual qubit addressing. To mitigate intrinsic noise sources including spontaneous decay and motional effects, we develop a noise-aware optimal control framework that reduces gate errors under the presence of noise while maintaining smooth pulse profiles suitable for experimental implementation. In addition to equidistant qubit arrangements, we explore the impact of nonequidistant atomic configurations, where interaction inhomogeneity becomes significant. In these cases, the flexibility of our control approach helps to compensate for such variations, supporting reliable gate performance across different spatial layouts. These results facilitate the practical implementation of complex, multiqubit quantum operations in near-term neutral-atom quantum processors.
- Open Access
- 8 September 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (3)
Minimally universal parity quantum computing
In parity quantum computing, multiqubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native gate set. One might then wonder, what is the smallest number of auxiliary qubits that still allows for universal parity computing? Here, we demonstrate that the answer is 1 if the number of logical qubits is even, and 2 otherwise. Furthermore, we present a sufficient condition for a given parity gate set to be universal. This leads to a variety of different universal parity gate sets corresponding to different numbers of auxiliary qubits and more generally contributes to the understanding of which entangling gates are required to augment the set of single-qubit unitaries to perform universal quantum computing. As a consequence, we obtain (i) minimal implementations of the parity framework on, e.g., a triangular lattice, (ii) hardware-specific implementations of the parity flow framework on, e.g., a heavy-hex lattice, and (iii) novel universal resources for measurement-based quantum computation.
- 8 September 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (3)
Open AccessMinimally universal parity quantum computing
In parity quantum computing, multiqubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native gate set. One might then wonder, what is the smallest number of auxiliary qubits that still allows for universal parity computing? Here, we demonstrate that the answer is 1 if the number of logical qubits is even, and 2 otherwise. Furthermore, we present a sufficient condition for a given parity gate set to be universal. This leads to a variety of different universal parity gate sets corresponding to different numbers of auxiliary qubits and more generally contributes to the understanding of which entangling gates are required to augment the set of single-qubit unitaries to perform universal quantum computing. As a consequence, we obtain (i) minimal implementations of the parity framework on, e.g., a triangular lattice, (ii) hardware-specific implementations of the parity flow framework on, e.g., a heavy-hex lattice, and (iii) novel universal resources for measurement-based quantum computation.
- Open Access
- 19 February 2025
- Published by Springer Nature in npj Quantum Information
- Vol. 11 (1) , 1-12
Parallel circuit implementation of variational quantum algorithms
We present a framework to split quantum circuits of variational quantum algorithms (VQAs) to allow for parallel training and execution to solve problems larger than the number of available qubits in a quantum device. We apply this method to combinatorial optimization problems, where inherent structures can be identified, and show how to implement these parallelized quantum circuits. We show how to formulate an objective function for the classical optimizer to guide the optimization towards meaningful solutions. We test our framework by creating a parallelized version of the Quantum Approximate Optimization Algorithm and a variational version of quantum annealing and explain how our framework applies to other quantum optimization algorithms. We provide results obtained both from simulation and experiments on real hardware. Our results show that the information lost by splitting the quantum circuits can be partially recovered by optimizing a global objective function evaluated with the separate circuit samples.
- 19 February 2025
- Published by Springer Nature in npj Quantum Information
- Vol. 11 (1) , 1-12
Open AccessParallel circuit implementation of variational quantum algorithms
We present a framework to split quantum circuits of variational quantum algorithms (VQAs) to allow for parallel training and execution to solve problems larger than the number of available qubits in a quantum device. We apply this method to combinatorial optimization problems, where inherent structures can be identified, and show how to implement these parallelized quantum circuits. We show how to formulate an objective function for the classical optimizer to guide the optimization towards meaningful solutions. We test our framework by creating a parallelized version of the Quantum Approximate Optimization Algorithm and a variational version of quantum annealing and explain how our framework applies to other quantum optimization algorithms. We provide results obtained both from simulation and experiments on real hardware. Our results show that the information lost by splitting the quantum circuits can be partially recovered by optimizing a global objective function evaluated with the separate circuit samples.