arXiv subjects

Bartłomiej Gardas

Publications and source records attributed to Bartłomiej Gardas.

At least 37 records · Page 2Linked to original sources

arXiv2021

Quantum annealing in the NISQ era: railway conflict management

We are in the Noisy Intermediate-Scale Quantum (NISQ) devices' era, in which quantum hardware has become available for application in real-world problems. However, demonstrating the usefulness of such NISQ devices are still rare. In this work, we consider a practical railway dispatching problem: delay and conflict management on single-track railway lines. We examine the issue of train dispatching consequences caused by the arrival of an already delayed train to the network segment being considered. This problem is computationally hard and needs to be solved almost in real-time. We introduce a quadratic unconstrained binary optimization (QUBO) model of this problem, compatible with the emerging quantum annealing technology. The model's instances can be executed on present-day quantum annealers. As a proof-of-concept, we solve selected real-life problems from the Polish railway network using D-Wave quantum annealers. As a reference, we also provide solutions calculated with classical methods, including those relevant to the community (linear integer programming) and a sophisticated algorithm based on tensor networks for solving Ising instances. Our preliminary results illustrate the degree of difficulty of real-life railway instances for the current quantum annealing technology. Moreover, our analysis shows that the new generation of quantum annealers (the advantage system) perform much worse on those instances than its predecessor.

quant-ph↗

arXiv2021

Approximate optimization, sampling and spin-glass droplets discovery with tensor networks

We devise a deterministic algorithm to efficiently sample high-quality solutions of certain spin-glass systems that encode hard optimization problems. We employ tensor networks to represent the Gibbs distribution of all possible configurations. Using approximate tensor-network contractions, we are able to efficiently map the low-energy spectrum of some quasi-two-dimensional Hamiltonians. We exploit the local nature of the problems to compute spin-glass droplets geometries, which provides a new form of compression of the low-energy spectrum. It naturally extends to sampling, which otherwise, for exact contraction, is $\#$P-complete. In particular, for one of the hardest known problem-classes devised on chimera graphs known as deceptive cluster loops and for up to $2048$ spins, we find on the order of $10^{10}$ degenerate ground states in a single run of our algorithm, computing better solutions than have been reported on some hard instances. Our gradient-free approach could provide new insight into the structure of disordered spin-glass complexes, with ramifications both for machine learning and noisy intermediate-scale quantum devices.

cond-mat.stat-mech↗

arXiv2021

Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines

In this work, we consider a practical railway dispatching problem: delay and conflict management on a single-track railway line. We examine the issue of train dispatching consequences caused by the arrival of an already delayed train to the segment being considered. This problem is computationally hard and often needs to be solved timely. Here, we introduce a quadratic unconstrained binary optimization (QUBO) model of the problem in question, compatible with the emerging quantum annealing technology. The model's instances can be executed on present-day quantum annealers. As a proof-of-concept, we solve selected real-life problems from the Polish railway network using D-Wave quantum annealers. As a reference, we also provide solutions calculated with classical methods, including those relevant to the community (linear integer programming) and a sophisticated algorithm based on tensor networks for solving QUBO problems.

cs.ET↗

arXiv2020

Separability gap and large deviation entanglement criterion

For a given Hamiltonian $H$ on a multipartite quantum system, one is interested in finding the energy $E_0$ of its ground state. In the separability approximation, arising as a natural consequence of measurement in a separable basis, one looks for the minimal expectation value $λ_{\rm min}^{\otimes}$ of $H$ among all product states. For several concrete model Hamiltonians, we investigate the difference $λ_{\rm min}^{\otimes}-E_0$, called separability gap, which vanishes if the ground state has a product structure. In the generic case of a random Hermitian matrix of the Gaussian orthogonal ensemble, we find explicit bounds for the size of the gap which depend on the number of subsystems and hold with probability one. This implies an effective entanglement criterion applicable for any multipartite quantum system: If an expectation value of a typical observable among a given state is sufficiently distant from the average value, the state is almost surely entangled.

quant-ph↗

arXiv2019

Brute-forcing spin-glass problems with CUDA

We demonstrate how to compute the low energy spectrum for small ($N\le 50$), but otherwise arbitrary, spin-glass instances using modern Graphics Processing Units or similar heterogeneous architecture. Our algorithm performs an exhaustive (i.e., brute-force) search of all possible configurations to select $S\ll 2^N$ lowest ones together with their corresponding energies. We mainly focus on the Ising model defined on an arbitrary graph. An open-source implementation based on CUDA Fortran and a suitable Python wrapper are provided. As opposed to heuristic approaches, ours is exact and thus can serve as a references point to benchmark other algorithms and hardware, including quantum and digital annealers. Our implementation offers unprecedented speed and efficiency already visible on commodity hardware. At the same time, it can be easily launched on professional, high-end graphics cards virtually at no extra effort. As a practical application, we employ it to demonstrate that the recent Matrix Product State based algorithm-despite its one-dimensional nature-can still accurately approximate the low energy spectrum of fully connected graphs of size $N$ approaching $50$.

