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

21 papers

quant-ph2026

PPVM: A Circuit Simulation Framework for Digital Twins of Quantum Processors

Xiu-Zhe Luo, David Plankensteiner, Kai-Hsin Wu +12

Quantum computers are approaching the early fault-tolerant regime. Verifying the next generation of quantum hardware requires joint emulation of the quantum processor, hardware noi…

quant-ph2025★ 33 cited

Certified randomness using a trapped-ion quantum processor

Minzhao Liu, Ruslan Shaydulin, Pradeep Niroula +29

While quantum computers have the potential to perform a wide range of practically important tasks beyond the capabilities of classical computers, realizing this potential remains a…

astro-ph.IM2025★ 1 cited

Lossy Compression of Scientific Data: Applications Constrains and Requirements

Franck Cappello, Allison Baker, Ebru Bozda +22

Increasing data volumes from scientific simulations and instruments (supercomputers, accelerators, telescopes) often exceed network, storage, and analysis capabilities. The scienti…

quant-ph2025

The Art of Avoiding Constraints: A Penalty-free Approach to Constrained Combinatorial Optimization with QAOA

Prashanti Priya Angara, Danylo Lykov, Ulrike Stege +2

The quantum approximate optimization algorithm (QAOA) is designed to determine optimum and near optimum solutions of quadratic (and higher order) unconstrained binary optimization…

quant-ph2025★ 19 cited

Tensor networks for quantum computing

Aleksandr Berezutskii, Minzhao Liu, Atithi Acharya +25

In the rapidly evolving field of quantum computing, tensor networks serve as an important tool due to their multifaceted utility. In this paper, we review the diverse applications…

quant-ph2025★ 1 cited

Improved Quantum Computation using Operator Backpropagation

Bryce Fuller, Minh C. Tran, Danylo Lykov +10

Decoherence of quantum hardware is currently limiting its practical applications. At the same time, classical algorithms for simulating quantum circuits have progressed substantial…

quant-ph2024★ 32 cited

The computational power of random quantum circuits in arbitrary geometries

Matthew DeCross, Reza Haghshenas, Minzhao Liu +49

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimens…

quant-ph2023

QArchSearch: A Scalable Quantum Architecture Search Package

Ankit Kulshrestha, Danylo Lykov, Ilya Safro +1

The current era of quantum computing has yielded several algorithms that promise high computational efficiency. While the algorithms are sound in theory and can provide potentially…

quant-ph2023★ 24 cited

Fast Simulation of High-Depth QAOA Circuits

Danylo Lykov, Ruslan Shaydulin, Yue Sun +2

Until high-fidelity quantum computers with a large number of qubits become widely available, classical simulation remains a vital tool for algorithm design, tuning, and validation.…

quant-ph2023★ 119 cited

Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem

Ruslan Shaydulin, Changhao Li, Shouvanik Chakrabarti +26

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tac…

quant-ph2023★ 3 cited

Similarity-Based Parameter Transferability in the Quantum Approximate Optimization Algorithm

Alexey Galda, Eesh Gupta, Jose Falla +4

The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. A…

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…

quant-ph2021★ 4 cited

The fixed angle conjecture for QAOA on regular MaxCut graphs

Jonathan Wurtz, Danylo Lykov

The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about perform…

quant-ph2021★ 4 cited

Importance of Diagonal Gates in Tensor Network Simulations

Danylo Lykov, Yuri Alexeev

In this work we present two techniques that tremendously increase the performance of tensor-network based quantum circuit simulations. The techniques are implemented in the QTensor…

quant-ph2021

Transferability of optimal QAOA parameters between random graphs

Alexey Galda, Xiaoyuan Liu, Danylo Lykov +2

The Quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. I…

quant-ph2020★ 25 cited

Tensor Network Quantum Simulator With Step-Dependent Parallelization

Danylo Lykov, Roman Schutski, Alexey Galda +2

In this work, we present a new large-scale quantum circuit simulator. It is based on the tensor network contraction technique to represent quantum circuits. We propose a novel para…

quant-ph2018★ 7 cited

Phase estimation algorithm for the multibeam optical metrology

V. V. Zemlyanov, N. S. Kirsanov, M. R. Perelshtein +5

Unitary Fourier transform lies at the core of the multitudinous computational and metrological algorithms. Here we show experimentally how the unitary Fourier transform-based phase…