5 citations · 12 across the 14 of their papers we have counts for
12 papers · 1 filter
Belief Propagation-based Disentanglers for Tensor Network State Preparation
Tomasz Szołdra, Peter Schmelcher
We develop a quantum circuit synthesis method for preparing a class of tensor network states. The scheme applies to states tractable with belief propagation (BP), a tensor network…
Spin Textures and Eigenstate Evolution of Isospectrally Patterned Lattices
Peter Schmelcher
Isospectrally patterned lattices exhibit a composite band structure with a tunable ratio of localized versus delocalized eigenstates that is controlled by the underlying phase grad…
A Unified Local Light-shifts Encoding For Solving Optimization Problems on a Rydberg Annealer
Kapil Goswami, Peter Schmelcher
Combinatorial optimization problems play a central role in computer science with many real world applications. A number of relevant problems remain computationally difficult to sol…
High-fidelity non-adiabatic dark state gates for neutral atoms
Nader Mostaan, Kapil Goswami, Peter Schmelcher +1
Rydberg blockade gates are the most experimentally mature entangling operations in neutral-atom quantum processors, combining fast gate times with simple control, but their perform…
Scalable Preparation of Matrix Product States with Sequential and Brick Wall Quantum Circuits
Tomasz Szołdra, Rick Mukherjee, Peter Schmelcher
Preparing arbitrary quantum states requires exponential resources. Matrix Product States (MPS) admit more efficient constructions, particularly when accuracy is traded for circuit…
Qudit-based scalable quantum algorithm for solving the integer programming problem
Kapil Goswami, Peter Schmelcher, Rick Mukherjee
Integer programming (IP) is an NP-hard combinatorial optimization problem that is widely used to represent a diverse set of real-world problems spanning multiple fields, such as fi…
Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
Aditya Dubey, Zeki Zeybek, Peter Schmelcher
Quantum computing offers the potential for computational abilities that can go beyond classical machines. However, they are still limited by several challenges such as noise, decoh…
Ab-Initio Approach to Many-Body Quantum Spin Dynamics
Aditya Dubey, Zeki Zeybek, Fabian Köhler +2
A fundamental longstanding problem in studying spin models is the efficient and accurate numerical simulation of the long-time behavior of larger systems. The exponential growth of…
Towards Arbitrary QUBO Optimization: Analysis of Classical and Quantum-Activated Feedforward Neural Networks
Chia-Tso Lai, Carsten Blank, Peter Schmelcher +1
Quadratic Unconstrained Binary Optimization (QUBO) sits at the heart of many industries and academic fields such as logistics, supply chain, finance, pharmaceutical science, chemis…
Solving The Travelling Salesman Problem Using A Single Qubit
Kapil Goswami, Gagan Anekonda Veereshi, Peter Schmelcher +1
The travelling salesman problem (TSP) is a popular NP-hard-combinatorial optimization problem that requires finding the optimal way for a salesman to travel through different citie…
Impact of dark states on the stationary properties of quantum particles with off-centered interactions in one dimension
G. Bougas, N. L. Harshman, P. Schmelcher
We present a generalization of the two-body contact interaction for non-relativistic particles trapped in one dimension. The particles interact only when they are a distance c apar…
Integer Programming Using A Single Atom
Kapil Goswami, Peter Schmelcher, Rick Mukherjee
Integer programming (IP), as the name suggests is an integer-variable-based approach commonly used to formulate real-world optimization problems with constraints. Currently, quantu…