On the public citation graph

Fast Simulation of High-Depth QAOA Circuits

0 signed · 51 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-030-50371-0_19openalex-snapshot

heFFTe: Highly Efficient FFT for Exascale

inferredcites →https://doi.org/10.1007/978-3-032-06770-8_14openalex-snapshot

Advanced Equivalence Checking for Quantum Circuits

inferredcites →https://doi.org/10.1007/bfb0055105openalex-snapshot

Quantum counting

inferredcites →https://doi.org/10.1007/s11128-021-03298-4openalex-snapshot

Classical symmetries and the Quantum Approximate Optimization Algorithm

inferredcites →https://doi.org/10.1038/s41534-023-00718-4openalex-snapshot

Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm

inferredcites →https://doi.org/10.1103/physreva.101.042335openalex-snapshot

Adaptive algorithm for quantum circuit simulation

inferredcites →https://doi.org/10.1103/physreva.61.052311openalex-snapshot

Quantum search heuristics

inferredcites →https://doi.org/10.1103/physrevlett.125.060503openalex-snapshot

Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations

inferredcites →https://doi.org/10.1103/physrevlett.79.325openalex-snapshot

Quantum Mechanics Helps in Searching for a Needle in a Haystack

inferredcites →https://doi.org/10.1109/exampi54564.2021.00011openalex-snapshot

Accelerating Multi - Process Communication for Parallel 3-D FFT

inferredcites →https://doi.org/10.1109/hipcw57629.2022.00008openalex-snapshot

A Visual Guide to MPI All-to-all

inferredcites →https://doi.org/10.1109/hpec55821.2022.9926353openalex-snapshot

Constructing Optimal Contraction Trees for Tensor Network Quantum Circuit Simulation

inferredcites →https://doi.org/10.1109/ipdps.2005.335openalex-snapshot

Performance Analysis of MPI Collective Operations

inferredcites →https://doi.org/10.1109/isvlsi51109.2021.00088openalex-snapshot

Importance of Diagonal Gates in Tensor Network Simulations

inferredcites →https://doi.org/10.1109/qce53715.2022.00081openalex-snapshot

Tensor Network Quantum Simulator With Step-Dependent Parallelization

inferredcites →https://doi.org/10.1109/qcs54837.2021.00011openalex-snapshot

QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA

inferredcites →https://doi.org/10.1109/tcad.2018.2834427openalex-snapshot

Advanced Simulation of Quantum Computations

inferredcites →https://doi.org/10.1109/tqe.2021.3066275openalex-snapshot

Exploiting Symmetry Reduces the Cost of Training QAOA

inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot

Quantum Computation and Quantum Information

inferredcites →https://doi.org/10.1142/s0129183199001108openalex-snapshot

TOOLS FOR QUANTUM ALGORITHMS

inferredcites →https://doi.org/10.1145/3295500.3356155openalex-snapshot

Full-state quantum circuit simulation by using data compression

inferredcites →https://doi.org/10.22331/q-2021-03-15-410openalex-snapshot

Hyper-optimized tensor network contraction

inferredcites →https://doi.org/10.22331/q-2021-07-01-491openalex-snapshot

Quantum annealing initialization of the quantum approximate optimization algorithm

inferredcites →https://doi.org/10.22331/q-2022-09-22-814openalex-snapshot

Quantum simulation with just-in-time compilation

inferredcites →https://doi.org/10.5281/zenodo.2573505openalex-snapshot

Qiskit/qiskit-metapackage: Qiskit 0.43.0

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4652979openalex-extracted

Hamiltonian Minimization in the NISQ Era

inferred← citeshttps://doi.org/10.1007/s11128-024-04438-2openalex-snapshot

Variational quantum algorithms: fundamental concepts, applications and challenges

inferred← citeshttps://doi.org/10.1016/j.future.2024.06.058openalex-snapshot

Integrating quantum computing resources into scientific HPC ecosystems

inferred← citeshttps://doi.org/10.1038/s41467-025-67187-5openalex-snapshot

Generalized Probabilistic Approximate Optimization Algorithm

inferred← citeshttps://doi.org/10.1038/s41534-025-01097-8openalex-snapshot

A quantum algorithm for solving 0-1 Knapsack problems

inferred← citeshttps://doi.org/10.1103/gtq3-j37bopenalex-snapshot

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

inferred← citeshttps://doi.org/10.1109/fuzz62266.2025.11152265openalex-snapshot

Towards an Efficiently Simulated Quantum Approximate Optimisation

inferred← citeshttps://doi.org/10.1109/isca66397.2026.00163openalex-snapshot

TUSQ: Tracking, Uncomputation, and Sampling for Noisy Quantum Simulation

inferred← citeshttps://doi.org/10.1109/iscas56072.2025.11043411openalex-snapshot

Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems

inferred← citeshttps://doi.org/10.1109/qce60285.2024.10268openalex-snapshot

Noise-Aware Distributed Quantum Approximate Optimization Algorithm on Near-Term Quantum Hardware

inferred← citeshttps://doi.org/10.1109/qce60285.2024.10292openalex-snapshot

CUAOA: A Novel CUDA-Accelerated Simulation Framework for the QAOA

inferred← citeshttps://doi.org/10.1109/qce65121.2025.00048openalex-snapshot

Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems

inferred← citeshttps://doi.org/10.1109/qce65121.2025.00241openalex-snapshot

A Quantum Search Method for Quadratic and Multidimensional Knapsack Problems

inferred← citeshttps://doi.org/10.1109/qce65121.2025.10295openalex-snapshot

Residue Number System (RNS) Based Distributed Quantum Multiplication

inferred← citeshttps://doi.org/10.1109/sc41406.2024.00087openalex-snapshot

Atlas: Hierarchical Partitioning for Quantum Circuit Simulation on GPUs

inferred← citeshttps://doi.org/10.1109/tc.2026.3724836openalex-snapshot

Quantum at the Edge: Scalable Standalone FPGA Emulator for QAOA-Based Weighted-MaxCut

inferred← citeshttps://doi.org/10.1109/tqcebt67648.2026.11681365openalex-snapshot

Quantum-Enhanced Enterprise Planning, Budgeting, and Forecasting: A Python Simulation Framework Integrating QAOA and VQE for Large-Scale Global Sales Planning

inferred← citeshttps://doi.org/10.1126/sciadv.adm6761openalex-snapshot

Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem

inferred← citeshttps://doi.org/10.1145/3624062.3624220openalex-snapshot

JuliQAOA: Fast, Flexible QAOA Simulation

inferred← citeshttps://doi.org/10.1145/3649153.3649204openalex-snapshot

Trainability Barriers in Low-Depth QAOA Landscapes

inferred← citeshttps://doi.org/10.1145/3649329.3663523openalex-snapshot

Invited: Graph Learning for Parameter Prediction of Quantum Approximate Optimization Algorithm

inferred← citeshttps://doi.org/10.1145/3649329.3664193openalex-snapshot

Invited: Challenges and Opportunities of Quantum Optimization in Finance

inferred← citeshttps://doi.org/10.1145/3678184openalex-snapshot

Optimization Applications as Quantum Performance Benchmarks

inferred← citeshttps://doi.org/10.1145/3695053.3730992openalex-snapshot

Accelerating Simulation of Quantum Circuits under Noise via Computational Reuse

inferred← citeshttps://doi.org/10.1145/3815778openalex-snapshot

Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm

inferred← citeshttps://doi.org/10.48550/arxiv.2308.02342openalex-snapshot

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

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.