Related papers: Understanding domain-wall encoding theoretically a…
This tutorial offers a quick, hands-on introduction to solving Quadratic Unconstrained Binary Optimization (QUBO) models on currently available quantum computers and their simulators. We cover both IBM and D-Wave machines: IBM utilizes a…
Wave-particle duality of quantum objects is one of the most striking features of quantum physics and has been widely studied in past decades. Developments of quantum technologies enable us to experimentally realize several quantum…
Digital-Analog Quantum Computation (DAQC) has recently been proposed as an alternative to the standard paradigm of digital quantum computation. DAQC creates entanglement through a continuous or analog evolution of the whole device, rather…
The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for classical computers. In parameterized quantum approaches, the…
Quantum annealing may provide advantages over simulated annealing on solving some problems such as Kth order binary optimization problem. No feasible architecture exists to implement the high-order optimization problem (K > 2) on current…
We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linearly-constrained, binary optimization problems on quantum annealers (QA). The computational premise of quantum computers…
NP problems are closely related to practical optimization challenges but often suffer from exponential increases in computation time as problem sizes grow. Quantum annealing offers a promising approach to solve NP problems faster than…
We investigate analytically and numerically the dynamics of domain walls in a spin chain with ferromagnetic Ising interaction and subject to an external magnetic field perpendicular to the easy magnetization axis (transverse field Ising…
The Ising model is a model for pairwise interactions between binary variables that has become popular in the psychological sciences. It has been first introduced as a theoretical model for the alignment between positive (+1) and negative…
We model a quantum walk of identical particles that can change their exchange statistics by hopping across a domain wall in a 1D lattice. Such a "statistical boundary" is transparent to single particles and affects the dynamics only by…
The divide between the realms of atomic-scale quantum particles and lithographically-defined nanostructures is rapidly being bridged. Hybrid quantum systems comprising ultracold gas-phase atoms and substrate-bound devices already offer…
Quantum dense coding is a protocol for transmitting two classical bits of information from a sender (Alice) to a remote receiver (Bob) by sending only one quantum bit (qubit). In this article, we propose an experimentally feasible scheme to…
Discrete-time quantum walks (QWs) represent robust and versatile platforms for the controlled engineering of single particle quantum dynamics, and have attracted special attention due to their algorithmic applications in quantum information…
Quantum annealing has emerged as a promising approach for solving NP-hard optimization problems, leveraging quantum phenomena such as quantum tunneling to navigate complex energy landscapes. However, the extent to which quantum tunneling…
Quantum annealing offers a novel approach to finding the optimal solutions for a variety of computational problems, where the quantum annealing controls influence the observed performance and error mechanisms by tuning the underlying…
In this work we investigate the capabilities of a hybrid quantum-classical procedure to explore the solution space using the D-Wave $2000Q^{TM}$ Quantum Annealer device. Here we study the ability of the Quantum hardware to solve the Number…
The hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…
This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a…
We discuss time-quantified Monte-Carlo simulations on classical spin chains with uniaxial anisotropy in relation to static calculations. Depending on the thickness of domain walls, controlled by the relative strength of the exchange and…
Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after…