output
19932023
most citedLeading hadronic contribution to the muon magnetic moment from lattice QCD

838 citations

Showing quant-phShow all

40 papers · 1 filter

quant-ph2022★ 3 cited

On the experimental verification of the uncertainty principle of position and momentum

Thomas Schürmann, Ingo Hoffmann, Winfrid Görlich

Historically, Kennard was the first to choose the standard deviation as a quantitative measure of uncertainty, and neither he nor Heisenberg explicitly explained why this choice sh…

quant-ph2022★ 47 cited

Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms

Alejandro Montanez-Barrera, Dennis Willsch, Alberto Maldonado-Romo +1

Solving combinatorial optimization problems of the kind that can be codified by quadratic unconstrained binary optimization (QUBO) is a promising application of quantum computation…

quant-ph2022★ 3 cited

On the fragility of gate-error metrics in simulation models of flux-tunable transmon quantum computers

Hannes Lagemann, Dennis Willsch, Madita Willsch +3

Constructing a quantum computer requires immensely precise control over a quantum system. A lack of precision is often quantified by gate-error metrics, such as the average infidel…

quant-ph2022★ 8 cited

On the hardness of quadratic unconstrained binary optimization problems

Vrinda Mehta, Fengping Jin, Kristel Michielsen +1

We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming…

quant-ph2022

Folding lattice proteins with quantum annealing

Anders Irbäck, Lucas Knuthson, Sandipan Mohanty +1

Quantum annealing is a promising approach for obtaining good approximate solutions to difficult optimization problems. Folding a protein sequence into its minimum-energy structure…

quant-ph2022★ 16 cited

Improved variational quantum eigensolver via quasi-dynamical evolution

Manpreet Singh Jattana, Fengping Jin, Hans De Raedt +1

The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for current and near-term quantum devices. Despite its initial success, there is a lack o…

quant-ph2022★ 12 cited

Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability

Vrinda Mehta, Fengping Jin, Hans De Raedt +1

In recent years, quantum annealing has gained the status of being a promising candidate for solving various optimization problems. Using a set of hard 2-satisfiabilty (2-SAT) probl…

quant-ph2022★ 15 cited

Assessment of the variational quantum eigensolver: application to the Heisenberg model

Manpreet Singh Jattana, Fengping Jin, Hans De Raedt +1

We present and analyze large-scale simulation results of a hybrid quantum-classical variational method to calculate the ground state energy of the anti-ferromagnetic Heisenberg mod…

quant-ph2022★ 5 cited

Numerical analysis of effective models for flux-tunable transmon systems

Hannes Lagemann, Dennis Willsch, Madita Willsch +3

Simulations and analytical calculations that aim to describe flux-tunable transmons are usually based on effective models of the corresponding lumped-element model. However, when a…

quant-ph2021★ 4 cited

On momentum operators given by Killing vectors whose integral curves are geodesics

Thomas Schürmann

We consider momentum operators on intrinsically curved manifolds. Given that the momentum operators are Killing vector fields whose integral curves are geodesics, it is shown that…

quant-ph2021★ 121 cited

Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems

Dennis Willsch, Madita Willsch, Carlos D. Gonzalez Calaza +4

We benchmark the quantum processing units of the largest quantum annealers to date, the 5000+ qubit quantum annealer Advantage and its 2000+ qubit predecessor D-Wave 2000Q, using t…

quant-ph2021★ 38 cited

GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm

Dennis Willsch, Madita Willsch, Fengping Jin +2

We study large-scale applications using a GPU-accelerated version of the massively parallel Jülich universal quantum computer simulator (JUQCS--G). First, we benchmark JUWELS Boost…

quant-ph2021★ 16 cited

Garden optimization problems for benchmarking quantum annealers

Carlos D. Gonzalez Calaza, Dennis Willsch, Kristel Michielsen

We benchmark the 5000+ qubit system Advantage coupled with the Hybrid Solver Service 2 released by D-Wave Systems Inc. in September 2020 by using a new class of optimization proble…

quant-ph2020★ 49 cited

Random State Technology

Fengping Jin, Dennis Willsch, Madita Willsch +3

We review and extend, in a self-contained way, the mathematical foundations of numerical simulation methods that are based on the use of random states. The power and versatility of…

quant-ph2020★ 43 cited

Quantum non-demolition dispersive readout of a superconducting artificial atom using large photon numbers

Daria Gusenkova, Martin Spiecker, Richard Gebauer +13

Reading out the state of superconducting artificial atoms typically relies on dispersive coupling to a readout resonator. For a given system noise temperature, increasing the circu…

quant-ph2020

Long-Time Correlations in Single-Neutron Interferometry Data

M. Willsch, D. Willsch, K. Michielsen +5

We present a detailed analysis of the time series of time-stamped neutron counts obtained by single-neutron interferometry. The neutron counting statistics display the usual Poisso…

quant-ph2019★ 124 cited

Benchmarking the Quantum Approximate Optimization Algorithm

Madita Willsch, Dennis Willsch, Fengping Jin +2

The performance of the quantum approximate optimization algorithm is evaluated by using three different measures: the probability of finding the ground state, the energy expectatio…

quant-ph2019★ 11 cited

Real-time simulation of flux qubits used for quantum annealing

Madita Willsch, Dennis Willsch, Fengping Jin +2

The real-time flux dynamics of up to three superconducting quantum interference devices (SQUIDs) are studied by numerically solving the time-dependent Schrödinger equation. The num…

quant-ph2018★ 233 cited

PennyLane: Automatic differentiation of hybrid quantum-classical computations

Ville Bergholm, Josh Izaac, Maria Schuld +65

PennyLane is a Python 3 software framework for differentiable programming of quantum computers. The library provides a unified architecture for near-term quantum computing devices,…

quant-ph2018★ 8 cited

Separation of conditions as a prerequisite for quantum theory

Hans De Raedt, Mikhail I. Katsnelson, Dennis Willsch +1

We introduce the notion of "separation of conditions" meaning that a description of statistical data obtained from experiments, performed under a set of different conditions, allow…

quant-ph2018★ 28 cited

Testing quantum fault tolerance on small systems

D. Willsch, M. Willsch, F. Jin +2

We extensively test a recent protocol to demonstrate quantum fault tolerance on three systems: (1) a real-time simulation of five spin qubits coupled to an environment with two-lev…

quant-ph2018★ 124 cited

Massively parallel quantum computer simulator, eleven years later

Hans De Raedt, Fengping Jin, Dennis Willsch +5

A revised version of the massively parallel simulator of a universal quantum computer, described in this journal eleven years ago, is used to benchmark various gate-based quantum a…

quant-ph2016★ 10 cited

Analysis of Wigner's Set Theoretical Proof for Bell-type inequalities

Karl Hess, Hans De Raedt, Kristel Michielsen

We present a detailed analysis of the set theoretical proof of Wigner for Bell type inequalities with the following result. Wigner introduced a crucial assumption that is not relat…

quant-ph2016★ 12 cited

From Boole to Leggett-Garg: Epistemology of Bell-type Inequalities

Karl Hess, Hans De Raedt, Kristel Michielsen

In 1862, George Boole derived an inequality for variables, now known as Boolean variables, that in his opinion represents a demarcation line between possible and impossible experie…