Search

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 distances to close-by solutions. We also perform experiments with the D-Wave Advantage 5.1 quantum annealer, solving many instances of up to 170-variable, quadratic unconstrained binary optimization problems. Our results demonstrate that the exponents characterizing the success probability of a D-Wave annealer to solve a QUBO correlate very well with the predictions based on the Hamming distance distributions computed for small problem instances., 6 pages, 6 figures

Kernel-based support vector machines (SVMs) are supervised machine learning algorithms for classification and regression problems. We introduce a method to train SVMs on a D-Wave 2000Q quantum annealer and study its performance in comparison to SVMs trained on conventional computers. The method is applied to both synthetic data and real data obtained from biology experiments. We find that the quantum annealer produces an ensemble of different solutions that often generalizes better to unseen data than the single global minimum of an SVM trained on a conventional computer, especially in cases where only limited training data is available. For cases with more training data than currently fits on the quantum annealer, we show that a combination of classifiers for subsets of the data almost always produces stronger joint classifiers than the conventional SVM for the same parameters., corrected typo in Eq. (11) and relation to SVM variant on p. 4; open source code available at https://gitlab.version.fz-juelich.de/cavallaro1/svm_quantum-annealer

The interplay between the singlet ground state of the antiferromagnetic Heisenberg model and the experimentally measured N��el state of antiferromagnets is studied. To verify the hypothesis [M. I. Katsnelson et al., Phys. Rev. B 63, 212404 (2001)] that the latter can be considered to be a result of local measurements destroying the entanglement of the quantum ground state, we have performed systematic simulations of the effects of von Neumannmeasurements for the case of a one-dimensional antiferromagnetic spin-1/2 system for various types and degrees of magnetic anisotropies. It is found that in the ground state, a magnetization measurement can create decoherence waves [M. I. Katsnelson et al. Phys. Rev. A 62, 022118 (2000)] in the magnetic sublattices, and that a symmetry breaking anisotropy does not lead to alignment of the spins in a particular direction. However, for an easy-axis anisotropy of the same order magnitude as the exchange constant, a measurement on the singlet ground state can create N��el-ordering in finite systems of experimentally accessible size.

We study measures of decoherence and thermalization of a quantum system $S$ in the presence of a quantum environment (bath) $E$. The whole system is prepared in a canonical thermal state at a finite temperature. Applying perturbation theory with respect to the system-environment coupling strength, we find that under common Hamiltonian symmetries, up to first order in the coupling strength it is sufficient to consider the uncoupled system to predict decoherence and thermalization measures of $S$. This decoupling allows closed form expressions for perturbative expansions for the measures of decoherence and thermalization in terms of the free energies of $S$ and of $E$. Numerical results for both coupled and decoupled systems with up to 40 quantum spins validate these findings., Comment: 5 pages, 3 figures

We present a systematic study of the electronic, transport and optical properties of disordered graphene including the next-nearest-neighbor hopping. We show that this hopping has a non-negligible effect on resonant scattering but is of minor importance for long-range disorder such as charged impurities, random potentials or hoppings induced by strain fluctuations. Different types of disorders can be recognized by their fingerprints appearing in the profiles of dc conductivity, carrier mobility, optical spectroscopy and Landau level spectrum. The minimum conductivity $4e^{2}/h$ found in the experiments is dominated by long-range disorder and the value of $4e^{2}/\pi h$ is due to resonant scatterers only., Comment: 9 pages, 7 figures, 1 table

Data produced by laboratory Einstein-Podolsky-Rosen-Bohm (EPRB) experiments is tested against the hypothesis that the statistics of this data is given by quantum theory of this thought experiment. Statistical evidence is presented that the experimental data, while violating Bell inequalities, does not support this hypothesis. It is shown that an event-based simulation model, providing a cause-and-effect description of real EPRB experiments at a level of detail which is not covered by quantum theory, reproduces the results of quantum theory of this thought experiment, indicating that there is no fundamental obstacle for a real EPRB experiment to produce data that can be described by quantum theory., Comment: FPP6 - Foundations of Probability and Physics 6, AIP Conference Proceedings, in press

We present a computer simulation model that is a one-to-one copy of a quantum eraser experiment with photons (P. D. D. Schwindt {\sl et al.}, Phys. Rev. A 60, 4285 (1999)). The model is solely based on experimental facts, satisfies Einstein's criterion of local causality and does not require knowledge of the solution of a wave equation. Nevertheless, the simulation model reproduces the averages as obtained from the wave mechanical description of the quantum eraser experiment, proving that it is possible to give a particle-only description of quantum eraser experiments with photons. We demonstrate that although the visibility can be used as a measure for the interference, it cannot be used to quantify the wave character of a photon. The classical particle-like simulation model renders the concept of wave-particle duality, used to explain the outcome of the quantum eraser experiment with photons, superfluous., J. Comp. Theor. Nanosci., in press; see also http://www.compphys.net

Motivated by recent experimental observations of size quantization of electron energy levels in graphene quantum dots \cite{ponomarenko} we investigate the level statistics in the simplest tight-binding model for different dot shapes by computer simulation. The results are in a reasonable agreement with the experiment which confirms qualitatively interpretation of observed level statistics in terms of "Dirac billiards" without taking into account many-body effects. It is shown that edge effects are in general sufficient to produce the observed level distribution and that even strong bulk disorder does not change the results drastically., Published: Pis'ma v ZhETF, vol. 88, iss. 9, pp. 698 -- 701 (2008)

