On the public citation graph
Finding cliques by quantum adiabatic evolution
0 signed · 86 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<5::aid-rsa2>3.0.co;2-zopenalex-snapshot
Algorithmic theory of random graphs
inferredcites →https://doi.org/10.1002/rsa.3240030402openalex-snapshot
Large Cliques Elude the Metropolis Process
inferredcites →https://doi.org/10.1103/physreva.54.2636openalex-snapshot
Schumacher’s quantum data compression as a quantum computation
inferredcites →https://doi.org/10.1103/physreve.58.5355openalex-snapshot
Quantum annealing in the transverse Ising model
inferredcites →https://doi.org/10.1109/18.841192openalex-snapshot
Reversible arithmetic coding for quantum data compression
inferredcites →https://doi.org/10.1126/science.1057726openalex-snapshot
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0001106openalex-snapshot
Quantum Computation by Adiabatic Evolution
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0007071openalex-snapshot
A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability
inferredcites →https://doi.org/10.5555/251040.251043openalex-snapshot
Algorithmic theory of random graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4419-9092-1_25openalex-snapshot
Scalable Architecture for Adiabatic Quantum Computing of Np-Hard Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_9openalex-snapshot
Deterministic Preparation of Dicke States
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_16openalex-snapshot
Validating Quantum State Preparation Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_41openalex-snapshot
Bounding Run-Times of Local Adiabatic Algorithms
inferred← citeshttps://doi.org/10.1007/s00450-006-0008-7openalex-snapshot
Quantum algorithms: A survey of some recent results
inferred← citeshttps://doi.org/10.1007/s10479-026-07201-1openalex-snapshot
Quantum bridge analytics: a QUBO approach to the uncapacitated facility location problem
inferred← citeshttps://doi.org/10.1007/s11128-011-0235-0openalex-snapshot
Investigating the performance of an adiabatic quantum optimization processor
inferred← citeshttps://doi.org/10.1007/s11128-014-0797-8openalex-snapshot
Efficient quantum algorithms to construct arbitrary Dicke states
inferred← citeshttps://doi.org/10.1007/s11128-021-03063-7openalex-snapshot
Preparation of spin eigenstates including the Dicke states with generalized all-coupled interaction in a spintronic quantum computing architecture
inferred← citeshttps://doi.org/10.1007/s11128-021-03198-7openalex-snapshot
Anti-crossings and spectral gap during quantum adiabatic evolution
inferred← citeshttps://doi.org/10.1007/s11424-019-9008-0openalex-snapshot
Quantum Algorithm Design: Techniques and Applications
inferred← citeshttps://doi.org/10.1016/j.isci.2024.108953openalex-snapshot
A parameter-independent algorithm of finding maximum clique with Seidel continuous-time quantum walks
inferred← citeshttps://doi.org/10.1016/j.jmr.2005.08.004openalex-snapshot
Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor
inferred← citeshttps://doi.org/10.1021/acs.jpca.3c00525openalex-snapshot
State Preparation of Antisymmetrized Geminal Power on a Quantum Computer without Number Projection
inferred← citeshttps://doi.org/10.1038/s41467-022-29887-0openalex-snapshot
Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
inferred← citeshttps://doi.org/10.1038/srep33957openalex-snapshot
Solving Set Cover with Pairs Problem using Quantum Annealing
inferred← citeshttps://doi.org/10.1063/1.2835542openalex-snapshot
NMR implementation of adiabatic SAT algorithm using strongly modulated pulses
inferred← citeshttps://doi.org/10.1063/1.4750045openalex-snapshot
Adiabatic and nonadiabatic contributions to the energy of a system subject to a time-dependent perturbation: Complete separation and physical interpretation
inferred← citeshttps://doi.org/10.1088/0253-6102/63/5/554openalex-snapshot
An Alternative Adiabatic Quantum Algorithm for the Hamiltonian Cycle Problem
inferred← citeshttps://doi.org/10.1088/1361-6633/ae440aopenalex-snapshot
Symmetric quantum states: a review of recent progress
inferred← citeshttps://doi.org/10.1088/2058-9565/ac8e91openalex-snapshot
On constant-time quantum annealing and guaranteed approximations for graph optimization problems
inferred← citeshttps://doi.org/10.1088/2058-9565/ad53fcopenalex-snapshot
Bases for optimising stabiliser decompositions of quantum states
inferred← citeshttps://doi.org/10.1098/rsta.2024.0415openalex-snapshot
A dynamical algebra of protocol-induced transformations on Dicke states
inferred← citeshttps://doi.org/10.1103/9gjk-rgqlopenalex-snapshot
Efficient Preparation of Dicke States
inferred← citeshttps://doi.org/10.1103/physreva.65.012322openalex-snapshot
Robustness of adiabatic quantum computation
inferred← citeshttps://doi.org/10.1103/physreva.68.062321openalex-snapshot
Quantum adiabatic algorithms and large spin tunnelling
inferred← citeshttps://doi.org/10.1103/physreva.73.062307openalex-snapshot
General error estimate for adiabatic quantum computing
inferred← citeshttps://doi.org/10.1103/physreva.74.060304openalex-snapshot
Adiabatic quantum algorithms as quantum phase transitions: First versus second order
inferred← citeshttps://doi.org/10.1103/physreva.97.032344openalex-snapshot
Quantum speedup in solving the maximal-clique problem
inferred← citeshttps://doi.org/10.1103/physrevb.76.174507openalex-snapshot
Long-range coupling and scalable architecture for superconducting flux qubits
inferred← citeshttps://doi.org/10.1103/physrevb.82.024511openalex-snapshot
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor
inferred← citeshttps://doi.org/10.1103/physreve.70.036702openalex-snapshot
Quantum adiabatic optimization and combinatorial landscapes
inferred← citeshttps://doi.org/10.1103/physreve.82.031106openalex-snapshot
Making classical ground-state spin computing fault-tolerant
inferred← citeshttps://doi.org/10.1103/prxquantum.2.030312openalex-snapshot
Low-Depth Mechanisms for Quantum Optimization
inferred← citeshttps://doi.org/10.1103/revmodphys.90.015002openalex-snapshot
Adiabatic quantum computation
inferred← citeshttps://doi.org/10.1109/iscid.2011.64openalex-snapshot
Solving Maximum Clique Problems with Microfluidic DNA Computer
inferred← citeshttps://doi.org/10.1109/jproc.2004.833672openalex-snapshot
Quantum computing with superconductors
inferred← citeshttps://doi.org/10.1109/qce53715.2022.00027openalex-snapshot
Short-Depth Circuits for Dicke State Preparation
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00041openalex-snapshot
Quantum Circuit Design for Decoded Quantum Interferometry
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3185287openalex-snapshot
Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection
inferred← citeshttps://doi.org/10.1109/tqe.2020.3041479openalex-snapshot
Preparing Dicke States on a Quantum Computer
inferred← citeshttps://doi.org/10.1109/tqe.2022.3174547openalex-snapshot
A Divide-and-Conquer Approach to Dicke State Preparation
inferred← citeshttps://doi.org/10.1109/tqe.2024.3450852openalex-snapshot
Quantum Speedup of the Dispersion and Codebook Design Problems
inferred← citeshttps://doi.org/10.1109/tsp.2021.3077302openalex-snapshot
Ordering for Communication-Efficient Quickest Change Detection in a Decomposable Graphical Model
inferred← citeshttps://doi.org/10.1126/science.1057726openalex-snapshot
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
inferred← citeshttps://doi.org/10.1137/08072689xopenalex-snapshot
Complexity of Stoquastic Frustration-Free Hamiltonians
inferred← citeshttps://doi.org/10.1142/s021974992150009xopenalex-snapshot
Correlation between the continuous-time quantum walk and cliques in graphs and its application
inferred← citeshttps://doi.org/10.1145/3700885openalex-snapshot
Scalable Experimental Bounds for Entangled Quantum State Fidelities
inferred← citeshttps://doi.org/10.1145/3719276.3725200openalex-snapshot
Quantum Circuit Design for Finding k-Cliques via Quantum Amplitude Amplification Strategies
inferred← citeshttps://doi.org/10.1145/780542.780546openalex-snapshot
Adiabatic quantum state generation and statistical zero knowledge
inferred← citeshttps://doi.org/10.1145/780543.780546openalex-snapshot
Adiabatic quantum state generation and statistical zero knowledge
inferred← citeshttps://doi.org/10.11606/d.43.2012.tde-05122014-101358openalex-snapshot
Parametrizações otimais de trajetórias adiabáticas em sistemas quânticos dissipativos
inferred← citeshttps://doi.org/10.23919/date58400.2024.10546633openalex-snapshot
Quantum State Preparation Using an Exact CNOT Synthesis Formulation
inferred← citeshttps://doi.org/10.26421/qic10.1-2-9openalex-snapshot
The role of symmetries in adiabatic quantum algorithms
inferred← citeshttps://doi.org/10.26421/qic4.3-2openalex-snapshot
An exact effective two-qubit gate in a chain of three spins
inferred← citeshttps://doi.org/10.3389/fphy.2014.00005openalex-snapshot
Ising formulations of many NP problems
inferred← citeshttps://doi.org/10.3390/e27090891openalex-snapshot
Entropy, Fidelity, and Entanglement During Digitized Adiabatic Quantum Computing to Form a Greenberger–Horne–Zeilinger (GHZ) State
inferred← citeshttps://doi.org/10.3390/sym14030624openalex-snapshot
Quantum Circuits for the Preparation of Spin Eigenfunctions on Quantum Computers
inferred← citeshttps://doi.org/10.4018/979-8-3373-1210-1.ch001openalex-snapshot
Applications of Quantum Computing in AI
inferred← citeshttps://doi.org/10.48550/arxiv.0804.4457openalex-snapshot
Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization
inferred← citeshttps://doi.org/10.48550/arxiv.0806.1746openalex-snapshot
Complexity of stoquastic frustration-free Hamiltonians
inferred← citeshttps://doi.org/10.48550/arxiv.1004.2226openalex-snapshot
Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1010.1220openalex-snapshot
Avoid First Order Quantum Phase Transition by Changing Problem Hamiltonians
inferred← citeshttps://doi.org/10.48550/arxiv.1406.7870openalex-snapshot
Multicoloured Random Graphs: Constructions and Symmetry
inferred← citeshttps://doi.org/10.48550/arxiv.1912.02728openalex-snapshot
Algorithm for Finding the Maximum Clique Based on Continuous Time Quantum Walk
inferred← citeshttps://doi.org/10.48550/arxiv.2007.01681openalex-snapshot
On Actual Preparation of Dicke State on a Quantum Computer
inferred← citeshttps://doi.org/10.48550/arxiv.2010.03949openalex-snapshot
An Optimum Algorithm for Quantum Search
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0112143openalex-snapshot
Simulations of the adiabatic quantum optimization for the Set Partition Problem
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0208189openalex-snapshot
Total suppression of a large spin tunneling barrier in quantum adiabatic computation
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0403090openalex-snapshot
Scalable Superconducting Architecture for Adiabatic Quantum Computation
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0506126openalex-snapshot
Towards Large-Scale Quantum Computation
inferred← citeshttps://doi.org/10.70675/ddc8a4b2z9f68z49d3z91e1zc1d6664298b1openalex-snapshot
Analog Quantum Computing for NP-Hard Combinatorial Graph Problems
inferred← citeshttps://doi.org/10.7916/d8x650c9openalex-snapshot
Quantum Algorithms for Scientific Computing and Approximate Optimization
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.