On the public citation graph

Solving search problems by strongly simulating quantum circuits

0 signed · 61 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/3-540-10003-2_104openalex-snapshot
Reversible Computing
inferredcites →https://doi.org/10.1007/3-540-53414-8_35openalex-snapshot
Problems complete for ⊕L
inferredcites →https://doi.org/10.1007/s10701-005-8657-0openalex-snapshot
Fermionic Linear Optics Revisited
inferredcites →https://doi.org/10.1016/0020-0190(90)90150-vopenalex-snapshot
Problems complete for ⊕ L
inferredcites →https://doi.org/10.1016/j.jcss.2010.06.005openalex-snapshot
Holographic algorithms: From art to science
inferredcites →https://doi.org/10.1017/cbo9780511761355openalex-snapshot
P, NP, and NP-Completeness
inferredcites →https://doi.org/10.1017/cbo9780511804090openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1063/1.3672009openalex-snapshot
Categorical Tensor Network States
inferredcites →https://doi.org/10.1088/1367-2630/12/2/025005openalex-snapshot
Exact matrix product solutions in the Heisenberg picture of an open quantum spin chain
inferredcites →https://doi.org/10.1088/1367-2630/9/5/146openalex-snapshot
Efficient classical simulation of the quantum Fourier transform
inferredcites →https://doi.org/10.1088/1742-5468/2007/10/p10014openalex-snapshot
From density-matrix renormalization group to matrix product states
inferredcites →https://doi.org/10.1090/conm/482/09419openalex-snapshot
Contraction of matchgate tensor networks on non-planar graphs
inferredcites →https://doi.org/10.1098/rspa.2002.1097openalex-snapshot
On the role of entanglement in quantum-computational speed-up
inferredcites →https://doi.org/10.1098/rspa.2008.0189openalex-snapshot
Matchgates and classical simulation of quantum circuits
inferredcites →https://doi.org/10.1098/rspa.2010.0332openalex-snapshot
Quantum matchgate computations and linear threshold gates
inferredcites →https://doi.org/10.1103/physreva.57.127openalex-snapshot
Theory of fault-tolerant quantum computation
inferredcites →https://doi.org/10.1103/physreva.65.032325openalex-snapshot
Classical simulation of noninteracting-fermion quantum circuits
inferredcites →https://doi.org/10.1103/physreva.70.052328openalex-snapshot
Improved simulation of stabilizer circuits
inferredcites →https://doi.org/10.1103/physreva.73.022334openalex-snapshot
Fast simulation of stabilizer circuits using a graph-state representation
inferredcites →https://doi.org/10.1103/physreva.74.022320openalex-snapshot
Classical simulation of quantum many-body systems with a tree tensor network
inferredcites →https://doi.org/10.1103/physreva.75.012337openalex-snapshot
Classical simulation versus universality in measurement-based quantum computation
inferredcites →https://doi.org/10.1103/physreva.76.022304openalex-snapshot
Measurement-based quantum computation with the toric code states
inferredcites →https://doi.org/10.1103/physreva.76.042321openalex-snapshot
Efficient classical simulation of the approximate quantum Fourier transform
inferredcites →https://doi.org/10.1103/physreva.80.052334openalex-snapshot
Quantum algorithms for spin models and simulable gate sets for quantum computation
inferredcites →https://doi.org/10.1103/physreve.82.036702openalex-snapshot
Dynamical simulations of classical stochastic systems using matrix product states
inferredcites →https://doi.org/10.1103/physrevlett.91.147902openalex-snapshot
Efficient Classical Simulation of Slightly Entangled Quantum Computations
inferredcites →https://doi.org/10.1103/physrevlett.96.170503openalex-snapshot
Classical Simulation of Limited-Width Cluster-State Quantum Computation
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot
Algorithms for quantum computation: discrete logarithms and factoring
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/050644756openalex-snapshot
Simulating Quantum Computation by Contracting Tensor Networks
inferredcites →https://doi.org/10.1137/s0097539700377025openalex-snapshot
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1145/2431211.2431220openalex-snapshot
Synthesis and optimization of reversible circuits—a survey
inferredcites →https://doi.org/10.1145/380752.380785openalex-snapshot
Quantum computers that can be simulated classically in polynomial time
inferredcites →https://doi.org/10.1145/4221.4225openalex-snapshot
A sufficient condition for backtrack-bounded search
inferredcites →https://doi.org/10.1145/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.1147/rd.176.0525openalex-snapshot
Logical Reversibility of Computation
inferredcites →https://doi.org/10.18725/oparu-46571openalex-snapshot
Exact matrix product solutions in the Heisenberg picture of an open quantum spin chain
inferredcites →https://doi.org/10.26421/qic10.3-4-6openalex-snapshot
Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond
inferredcites →https://doi.org/10.26421/qic5.3-3openalex-snapshot
Lagrangian representation for fermionic linear optics
inferredcites →https://doi.org/10.26421/qic8.1-2-8openalex-snapshot
Generalized Clifford groups and simulation of associated quantum circuits
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0108033openalex-snapshot
Fermionic Linear Optics and Matchgates
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0603163openalex-snapshot
On the simulation of quantum circuits
inferredcites →https://doi.org/10.5860/choice.48-3333openalex-snapshot
P, NP, and NP-completeness: the basics of computational complexity

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-3-030-34489-4openalex-snapshot
Tensor Network Contractions
inferred← citeshttps://doi.org/10.1007/978-3-030-34489-4_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/s10955-015-1276-zopenalex-snapshot
Tensor Network Contractions for #SAT
inferred← citeshttps://doi.org/10.1007/s11128-021-03145-6openalex-snapshot
Probabilistic nonunitary gate in imaginary time evolution
inferred← citeshttps://doi.org/10.1016/j.strusafe.2018.05.004openalex-snapshot
Quantum-inspired Boolean states for bounding engineering network reliability assessment
inferred← citeshttps://doi.org/10.1088/1742-6596/454/1/012064openalex-snapshot
A multiprecision C++ library for matrix-product-state simulation of quantum computing: Evaluation of numerical errors
inferred← citeshttps://doi.org/10.1103/lhv6-6t1ropenalex-snapshot
Computational complexity and simulability of non-Hermitian quantum dynamics
inferred← citeshttps://doi.org/10.1103/physreva.87.022311openalex-snapshot
Encoding hypergraphs into quantum states
inferred← citeshttps://doi.org/10.1103/physreva.96.062322openalex-snapshot
Tree tensor network approach to simulating Shor's algorithm
inferred← citeshttps://doi.org/10.1103/physreve.93.053310openalex-snapshot
Ab initiooptimization principle for the ground states of translationally invariant strongly correlated quantum lattice models
inferred← citeshttps://doi.org/10.1103/physrevresearch.1.023025openalex-snapshot
Variational quantum eigensolver with fewer qubits
inferred← citeshttps://doi.org/10.1103/physrevresearch.2.033293openalex-snapshot
Tensor network compressed sensing with unsupervised machine learning
inferred← citeshttps://doi.org/10.1140/epjqt10openalex-snapshot
What is a quantum simulator?
inferred← citeshttps://doi.org/10.26421/qic15.9-10-7openalex-snapshot
Tensor network non-zero testing
inferred← citeshttps://doi.org/10.48550/arxiv.1406.5279openalex-snapshot
Tensor network non-zero testing
inferred← citeshttps://doi.org/10.48550/arxiv.1708.00006openalex-snapshot
Tensor Networks in a Nutshell
inferred← citeshttps://doi.org/10.48550/arxiv.1912.10049openalex-snapshot
Lectures on Quantum Tensor Networks
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.