physics.comp-ph↗

arXiv2019

Parallel in time dynamics with quantum annealers

Recent years have witnessed an unprecedented increase in experiments and hybrid simulations involving quantum computers. In particular, quantum annealers. Although quantum supremacy has not been established thus far, there exist a plethora of algorithms promising to outperform classical computers in the near-term future. Here, we propose a parallel in time approach to simulate dynamical systems designed to be executed already on present-day quantum annealers. In essence, purely classical methods for solving dynamics systems are serial. Therefore, their parallelization is substantially limited. In the presented approach, however, the time evolution is rephrased as a ground--state search of a classical Ising model. Such a problem is solved intrinsically in parallel by quantum computers. The main idea is exemplified by simulating the Rabi oscillations generated by a two-level quantum system (i.e. qubit) experimentally.

quant-ph↗

arXiv2019

Disorder-assisted graph coloring on quantum annealers

We are at the verge of a new era, which will be dominated by Noisy Intermediate-Scale Quantum Devices. Prototypical examples for these new technologies are present-day quantum annealers. In the present work, we investigate to what extent static disorder generated by an external source of noise does not have to be detrimental, but can actually assist quantum annealers in achieving better performance. In particular, we analyze the graph coloring problem that can be solved on a sparse topology (i.e. chimera graph) via suitable embedding. We show that specifically tailored disorder can enhance the fidelity of the annealing process and thus increase the overall performance of the annealer.

quant-ph↗

arXiv2018

Quantum neural networks to simulate many-body quantum systems

We conduct experimental simulations of many body quantum systems using a \emph{hybrid} classical-quantum algorithm. In our setup, the wave function of the transverse field quantum Ising model is represented by a restricted Boltzmann machine. This neural network is then trained using variational Monte Carlo assisted by a D-Wave quantum sampler to find the ground state energy. Our results clearly demonstrate that already the first generation of quantum computers can be harnessed to tackle non-trivial problems concerning physics of many body quantum systems.

quant-ph↗

arXiv2018

Defects in Quantum Computers

The shift of interest from general purpose quantum computers to adiabatic quantum computing or quantum annealing calls for a broadly applicable and easy to implement test to assess how quantum or adiabatic is a specific hardware. Here we propose such a test based on an exactly solvable many body system -- the quantum Ising chain in transverse field -- and implement it on the D-Wave machine. An ideal adiabatic quench of the quantum Ising chain should lead to an ordered broken symmetry ground state with all spins aligned in the same direction. An actual quench can be imperfect due to decoherence, noise, flaws in the implemented Hamiltonian, or simply too fast to be adiabatic. Imperfections result in topological defects: Spins change orientation, kinks punctuating ordered sections of the chain. The number of such defects quantifies the extent by which the quantum computer misses the ground state, and is, therefore, imperfect.

quant-ph↗

arXiv2018

Quantum fluctuation theorem to benchmark quantum annealers

Near term quantum hardware promises unprecedented computational advantage. Crucial in its development is the characterization and minimization of computational errors. We propose the use of the quantum fluctuation theorem to benchmark the performance of quantum annealers. This versatile tool provides simple means to determine whether the quantum dynamics are unital, unitary, and adiabatic, or whether the system is prone to thermal noise. Our proposal is experimentally tested on two generations of the D-Wave machine, which illustrates the sensitivity of the fluctuation theorem to the smallest aberrations from ideal annealing.

quant-ph↗

arXiv2017

Dynamics of a quantum phase transition in the 1D Bose-Hubbard model: excitations and correlations induced by a quench

The ground state of the one-dimensional Bose-Hubbard model at unit filling undergoes the Mott-superfluid quantum phase transition. It belongs to the Kosterlitz-Thouless universality class with an exponential divergence of the correlation length in place of the usual power law. We present numerical simulations of a linear quench both from the Mott insulator to superfluid and back. The results satisfy the scaling hypothesis that follows from the Kibble-Zurek mechanism (KZM). In the superfluid-to-Mott quenches there is no significant excitation in the superfluid phase despite its gaplessness. Since all critical superfluid ground states are qualitatively similar, the excitation begins to build up only after crossing the critical point when the ground state begins to change fundamentally. The last process falls into the KZM framework.

