On the public citation graph

Quantum Computing Winks at Statistics. Is It a Good Match?

https://doi.org/10.2139/ssrn.4849930
0 signed · 16 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/bf01343193openalex-extracted
Beweis des Adiabatensatzes
inferredcites →https://doi.org/10.1007/bf02247879openalex-extracted
Computational aspects of a branch and bound algorithm for quadratic zero-one programming
inferredcites →https://doi.org/10.1007/bf02650179openalex-extracted
Simulating physics with computers
inferredcites →https://doi.org/10.1007/s11128-022-03777-2openalex-extracted
Quantum computing for financial risk measurement
inferredcites →https://doi.org/10.1088/2058-9565/abfa64openalex-extracted
Achieving a quantum smart workforce
inferredcites →https://doi.org/10.1103/physreva.80.012106openalex-extracted
General conditions for quantum adiabatic evolution
inferredcites →https://doi.org/10.1103/physrevphyseducres.18.010150openalex-extracted
Today’s interdisciplinary quantum information classroom: Themes from a survey of quantum information science instructors
inferredcites →https://doi.org/10.1109/iciea52957.2021.9436749openalex-extracted
Larger Sparse Quadratic Assignment Problem Optimization Using Quantum Annealing and a Bit-Flip Heuristic Algorithm
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-extracted
Algorithms for quantum computation: discrete logarithms and factoring
inferredcites →https://doi.org/10.1109/te.2022.3153841openalex-extracted
Assessing the Needs of the Quantum Industry
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-extracted
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1145/237814.237866openalex-extracted
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.18154/rwth-2021-09173openalex-extracted
Garden optimization problems for benchmarking quantum annealers
inferredcites →https://doi.org/10.22331/q-2022-01-20-625openalex-extracted
Faster quantum and classical SDP approximations for quadratic binary optimization
inferredcites →https://doi.org/10.48550/arxiv.1312.1463openalex-extracted
What we can learn about quantum physics from a single qubit
inferredcites →https://doi.org/10.48550/arxiv.1904.06819openalex-extracted
Applications of Quantum Annealing in Statistics
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.