On the public citation graph

QLib

0 signed · 66 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/11672142_13openalex-snapshot
Quantum Algorithms for Matching and Network Flows
inferredcites →https://doi.org/10.1007/978-1-4471-0129-1_3openalex-snapshot
Conservative Logic
inferredcites →https://doi.org/10.1016/j.tcs.2012.05.039openalex-snapshot
Quantum counterfeit coin problems
inferredcites →https://doi.org/10.1088/1751-8113/41/39/395305openalex-snapshot
Constructive quantum Shannon decomposition from Cartan involutions
inferredcites →https://doi.org/10.1093/oso/9780198570004.001.0001openalex-snapshot
An Introduction to Quantum Computing
inferredcites →https://doi.org/10.1103/physreva.32.3266openalex-snapshot
Reversible logic and quantum computers
inferredcites →https://doi.org/10.1103/physreva.54.147openalex-snapshot
Quantum networks for elementary arithmetic operations
inferredcites →https://doi.org/10.1109/iccd.2011.6081399openalex-snapshot
Positive Davio-based synthesis algorithm for reversible logic
inferredcites →https://doi.org/10.1109/idt.2010.5724427openalex-snapshot
Hierarchical synthesis of reversible circuits using positive and negative Davio decomposition
inferredcites →https://doi.org/10.1109/tcad.2003.811448openalex-snapshot
Synthesis of reversible logic circuits
inferredcites →https://doi.org/10.1109/tcad.2005.847911openalex-snapshot
Toffoli network synthesis with templates
inferredcites →https://doi.org/10.1109/tcad.2005.855930openalex-snapshot
Synthesis of quantum-logic circuits
inferredcites →https://doi.org/10.1109/tcad.2006.871622openalex-snapshot
An Algorithm for Synthesis of Reversible Logic Circuits
inferredcites →https://doi.org/10.1109/tcad.2009.2017215openalex-snapshot
Exact Multiple-Control Toffoli Network Synthesis With SAT Techniques
inferredcites →https://doi.org/10.1109/tvlsi.2012.2227518openalex-snapshot
Optimized Quantum Gate Library for Various Physical Machine Descriptions
inferredcites →https://doi.org/10.1109/tvlsi.2013.2269869openalex-snapshot
FTQLS: Fault-Tolerant Quantum Logic Synthesis
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
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/1278349.1278355openalex-snapshot
Techniques for the synthesis of reversible Toffoli networks
inferredcites →https://doi.org/10.1145/1330521.1330523openalex-snapshot
Reversible logic synthesis with Fredkin and Peres gates
inferredcites →https://doi.org/10.1145/1629911.1629984openalex-snapshot
BDD-based synthesis of reversible logic for large functions
inferredcites →https://doi.org/10.1145/1877745.1877747openalex-snapshot
Reversible circuit synthesis using a cycle-based approach
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/2564923openalex-snapshot
RMDDS
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/775832.775915openalex-snapshot
A transformation based algorithm for reversible logic synthesis
inferredcites →https://doi.org/10.26421/qic11.3-4-6openalex-snapshot
Block-based quantum-logic synthesis
inferredcites →https://doi.org/10.26421/qic3.2-8openalex-snapshot
Circuit for Shor's algorithm using 2n+3 qubits
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0008033openalex-snapshot
Addition on a Quantum Computer
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0410184openalex-snapshot
A new quantum ripple-carry addition circuit
inferredcites →https://doi.org/10.5555/2230996.2230997openalex-snapshot
Constant-optimized quantum circuits for modular multiplication and exponentiation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cta.2335openalex-snapshot
Quantum circuit physical design flow for 2D nearest‐neighbor architectures
inferred← citeshttps://doi.org/10.1002/qute.202500505openalex-snapshot
Space‐Efficient Logical Qubit Architecture with a Bus for Magic State Consumption
inferred← citeshttps://doi.org/10.1007/978-3-319-20860-2_16openalex-snapshot
Synthesis of Quantum Circuits for Dedicated Physical Machine Descriptions
inferred← citeshttps://doi.org/10.1007/978-981-95-6039-4_3openalex-snapshot
Efficient Quantum Arithmetic Designs
inferred← citeshttps://doi.org/10.1007/s00034-020-01406-wopenalex-snapshot
Novel Optimum Parity-Preserving Reversible Multiplier Circuits
inferred← citeshttps://doi.org/10.1007/s10766-016-0407-8openalex-snapshot
Hierarchical Synthesis of Quantum and Reversible Architectures
inferred← citeshttps://doi.org/10.1007/s10773-021-04864-3openalex-snapshot
T-Count Optimized Wallace Tree Integer Multiplier for Quantum Computing
inferred← citeshttps://doi.org/10.1007/s11227-023-05162-xopenalex-snapshot
Efficient design of a quantum absolute-value circuit using Clifford+T gates
inferred← citeshttps://doi.org/10.1063/5.0239980openalex-snapshot
Chemical reaction simulator on quantum computers by first quantization—Basic treatment: Theoretical
inferred← citeshttps://doi.org/10.1088/1402-4896/ae4b73openalex-snapshot
Hardware-efficient quantum arithmetic logic units for square lattice architectures
inferred← citeshttps://doi.org/10.1088/2058-9565/aadd1aopenalex-snapshot
Mapping of lattice surgery-based quantum circuits on surface code architectures
inferred← citeshttps://doi.org/10.1088/2058-9565/ab177aopenalex-snapshot
Mapping quantum circuits on 3D nearest-neighbor architectures
inferred← citeshttps://doi.org/10.1093/imanum/drad018openalex-snapshot
Lax dynamics for Cartan decomposition with applications to Hamiltonian simulation
inferred← citeshttps://doi.org/10.1098/rsta.2023.0392openalex-snapshot
A comprehensive study of quantum arithmetic circuits
inferred← citeshttps://doi.org/10.1103/physreva.107.042621openalex-snapshot
Improving the number of T gates and their spread in integer multipliers on quantum computing
inferred← citeshttps://doi.org/10.1109/access.2024.3455997openalex-snapshot
Inexact Quantum Square Root Circuit for NISQ Devices
inferred← citeshttps://doi.org/10.1109/isvlsi.2019.00072openalex-snapshot
Design of Quantum Circuits for Cryptanalysis and Image Processing Applications
inferred← citeshttps://doi.org/10.1109/mdat.2019.2907130openalex-snapshot
Quantum Computing Circuits and Devices
inferred← citeshttps://doi.org/10.1109/metrocon54219.2021.9666048openalex-snapshot
The Future of mm-wave Wireless Communication Systems for Unmanned Aircraft Vehicles in the Era of Artificial Intelligence and Quantum Computing
inferred← citeshttps://doi.org/10.1109/tc.2018.2882774openalex-snapshot
Quantum Circuit Design of a T-count Optimized Integer Multiplier
inferred← citeshttps://doi.org/10.1109/tcad.2021.3057583openalex-snapshot
Timing and Resource-Aware Mapping of Quantum Circuits to Superconducting Processors
inferred← citeshttps://doi.org/10.1109/tqe.2024.3429451openalex-snapshot
BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2337302openalex-snapshot
PAQCS: Physical Design-Aware Fault-Tolerant Quantum Circuit Synthesis
inferred← citeshttps://doi.org/10.1140/epjqt/s40507-022-00125-2openalex-snapshot
Quantum pricing with a smile: implementation of local volatility model on quantum computer
inferred← citeshttps://doi.org/10.1145/2742854.2742856openalex-snapshot
Hierarchical synthesis of quantum and reversible architectures
inferred← citeshttps://doi.org/10.1145/3508352.3549462openalex-snapshot
MCQA
inferred← citeshttps://doi.org/10.1145/3528416.3530244openalex-snapshot
Practical approximate quantum multipliers for NISQ devices
inferred← citeshttps://doi.org/10.1145/3624484openalex-snapshot
SpinQ: Compilation Strategies for Scalable Spin-Qubit Architectures
inferred← citeshttps://doi.org/10.1145/3632901openalex-snapshot
A Case for Synthesis of Recursive Quantum Unitary Programs
inferred← citeshttps://doi.org/10.1145/3716368.3735184openalex-snapshot
Reducing T-Depth and T-Count in Quantum Multiplication Using Compressor Primitives
inferred← citeshttps://doi.org/10.13023/etd.2020.365openalex-snapshot
RESOURCE EFFICIENT DESIGN OF QUANTUM CIRCUITS FOR CRYPTANALYSIS AND SCIENTIFIC COMPUTING APPLICATIONS
inferred← citeshttps://doi.org/10.1371/journal.pone.0208561openalex-snapshot
Open source software in quantum computing
inferred← citeshttps://doi.org/10.17756/nwj.2023-s4-075openalex-snapshot
Design and Implementation of the Deutsch-Jozsa Algorithm Based Quantum Multiplier with a Reduced T-count
inferred← citeshttps://doi.org/10.48550/arxiv.1706.05113openalex-snapshot
T-count Optimized Design of Quantum Integer Multiplication
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.