We present a computer simulation model that reproduces, event-by-event, the wave mechanical results of double-slit and two-beam interference experiments. The same model also simulates a one-to-one copy of a single-photon interference experiment with a Fresnel biprism (Jacques V. et al., Eur. Phys. J. D, 35 (2005) 561). The model satisfies Einstein's criterion of local causality and is solely based on experimental facts, comprising the apparatuses used in the experiment and the observation of individual detector clicks. Our results prove that it is possible to give a particle-only description of single-photon double-slit experiments., Comment: 6 pages, 6 figures

We study the decoherence of two coupled spins that interact with a spin-bath environment. It is shown that the connectivity and the coupling strength between the spins in the environment are of crucial importance for the decoherence of the central system. Changing the connectivity or coupling strenghts changes the decoherence of the central system from Gaussian to exponential decay law.

The general conclusion of Seevinck and Larsson is that our model exploits the so-called coincidence-time loophole and produces sinusoidal (quantum-like) correlations but does not model the singlet state because it does not violate the relevant Bell inequality derived by Larsson and Gill, since in order to obtain the sinusoidal correlations the probability of coincidences in our model goes to zero. In this reply, we refute their arguments that lead to this conclusion and demonstrate that our model can reproduce results of photon and ion-trap experiments with frequencies of coincidences that are not in conflict with the observations., Comment: Corrected typos

We propose and analyse simple deterministic algorithms that can be used to construct machines that have primitive learning capabilities. We demonstrate that locally connected networks of these machines can be used to perform blind classification on an event-by-event basis, without storing the information of the individual events. We also demonstrate that properly designed networks of these machines exhibit behavior that is usually only attributed to quantum systems. We present networks that simulate quantum interference on an event-by-event basis. In particular we show that by using simple geometry and the learning capabilities of the machines it becomes possible to simulate single-photon interference in a Mach-Zehnder interferometer. The interference pattern generated by the network of deterministic learning machines is in perfect agreement with the quantum theoretical result for the single-photon Mach-Zehnder interferometer. To illustrate that networks of these machines are indeed capable of simulating quantum interference we simulate, event-by-event, a setup involving two chained Mach-Zehnder interferometers. We show that also in this case the simulation results agree with quantum theory., Additional material: http://www.compphys.net/dlm

This review gives a survey of numerical algorithms and software to simulate quantum computers.It covers the basic concepts of quantum computation and quantum algorithms and includes a few examples that illustrate the use of simulation software for ideal and physical models of quantum computers., Comment: To appear in: Handbook of Theoretical and Computational Nanotechnology (American Scientific Publishers)

Computer simulations of decoherence in quantum spin systems require the solution of the time-dependent Schrodinger equation for interacting quantum spin systems over extended periods of time. We use exact diagonalization, Chebyshev polynomial technique, four Suzuki-formula algorithms, and the short-iterative-Lanczos method to solve a simple model for decoherence of a quantum spin system by an environment consisting of quantum spins, and compare advantages and limitations of different algorithms., Comment: 5 pages (llncs.sty, Springer style file), 1 EPS figure. The paper will appear in "Computer Simulation Studies in Condensed-Matter Physics XVI", eds. D.P. Landau et al., Springer Proceedings in Physics (Springer, Berlin, 2004)

The magnetic energy-level diagrams for models of the Mn12 and V15 molecule are calculated using the Lanczos method with full orthogonalization and a Chebyshev-polynomial-based projector method. The effect of the Dzyaloshinskii-Moriya interaction on the appearance of energy-level repulsions and its relevance to the observation of steps in the time-dependent magnetization data is studied. We assess the usefulness of simplified models for the description of the zero-temperature magnetization dynamics.

We review some recent developments in numerical algorithms to solve the time-dependent Maxwell equations for systems with spatially varying permittivity and permeability. We show that the Suzuki product-formula approach can be used to construct a family of unconditionally stable algorithms, the conventional Yee algorithm, and two new variants of the Yee algorithm that do not require the use of the staggered-in-time grid. We also consider a one-step algorithm, based on the Chebyshev polynomial expansion, and compare the computational efficiency of the one-step, the Yee-type, the alternating-direction-implicit, and the unconditionally stable algorithms. For applications where the long-time behavior is of main interest, we find that the one-step algorithm may be orders of magnitude more efficient than present multiple time-step, finite-difference time-domain algorithms.

For the recently introduced algorithms to solve the time-dependent Maxwell equations (see Phys.Rev.E Vol.64 p.066705 (2001)), we construct a variable grid implementation and an improved spatial discretization implementation that preserve the property of the algorithms to be unconditionally stable by construction. We find that the performance and accuracy of the corresponding algorithms are significant and illustrate their practical relevance by simulating various physical model systems., 18 pages, 16 figures

We describe a simulation method for a quantum spin model of a generic, general purpose quantum computer. The use of this quantum computer simulator is illustrated through several implementations of Grover's database search algorithm. Some preliminary results on the stability of quantum algorithms are presented., 6 pages, 4 figures ; Minor errors corrected and figures updated