Martin Leib

Martin Leib

Auto-generated profile, based on publicly available information

Martin Leib

Data:Lab, Volkswagen Group, Ungererstraße 69, 80805 München, Germany

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 February 2021 in Nature Physics
Verified
Journal Article
Closed access
PDF file
MHMatthew P. Harrigan
Matthew P. Harrigan
MNMatthew Neeley
Matthew Neeley
KSKevin J. Satzinger
Kevin J. Satzinger
FAFrank Arute
Frank Arute
KAKunal Arya
Kunal Arya
RBRyan Babbush
Ryan Babbush

12 May 2020 in Quantum Science and Technology
Verified
Journal Article
Closed access
PDF file
MSMichael Streif
Michael Streif
MLMartin Leib
Martin Leib
In this paper, we eliminate the classical outer learning loop of the quantum approximate optimization algorithm (QAOA) and present a strategy to find good parameters for QAOA based on topological arguments of the problem graph and tensor network techniques. Starting from the observation of the concentration of control parameters of QAOA, we find a way to classically infer parameters which scales polynomially in the number of qubits and exponentially with the depth of the circuit. Using this strategy, the quantum processing unit (QPU) is only needed to sample from the final state of QAOA. This method paves the way for a variation-free version of QAOA and makes QAOA more practical for applications on NISQ devices. We investigate the performance of the proposed approach for the initial assumptions and its resilience with respect to situations where they are not fulfilled. Moreover, we investigate the applicability of our method beyond the scope of QAOA, in improving schedules for quantum annealing.

2 July 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MSMichael Streif
Michael Streif
SYSheir Yarkoni
Sheir Yarkoni
ASAndrea Skolik
Andrea Skolik
FNFlorian Neukart
Florian Neukart
MLMartin Leib
Martin Leib
The binary paint shop problem (BPSP) is an APX-hard optimization problem of the automotive industry. In this work, we show how to use the quantum approximate optimization algorithm (QAOA) to find solutions of the BPSP. We demonstrate that QAOA with constant depth is able to beat all known heuristics for the binary paint shop problem on average in the infinite size limit n→∞. We complete our studies by running first experiments of small-sized instances on a trapped-ion quantum computer through Amazon Braket.

13 April 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MSMichael Streif
Michael Streif
MLMartin Leib
Martin Leib
FWFilip Wudarski
Filip Wudarski
EREleanor Rieffel
Eleanor Rieffel
ZWZhihui Wang
Zhihui Wang
Quantum circuits with local particle-number conservation restrict the quantum computation to a subspace of the Hilbert space of the qubit register. In a noiseless or fault-tolerant quantum computation, such quantities are preserved. In the presence of noise, however, the evolution's symmetry could be broken and nonvalid states could be sampled at the end of the computation. On the other hand, the restriction to a subspace in the ideal case suggests the possibility of more resource-efficient error-mitigation techniques for circuits preserving symmetries that are not possible for general circuits. Here, we analyze the probability of staying in such symmetry-preserved subspaces under noise, providing an exact formula for local depolarizing noise. We apply our findings to benchmark, under depolarizing noise, the symmetry robustness of the XY quantum alternating operator Ansatz, which has local particle-number conserving symmetries and is a special case of the quantum alternating operator Ansatz. We also analyze the influence of the choice of encoding the problem on the symmetry robustness of the algorithm and discuss a simple adaption of the bit-flip code to correct for symmetry-breaking errors with reduced resources.

8 November 2022 in Physical Review Research
Verified
Journal Article
Open access
PDF file
MAManuel G. Algaba
Manuel G. Algaba
MPMario Ponce-Martinez
Mario Ponce-Martinez
CMCarlos Munuera-Javaloy
Carlos Munuera-Javaloy
VPVicente Pina-Canelles
Vicente Pina-Canelles
MTManish J. Thapa
Manish J. Thapa
HHHermanni Heimonen
Hermanni Heimonen
Quantum computers have the potential to efficiently simulate the dynamics of nanoscale NMR systems. In this work, we demonstrate that a noisy intermediate-scale quantum computer can be used to simulate and predict nanoscale NMR resonances. In order to minimize the required gate fidelities, we propose a superconducting application-specific Co-Design quantum processor that reduces the number of SWAP gates by over 90% for chips with more than 20 qubits. The processor consists of transmon qubits capacitively coupled via tunable couplers to a central co-planar waveguide resonator with a quantum circuit refrigerator (QCR) for fast resonator reset. The QCR implements the nonunitary quantum operations required to simulate nuclear hyperpolarization scenarios.

28 October 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MSMichael Streif
Michael Streif
MLMartin Leib
Martin Leib
We present a thorough investigation of problems that can be solved exactly with the level-1 quantum approximate optimization algorithm (QAOA). To this end, we implicitly define a class of problem Hamiltonians that are employed as phase separators in a level-1 QAOA circuit and provide unit overlap with a target subspace spanned by a set of computational basis states. For one-dimensional target subspaces, we identify instances within the implicitly defined class of Hamiltonians for which quantum annealing (QA) and simulated annealing (SA) have an exponentially small probability of finding the solution. Consequently, our results define a demarcation line between QAOA on one hand and QA and SA on the other, and highlight the fundamental differences between an interference-based search heuristic such as QAOA and heuristics that are based on thermal and quantum fluctuations like SA and QA respectively. Moreover, for two-dimensional solution subspaces, we are able to show that the depth of the QAOA circuit grows linearly with the Hamming distance between the two target states. We further show that there are no genuine solutions for target subspaces of dimension higher than 2 and smaller than 2n. We also transfer these results to instantaneous quantum polynomial (IQP) circuits.