activity
20182026
most citedEvidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem

119 citations · 341 across the 19 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

quant-ph2022

Stochastic Approach For Simulating Quantum Noise Using Tensor Networks

William Berquist, Danylo Lykov, Minzhao Liu +1

Noisy quantum simulation is challenging since one has to take into account the stochastic nature of the process. The dominating method for it is the density matrix approach. In thi…

quant-ph2022

Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation

Cameron Ibrahim, Danylo Lykov, Zichang He +2

One of the key problems in tensor network based quantum circuit simulation is the construction of a contraction tree which minimizes the cost of the simulation, where the cost can…

quant-ph2022★ 33 cited

Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm

Danylo Lykov, Jonathan Wurtz, Cody Poole +3

In this work, we compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers such as Gurobi and MQLib to solve the comb…

quant-ph2022★ 22 cited

Performance Evaluation and Acceleration of the QTensor Quantum Circuit Simulator on GPUs

Danylo Lykov, Angela Chen, Huaxuan Chen +4

This work studies the porting and optimization of the tensor network simulator QTensor on GPUs, with the ultimate goal of simulating quantum circuits efficiently at scale on large…

quant-ph2022★ 14 cited

Embedding Learning in Hybrid Quantum-Classical Neural Networks

Minzhao Liu, Junyu Liu, Rui Liu +4

Quantum embedding learning is an important step in the application of quantum machine learning to classical data. In this paper we propose a quantum few-shot embedding learning par…