cond-mat.stat-mech↗

arXiv2016

$\mathcal{P}\mathcal{T}$-symmetric slowing-down of decoherence

We investigate $\mathcal{P}\mathcal{T}$-symmetric quantum systems ultra-weakly coupled to an environment. We find that such open systems evolve under $\mathcal{P}\mathcal{T}$-symmetric, purely dephasing and unital dynamics. The dynamical map describing the evolution is then determined explicitly using a quantum canonical transformation. Furthermore, we provide an explanation of why $\mathcal{P}\mathcal{T}$-symmetric dephasing type interactions lead to \emph{critical slowing down of decoherence}. This effect is further exemplified with an experimentally relevant system -- a $\mathcal{P}\mathcal{T}$-symmetric qubit easily realizable, \emph{e.g.}, in optical or microcavity experiments.

quant-ph↗

arXiv2016

Repeatability of measurements: Equivalence of hermitian and non-hermitian observables

A non-commuting measurement transfers, via the apparatus, information encoded in a system's state to the external "observer". Classical measurements determine properties of physical objects. In the quantum realm, the very same notion restricts the recording process to orthogonal states as only those are distinguishable by measurements. Therefore, even a possibility to describe physical reality by means of non-hermitian operators should \emph{volens nolens} be excluded as their eigenstates are not orthogonal. Here, we show that non-hermitian operators with real spectrum can be treated within the standard framework of quantum mechanics. Furthermore, we propose a quantum canonical transformation that maps hermitian systems onto non-hermitian ones. Similar to classical inertial forces this transformation is accompanied by an energetic cost pinning the system on the unitary path.

quant-ph↗

arXiv2016

Non-hermitian quantum thermodynamics

Thermodynamics is the phenomenological theory of heat and work. Here we analyze to what extent quantum thermodynamic relations are immune to the underlying mathematical formulation of quantum mechanics. As a main result, we show that the Jarzynski equality holds true for all non-hermitian quantum systems with real spectrum. This equality expresses the second law of thermodynamics for isothermal processes arbitrarily far from equilibrium. In the quasistatic limit however, the second law leads to the Carnot bound which is fulfilled even if some eigenenergies are complex provided they appear in conjugate pairs. Furthermore, we propose two setups to test our predictions. Namely with strongly interacting excitons and photons in a semiconductor microcavity and in the non-hermitian tight-binding model.

quant-ph↗

arXiv2015

Thermodynamic universality of quantum Carnot engines

The Carnot statement of the second law of thermodynamics poses an upper limit on the efficiency of all heat engines. Recently, it has been studied whether generic quantum features such as coherence and quantum entanglement could allow for quantum devices with efficiencies larger than the Carnot efficiency. The present study shows that this is not permitted by the laws of thermodynamics. In particular, we will show that rather the definition of heat has to be modified to account for the thermodynamic cost for maintaining coherence and entanglement. Our theoretical findings are numerically illustrated for an experimentally relevant example from optomechanics.

cond-mat.stat-mech↗

arXiv2015

GPU-based acceleration of free energy calculations in solid state physics

Obtaining a thermodynamically accurate phase diagram through numerical calculations is a computationally expensive problem that is crucially important to understanding the complex phenomena of solid state physics, such as superconductivity. In this work we show how this type of analysis can be significantly accelerated through the use of modern GPUs. We illustrate this with a concrete example of free energy calculation in multi-band iron-based superconductors, known to exhibit a superconducting state with oscillating order parameter. Our approach can also be used for classical BCS-type superconductors. With a customized algorithm and compiler tuning we are able to achieve a 19x speedup compared to the CPU (119x compared to a single CPU core), reducing calculation time from minutes to mere seconds, enabling the analysis of larger systems and the elimination of finite size effects.

physics.comp-ph↗

arXiv2013

Generalized parity in multi-photon Rabi model

Quantum multi--photon spin--boson model is considered. We solve an operator Riccati equation associated with that model and present a candidate for a generalized parity operator allowing to transform spin--boson Hamiltonian to a block diagonal form what indicates an existence of the related symmetry of the model.

quant-ph↗

arXiv2010

Riccati equation and the problem of decoherence

The block operator matrix theory is used to investigate the problem of a single qubit. We will establish a connection between the Riccati operator equation and the possibility of obtaining an exact reduced dynamics for the qubit in question. The model of the half spin particle in the rotating magnetic field coupling with the external environment is discussed. We show that the model defined in such a way can be reduced to a time independent problem.

quant-ph↗