On the public citation graph

The quantum Fourier transform on a linear nearest neighbor architecture

0 signed · 45 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.1098/rspa.1998.0164openalex-snapshot

Quantum algorithms revisited

inferredcites →https://doi.org/10.1103/physreva.64.022312openalex-snapshot

Quantum network optimization

inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot

Algorithms for quantum computation: discrete logarithms and factoring

inferredcites →https://doi.org/10.1109/sfcs.2000.892139openalex-snapshot

An improved quantum Fourier transform algorithm and applications

inferredcites →https://doi.org/10.1109/sfcs.2000.892140openalex-snapshot

Fast parallel circuits for the quantum Fourier transform

inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot

Quantum Computation and Quantum Information

inferredcites →https://doi.org/10.1137/s0097539799355053openalex-snapshot

Parallel Quantum Computation and Quantum Codes

inferredcites →https://doi.org/10.1142/s0219749904000109openalex-snapshot

EXACT QUANTUM FOURIER TRANSFORMS AND DISCRETE LOGARITHM ALGORITHMS

inferredcites →https://doi.org/10.26421/qic3.2-8openalex-snapshot

Circuit for Shor's algorithm using 2n+3 qubits

inferredcites →https://doi.org/10.26421/qic6.2-4openalex-snapshot

A quantum circuit for Shor's factoring algorithm using 2n+2 qubits

inferredcites →https://doi.org/10.4230/lipics.snapl.2019.12openalex-snapshot

An approximate Fourier transform useful in quantum factoring

inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0008033openalex-snapshot

Addition on a Quantum Computer

inferredcites →https://doi.org/10.5555/2011827.2011828openalex-snapshot

Implementation of Shor's algorithm on a linear nearest neighbour qubit array

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-36030-5_7openalex-snapshot

A Polynomial Size Model with Implicit SWAP Gate Counting for Exact Qubit Reordering

inferred← citeshttps://doi.org/10.1007/978-3-642-29517-1_8openalex-snapshot

Changing the Gate Order for Optimal LNN Conversion

inferred← citeshttps://doi.org/10.1007/978-3-642-38986-3_6openalex-snapshot

Constant-Factor Optimization of Quantum Adders on 2D Quantum Architectures

inferred← citeshttps://doi.org/10.1007/s10699-018-9569-8openalex-snapshot

Towards a Multi Target Quantum Computational Logic

inferred← citeshttps://doi.org/10.1007/s10773-019-04051-5openalex-snapshot

A Matrix Representation of Quantum Circuits over Non-Adjacent Qudits

inferred← citeshttps://doi.org/10.1007/s11128-010-0201-2openalex-snapshot

Synthesis of quantum circuits for linear nearest neighbor architectures

inferred← citeshttps://doi.org/10.1007/s11128-012-0444-1openalex-snapshot

Using non-ideal gates to implement universal quantum computing between uncoupled qubits

inferred← citeshttps://doi.org/10.1007/s11128-012-0485-5openalex-snapshot

Efficient quantum computing between remote qubits in linear nearest neighbor architectures

inferred← citeshttps://doi.org/10.1007/s11128-013-0601-1openalex-snapshot

Line ordering of reversible circuits for linear nearest neighbor realization

inferred← citeshttps://doi.org/10.1007/s11128-017-1662-3openalex-snapshot

Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective

inferred← citeshttps://doi.org/10.1007/s11128-023-04159-yopenalex-snapshot

An improved circuit for Shor’s factoring algorithm using $$2n+2$$ qubits

inferred← citeshttps://doi.org/10.1038/s41534-020-0257-5openalex-snapshot

Approximate quantum Fourier transform with O(n log(n)) T gates

inferred← citeshttps://doi.org/10.1088/1367-2630/aa7144openalex-snapshot

Flexible resources for quantum metrology

inferred← citeshttps://doi.org/10.1103/2wzk-fnhxopenalex-snapshot

SWAP-less implementation of quantum algorithms

inferred← citeshttps://doi.org/10.1109/aspdac.2014.6742939openalex-snapshot

Optimal SWAP gate insertion for nearest neighbor quantum circuits

inferred← citeshttps://doi.org/10.1109/aspdac.2014.6742940openalex-snapshot

Qubit placement to minimize communication overhead in 2D quantum architectures

inferred← citeshttps://doi.org/10.1109/icqnm.2009.25openalex-snapshot

An Efficient Method to Convert Arbitrary Quantum Circuits to Ones on a Linear Nearest Neighbor Architecture

inferred← citeshttps://doi.org/10.1109/ismvl.2012.70openalex-snapshot

Quantum Computing, Cryptography and Compilers

inferred← citeshttps://doi.org/10.1109/mcas.2016.2549950openalex-snapshot

Layout Optimization for Quantum Circuits with Linear Nearest Neighbor Architectures

inferred← citeshttps://doi.org/10.1109/tcad.2014.2356463openalex-snapshot

Exact Reordering of Circuit Lines for Nearest Neighbor Quantum Architectures

inferred← citeshttps://doi.org/10.1109/tqe.2021.3053921openalex-snapshot

Compiler Design for Distributed Quantum Computing

inferred← citeshttps://doi.org/10.1117/12.2529201openalex-snapshot

On-chip deterministic optical SWAP gate

inferred← citeshttps://doi.org/10.1145/2287696.2287707openalex-snapshot

A Θ( √ n)-depth quantum adder on the 2D NTC quantum computer architecture

inferred← citeshttps://doi.org/10.1145/2431211.2431220openalex-snapshot

Synthesis and optimization of reversible circuits—a survey

inferred← citeshttps://doi.org/10.1145/2463209.2488785openalex-snapshot

Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures

inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1276openalex-snapshot

Quantum Arithmetic Circuits: A Survey

inferred← citeshttps://doi.org/10.2298/fuee1101071popenalex-snapshot

Synthesis of quantum circuits in Linear Nearest neighbor Model using Positive Davio Lattices

inferred← citeshttps://doi.org/10.2478/qic-2025-0028openalex-snapshot

Implementation of Quantum Fourier Transform and Quantum Hashing for Quantum Devices with Arbitrary Qubit Connectivity Graphs

inferred← citeshttps://doi.org/10.2478/qic-2026-0008openalex-snapshot

Quantum Circuit Optimization Techniques: A Literature Survey

inferred← citeshttps://doi.org/10.26421/qic11.1-2-10openalex-snapshot

An efficient conversion of quantum circuits to a linear nearest neighbor architecture

inferred← citeshttps://doi.org/10.28991/esj-2023-07-01-020openalex-snapshot

A Brief Review on Mathematical Tools Applicable to Quantum Computing for Modelling and Optimization Problems in Engineering

inferred← citeshttps://doi.org/10.48550/arxiv.1711.09765openalex-snapshot

Quantum circuit optimization for unitary operators over non-adjacent qudits

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.