On the public citation graph

Quantum computing and polynomial equations over Z_2

0 signed · 24 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 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-540-89304-2_4openalex-snapshot
Quadratic Form Expansions for Unitaries
inferred← citeshttps://doi.org/10.1007/978-3-642-04103-7_11openalex-snapshot
A Mathematica Package for Simulation of Quantum Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_70openalex-snapshot
Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates
inferred← citeshttps://doi.org/10.1007/s00224-022-10105-9openalex-snapshot
Complexity Limitations on One-turn Quantum Refereed Games
inferred← citeshttps://doi.org/10.1007/s11128-008-0084-7openalex-snapshot
A new connection between quantum circuits, graphs and the Ising partition function
inferred← citeshttps://doi.org/10.1088/1367-2630/12/7/075026openalex-snapshot
Classical Ising model test for quantum circuits
inferred← citeshttps://doi.org/10.1088/1367-2630/aa61baopenalex-snapshot
Quantum circuit dynamics via path integrals: Is there a classical action for discrete-time paths?
inferred← citeshttps://doi.org/10.1088/1751-8121/aa565fopenalex-snapshot
Quantum circuits and low-degree polynomials over F 2
inferred← citeshttps://doi.org/10.1088/2058-9565/aad8caopenalex-snapshot
On the controlled-NOT complexity of controlled-NOT–phase circuits
inferred← citeshttps://doi.org/10.1088/2058-9565/ac5a0eopenalex-snapshot
Phase polynomials synthesis algorithms for NISQ architectures and beyond
inferred← citeshttps://doi.org/10.1103/1csn-x1cxopenalex-snapshot
Role of Coherence for Quantum Computational Advantage
inferred← citeshttps://doi.org/10.1103/physreva.72.042316openalex-snapshot
Entanglement and the power of one qubit
inferred← citeshttps://doi.org/10.1103/physrevlett.117.080501openalex-snapshot
Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations
inferred← citeshttps://doi.org/10.1103/physrevlett.98.140506openalex-snapshot
Computational Complexity of Projected Entangled Pair States
inferred← citeshttps://doi.org/10.1103/revmodphys.95.035001openalex-snapshot
Computational advantage of quantum random sampling
inferred← citeshttps://doi.org/10.1109/apccas60141.2023.00088openalex-snapshot
On a Piecewise Linear Function Approximation for Quantum Computation
inferred← citeshttps://doi.org/10.1109/qce49297.2020.00052openalex-snapshot
Quantum Circuits for Functionally Controlled NOT Gates
inferred← citeshttps://doi.org/10.1134/s1547477107020069openalex-snapshot
A C# package for assembling quantum circuits and generating associated polynomial sets
inferred← citeshttps://doi.org/10.1142/s0219749910006113openalex-snapshot
UNITARY-CIRCUIT SEMANTICS FOR MEASUREMENT-BASED COMPUTATIONS
inferred← citeshttps://doi.org/10.1145/3704873openalex-snapshot
Linear and Non-linear Relational Analyses for Quantum Program Optimization
inferred← citeshttps://doi.org/10.22331/q-2025-09-16-1860openalex-snapshot
Lower T-count with faster algorithms
inferred← citeshttps://doi.org/10.22331/q-2025-12-02-1926openalex-snapshot
Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums
inferred← citeshttps://doi.org/10.4204/eptcs.394.17openalex-snapshot
Symbolic Synthesis of Clifford Circuits and Beyond
inferred← citeshttps://doi.org/10.4204/eptcs.394.8openalex-snapshot
Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices
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.