On the public citation graph

Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices

0 signed · 48 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-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1017/9781316219317openalex-snapshot
Picturing Quantum Processes
inferredcites →https://doi.org/10.1080/00107510903257624openalex-snapshot
Quantum picturalism
inferredcites →https://doi.org/10.1088/2058-9565/aad8caopenalex-snapshot
On the controlled-NOT complexity of controlled-NOT–phase circuits
inferredcites →https://doi.org/10.1088/2058-9565/ab79b1openalex-snapshot
Quantum circuit optimizations for NISQ architectures
inferredcites →https://doi.org/10.1088/2058-9565/ab8e92openalex-snapshot
t|ket⟩: a retargetable compiler for NISQ devices
inferredcites →https://doi.org/10.1088/2058-9565/ab9359openalex-snapshot
staq —A full-stack quantum processing toolkit
inferredcites →https://doi.org/10.1098/rsta.2019.0161openalex-snapshot
Boolean satisfiability in quantum compilation
inferredcites →https://doi.org/10.1103/physrevresearch.5.013065openalex-snapshot
Optimization of CNOT circuits on limited-connectivity architecture
inferredcites →https://doi.org/10.1109/tcad.2014.2341953openalex-snapshot
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
inferredcites →https://doi.org/10.1109/tcad.2018.2846658openalex-snapshot
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
inferredcites →https://doi.org/10.1145/3316781.3317859openalex-snapshot
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
inferredcites →https://doi.org/10.22331/q-2018-08-06-79openalex-snapshot
Quantum Computing in the NISQ era and beyond
inferredcites →https://doi.org/10.26421/qic20.7-8-4openalex-snapshot
CNOT circuit extraction for topologically-constrained quantum memories
inferredcites →https://doi.org/10.26421/qic5.2-2openalex-snapshot
Quantum computing and polynomial equations over Z_2
inferredcites →https://doi.org/10.26421/qic8.3-4-4openalex-snapshot
Optimal synthesis of linear reversible circuits
inferredcites →https://doi.org/10.4204/eptcs.318.13openalex-snapshot
Phase Gadget Synthesis for Shallow Circuits
inferredcites →https://doi.org/10.4204/eptcs.318.7openalex-snapshot
Using ZDDs in the Mapping of Quantum Circuits
inferredcites →https://doi.org/10.4230/lipics.tqc.2019.5openalex-snapshot
On the Qubit Routing Problem
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0408129openalex-snapshot
Quantum computing and polynomial equations over the finite field Z_2

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-031-66149-5_6openalex-snapshot
Automated Reasoning in Quantum Circuit Compilation
inferred← citeshttps://doi.org/10.1007/978-3-032-06770-8_11openalex-snapshot
Limiting the Search Space in Optimal Quantum Circuit Mapping
inferred← citeshttps://doi.org/10.1007/978-3-032-06770-8_18openalex-snapshot
Handling Non-unitaries in Quantum Circuit Equivalence Checking
inferred← citeshttps://doi.org/10.1016/j.future.2024.04.060openalex-snapshot
Quantum-centric supercomputing for materials science: A perspective on challenges and future directions
inferred← citeshttps://doi.org/10.1016/j.jss.2024.112224openalex-snapshot
A comparison of quantum compilers using a DAG-based or phase polynomial-based intermediate representation
inferred← citeshttps://doi.org/10.1038/s41534-025-01170-2openalex-snapshot
Treespilation: architecture- and state-optimised fermion-to-qubit mappings
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/6xlb-l92jopenalex-snapshot
Parity flow formalism: Tracking quantum information throughout computation
inferred← citeshttps://doi.org/10.1109/hpca61900.2025.00022openalex-snapshot
HATT: Hamiltonian Adaptive Ternary Tree for Optimizing Fermion-to-Qubit Mapping
inferred← citeshttps://doi.org/10.1109/icrc53822.2021.00016openalex-snapshot
Reoptimization of Quantum Circuits via Hierarchical Synthesis
inferred← citeshttps://doi.org/10.1109/isca52012.2021.00070openalex-snapshot
Software-Hardware Co-Optimization for Computational Chemistry on Superconducting Quantum Processors
inferred← citeshttps://doi.org/10.1109/isca59077.2024.00028openalex-snapshot
Bosehedral: Compiler Optimization for Bosonic Quantum Computing
inferred← citeshttps://doi.org/10.1109/jetcas.2022.3205174openalex-snapshot
Advances in Quantum Computation and Quantum Technologies: A Design Automation Perspective
inferred← citeshttps://doi.org/10.1109/qce57702.2023.00087openalex-snapshot
PCOAST: A Pauli-Based Quantum Circuit Optimization Framework
inferred← citeshttps://doi.org/10.1109/qce60285.2024.00108openalex-snapshot
Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling
inferred← citeshttps://doi.org/10.1109/qce65121.2025.00042openalex-snapshot
Optimizing State Preparation for Variational Quantum Regression on NISQ Hardware
inferred← citeshttps://doi.org/10.1109/saner-c62648.2024.00025openalex-snapshot
The Quantum Circuit Model is not a Practical Representation of Quantum Software
inferred← citeshttps://doi.org/10.1109/tcad.2024.3509794openalex-snapshot
PauliForest: Connectivity-Aware Synthesis and Pauli-Oriented Qubit Mapping for Near-Term Quantum Simulation
inferred← citeshttps://doi.org/10.1145/3503222.3507715openalex-snapshot
Paulihedral: a generalized block-wise compiler optimization framework for Quantum simulation kernels
inferred← citeshttps://doi.org/10.1145/3505181openalex-snapshot
Best Approximate Quantum Compiling Problems
inferred← citeshttps://doi.org/10.1145/3620666.3651371openalex-snapshot
Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding
inferred← citeshttps://doi.org/10.1145/3736393.3736694openalex-snapshot
Transpiling Quantum Circuits on Graph Databases
inferred← citeshttps://doi.org/10.22331/q-2023-03-17-952openalex-snapshot
Parity Quantum Optimization: Benchmarks
inferred← citeshttps://doi.org/10.23919/date69613.2026.11539523openalex-snapshot
Quantum Circuit Compilation for Superconducting Bus-Resonator Architectures
inferred← citeshttps://doi.org/10.4204/eptcs.343.7openalex-snapshot
Diagrammatic Differentiation for Quantum Machine Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2007.10515openalex-snapshot
A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
inferred← citeshttps://doi.org/10.48550/arxiv.2101.08448openalex-snapshot
Noisy intermediate-scale quantum (NISQ) algorithms
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.