124 citations · 1.4k across the 58 of their papers we have counts for
41 papers · 1 filter
Large-Scale Simulation of Shor's Quantum Factoring Algorithm
Dennis Willsch, Madita Willsch, Fengping Jin +2
Shor's factoring algorithm is one of the most anticipated applications of quantum computing. However, the limited capabilities of today's quantum computers only permit a study of S…
Einstein-Podolsky-Rosen-Bohm experiments: a discrete data driven approach
Hans De Raedt, Mikhail I. Katsnelson, Manpreet S. Jattana +5
We take the point of view that building a one-way bridge from experimental data to mathematical models instead of the other way around avoids running into controversies resulting f…
Model-free inequality for data of Einstein-Podolsky-Rosen-Bohm experiments
Hans De Raedt, Mikhail I. Katsnelson, Manpreet S. Jattana +5
We present a new inequality constraining correlations obtained when performing Einstein-Podolsky-Rosen-Bohm experiments. The proof does not rely on mathematical models that are ima…
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…
Hybrid Quantum Classical Simulations
Dennis Willsch, Manpreet Jattana, Madita Willsch +4
We report on two major hybrid applications of quantum computing, namely, the quantum approximate optimisation algorithm (QAOA) and the variational quantum eigensolver (VQE). Both a…
Classical, quantum and event-by-event simulation of a Stern-Gerlach experiment with neutrons
Hans De Raedt, Fengping Jin, Kristel Michielsen
We present a comprehensive simulation study of the Newtonian and quantum model of a Stern-Gerlach experiment with cold neutrons.By solving Newton's equation of motion and the time-…
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…
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…
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…
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…
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…
Quantum Annealing with Trigger Hamiltonians: Application to 2-SAT and Nonstoquastic Problems
Vrinda Mehta, Fengping Jin, Hans De Raedt +1
We study the performance of quantum annealing for two sets of problems, namely, 2-satisfiability (2-SAT) problems represented by Ising-type Hamiltonians, and nonstoquastic problems…
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…
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…
General error mitigation for quantum circuits
Manpreet Singh Jattana, Fengping Jin, Hans De Raedt +1
A general method to mitigate the effect of errors in quantum circuits is outlined. The method is developed in sight of characteristics that an ideal method should possess and to am…
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…
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…
Discrete-event simulation of an extended Einstein-Podolsky-Rosen-Bohm experiment
Hans De Raedt, Manpreet Singh Jattana, Dennis Willsch +3
We use discrete-event simulation to construct a subquantum model that can reproduce the quantum-theoretical prediction for the statistics of data produced by the Einstein-Podolsky-…
Benchmarking Supercomputers with the Jülich Universal Quantum Computer Simulator
Dennis Willsch, Hannes Lagemann, Madita Willsch +3
We use a massively parallel simulator of a universal quantum computer to benchmark some of the most powerful supercomputers in the world. We find nearly ideal scaling behavior on t…
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…
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…
Quantum annealing with anneal path control: application to 2-SAT problems with known energy landscapes
Ting-Jui Hsu, Fengping Jin, Christian Seidel +3
We study the effect of the anneal path control per qubit, a new user control feature offered on the D-Wave 2000Q quantum annealer, on the performance of quantum annealing for solvi…
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…
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…