On the public citation graph

Asymptotically optimal circuits for arbitrary n-qubit diagonal computations

0 signed · 35 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.1002/nla.2331openalex-snapshot
Quantum Fourier transform revisited
inferred← citeshttps://doi.org/10.1007/s10773-017-3632-zopenalex-snapshot
An Improved Arbitrated Quantum Scheme with Bell States
inferred← citeshttps://doi.org/10.1016/j.cpc.2019.107001openalex-snapshot
Quantum circuits synthesis using Householder transformations
inferred← citeshttps://doi.org/10.1016/j.future.2025.107975openalex-snapshot
A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method
inferred← citeshttps://doi.org/10.1038/srep02232openalex-snapshot
Experimental simulation of quantum tunneling in small systems
inferred← citeshttps://doi.org/10.1088/1367-2630/16/3/033040openalex-snapshot
Efficient quantum circuits for diagonal unitaries without ancillas
inferred← citeshttps://doi.org/10.1098/rsos.160906openalex-snapshot
Efficient quantum circuits for dense circulant and circulant like operators
inferred← citeshttps://doi.org/10.1103/physreva.103.032417openalex-snapshot
Quantum-Fourier-transform-based quantum arithmetic with qudits
inferred← citeshttps://doi.org/10.1103/physreva.111.022417openalex-snapshot
Lower bounds for the Trotter error
inferred← citeshttps://doi.org/10.1103/physreva.71.052318openalex-snapshot
Criteria for exact qudit universality
inferred← citeshttps://doi.org/10.1103/physreva.71.052330openalex-snapshot
Quantum circuits with uniformly controlled one-qubit gates
inferred← citeshttps://doi.org/10.1103/physreva.93.052333openalex-snapshot
Phase-context decomposition of diagonal unitaries for higher-dimensional systems
inferred← citeshttps://doi.org/10.1103/physrevd.101.074038openalex-snapshot
Quantum computing for neutrino-nucleus scattering
inferred← citeshttps://doi.org/10.1103/physrevd.106.074013openalex-snapshot
Medium induced jet broadening in a quantum computer
inferred← citeshttps://doi.org/10.1103/physrevd.106.094504openalex-snapshot
How many quantum gates do gauge theories require?
inferred← citeshttps://doi.org/10.1103/physrevlett.127.270503openalex-snapshot
Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators
inferred← citeshttps://doi.org/10.1103/physrevlett.92.177902openalex-snapshot
Efficient Decomposition of Quantum Gates
inferred← citeshttps://doi.org/10.1103/physrevlett.93.130502openalex-snapshot
Quantum Circuits for General Multiqubit Gates
inferred← citeshttps://doi.org/10.1103/physrevlett.94.230502openalex-snapshot
Asymptotically Optimal Quantum Circuits for d -Level Systems
inferred← citeshttps://doi.org/10.1103/prxquantum.4.020323openalex-snapshot
Complexity of Implementing Trotter Steps
inferred← citeshttps://doi.org/10.1109/tc.2011.114openalex-snapshot
An Extended XQDD Representation for Multiple-Valued Quantum Logic
inferred← citeshttps://doi.org/10.1109/tpami.2026.3715237openalex-snapshot
AI-Empowered Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects
inferred← citeshttps://doi.org/10.2200/s00066ed1v01y200610cac001openalex-snapshot
Quantum Computing for Computer Architects
inferred← citeshttps://doi.org/10.2200/s00331ed1v01y201101cac013openalex-snapshot
Quantum Computing for Computer Architects, Second Edition
inferred← citeshttps://doi.org/10.22331/q-2020-07-06-291openalex-snapshot
Option Pricing using Quantum Computers
inferred← citeshttps://doi.org/10.22331/q-2022-06-17-739openalex-snapshot
Quantum simulation in the semi-classical regime
inferred← citeshttps://doi.org/10.22331/q-2023-12-20-1213openalex-snapshot
General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory
inferred← citeshttps://doi.org/10.22331/q-2024-11-20-1530openalex-snapshot
Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
inferred← citeshttps://doi.org/10.22331/q-2026-03-20-2034openalex-snapshot
A Novel Single-Layer Quantum Neural Network for Approximate SRBB-Based Unitary Synthesis
inferred← citeshttps://doi.org/10.26421/qic11.3-4-6openalex-snapshot
Block-based quantum-logic synthesis
inferred← citeshttps://doi.org/10.5753/sbccq.2026.23563openalex-snapshot
Síntese de Operadores Unitários Baseada em Gramáticas
inferred← citeshttps://doi.org/10.70675/e70b70f9z8381z43a4z806fz68402f3080deopenalex-snapshot
Methods for optimizing the synthesis of quantum circuits
inferred← citeshttps://doi.org/10.70675/efb16840z58b5z4c76z8eadzfeae7d3faaaaopenalex-snapshot
Simulation of atomic nuclei and their constituents with quantum computers
inferred← citeshttps://doi.org/10.7498/aps.67.20180754openalex-snapshot
New research progress of nuclear magnetic resonance quantum information processing
inferred← citeshttps://doi.org/10.7566/jpsj.93.054002openalex-snapshot
Optimized Synthesis of Circuits for Diagonal Unitary Matrices with Reflection Symmetry
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.