On the public citation graph
Efficient rate-adaptive reconciliation for continuous-variable quantum key distribution
0 signed · 81 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/0-387-28979-8openalex-snapshot
Prime Numbers: A Computational Perspective
inferredcites →https://doi.org/10.1007/3-540-36206-1_1openalex-snapshot
Primality Testing with Gaussian Periods
inferredcites →https://doi.org/10.1007/978-1-4757-1705-1_50openalex-snapshot
Numbers of solutions of equations in finite fields
inferredcites →https://doi.org/10.1007/978-3-642-27737-5_428-3openalex-snapshot
Quantum Computational Complexity
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferredcites →https://doi.org/10.1007/s00037-005-0194-xopenalex-snapshot
Quantum Arthur–Merlin games
inferredcites →https://doi.org/10.1016/0022-314x(80)90084-0openalex-snapshot
Probabilistic algorithm for testing primality
inferredcites →https://doi.org/10.1016/0022-314x(83)90055-0openalex-snapshot
Petites valeurs de la fonction d'Euler
inferredcites →https://doi.org/10.1017/9781316809976.001openalex-snapshot
Preface to the Second Edition
inferredcites →https://doi.org/10.1017/s0960129507006317openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.1049/sqj.1966.0063openalex-snapshot
Quantum Mechanics and Path Integrals
inferredcites →https://doi.org/10.1080/00029890.1984.11971425openalex-snapshot
Factorization and Primality Tests
inferredcites →https://doi.org/10.1090/mbk/121/84openalex-snapshot
Great Internet Mersenne Prime Search (GIMPS)
inferredcites →https://doi.org/10.1090/s0002-9904-1927-04368-3openalex-snapshot
Tests for primality by the converse of Fermat’s theorem
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866117-4openalex-snapshot
Very Short Primality Proofs
inferredcites →https://doi.org/10.1103/physreva.54.1034openalex-snapshot
Efficient networks for quantum factoring
inferredcites →https://doi.org/10.1103/physreva.54.147openalex-snapshot
Quantum networks for elementary arithmetic operations
inferredcites →https://doi.org/10.1103/physreva.55.900openalex-snapshot
Theory of quantum error-correcting codes
inferredcites →https://doi.org/10.1103/physreva.62.032312openalex-snapshot
Quantum probabilistic subroutines and problems in number theory
inferredcites →https://doi.org/10.1103/physreva.68.042318openalex-snapshot
Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
inferredcites →https://doi.org/10.1103/physreva.70.052328openalex-snapshot
Improved simulation of stabilizer circuits
inferredcites →https://doi.org/10.1103/physreva.71.052320openalex-snapshot
Fast quantum modular exponentiation
inferredcites →https://doi.org/10.1103/physrevlett.116.250501openalex-snapshot
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates
inferredcites →https://doi.org/10.1103/physrevlett.84.2525openalex-snapshot
Theory of Quantum Error Correction for General Noise
inferredcites →https://doi.org/10.1103/physrevlett.86.5188openalex-snapshot
A One-Way Quantum Computer
inferredcites →https://doi.org/10.1109/18.904522openalex-snapshot
Minimal entropy of states emerging from noisy quantum channels
inferredcites →https://doi.org/10.1109/9780470544907.ch24openalex-snapshot
Quantum Information Theory
inferredcites →https://doi.org/10.1117/12.683121openalex-snapshot
An algorithm for constructing polynomial systems whose solution space characterizes quantum circuits
inferredcites →https://doi.org/10.1137/0204018openalex-snapshot
Every Prime Has a Succinct Certificate
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
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.1142/s0129183197000138openalex-snapshot
Primality Test Via Quantum Factorization
inferredcites →https://doi.org/10.1142/s0219749909005699openalex-snapshot
MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES
inferredcites →https://doi.org/10.1145/258533.258579openalex-snapshot
Fault-tolerant quantum computation with constant error
inferredcites →https://doi.org/10.1145/800116.803773openalex-snapshot
Riemann's Hypothesis and tests for primality
inferredcites →https://doi.org/10.1201/9781439821916openalex-snapshot
Handbook of Applied Cryptography
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/2003859openalex-snapshot
Approximate Formulas for Some Functions of Prime Numbers
inferredcites →https://doi.org/10.2307/2005583openalex-snapshot
New Primality Criteria and Factorizations of 2 m ± 1
inferredcites →https://doi.org/10.2307/2118576openalex-snapshot
There are Infinitely Many Carmichael Numbers
inferredcites →https://doi.org/10.2307/2972687openalex-snapshot
On Composite Numbers P Which Satisfy the Fermat Congruence a P-1 ≡1 mod P
inferredcites →https://doi.org/10.26421/qic10.3-4-6openalex-snapshot
Classical simulation of quantum computation, the gottesman-Knill theorem, and slightly beyond
inferredcites →https://doi.org/10.26421/qic13.11-12-7openalex-snapshot
Efficient classical simulations of quantum Fourier transforms and Normalizer circuits over Abelian groups
inferredcites →https://doi.org/10.26421/qic14.7-8-7openalex-snapshot
Classical simulation complexity of extended Clifford circuits
inferredcites →https://doi.org/10.26421/qic17.3-4-5openalex-snapshot
Further extensions of Clifford circuits and their classical simulation complexities
inferredcites →https://doi.org/10.26421/qic3.3-7openalex-snapshot
3-Local Hamiltonian is QMA-complete
inferredcites →https://doi.org/10.26421/qic4.2-5openalex-snapshot
Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
inferredcites →https://doi.org/10.4230/lipics.tqc.2016.9openalex-snapshot
Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits
inferredcites →https://doi.org/10.48550/arxiv.0901.4709openalex-snapshot
Semidefinite programs for completely bounded norms
inferredcites →https://doi.org/10.48550/arxiv.1607.08473openalex-snapshot
Quantum circuits and low-degree polynomials over F_2
inferredcites →https://doi.org/10.48550/arxiv.1608.04829openalex-snapshot
Quantum Merlin-Arthur with noisy channel
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0210077openalex-snapshot
Quantum NP - A Survey
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0408129openalex-snapshot
Quantum computing and polynomial equations over the finite field Z_2
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9705052openalex-snapshot
Stabilizer Codes and Quantum Error Correction
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9806084openalex-snapshot
Fast versions of Shor's quantum factoring algorithm
inferredcites →https://doi.org/10.7907/rzr7-dt72.openalex-snapshot
Stabilizer Codes and Quantum Error Correction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00220-021-04285-7openalex-snapshot
Continuous-Variable Nonlocality and Contextuality
inferred← citeshttps://doi.org/10.1049/qtc2.12103openalex-snapshot
Classical channel bandwidth requirements in continuous variable quantum key distribution systems
inferred← citeshttps://doi.org/10.1088/1361-6455/aaf0b7openalex-snapshot
Polarization attack on continuous-variable quantum key distribution
inferred← citeshttps://doi.org/10.1103/kgpx-krj7openalex-snapshot
Information reconciliation for phase shift keying discrete modulation continuous-variable quantum key distribution
inferred← citeshttps://doi.org/10.1103/physreva.101.022335openalex-snapshot
Quantifying the resource content of quantum channels: An operational approach
inferred← citeshttps://doi.org/10.1103/physreva.101.062114openalex-snapshot
Quantifying coherence in terms of the pure-state coherence
inferred← citeshttps://doi.org/10.1103/physreva.107.022420openalex-snapshot
Cohering and decohering power of massive scalar fields under instantaneous interactions
inferred← citeshttps://doi.org/10.1103/physreva.96.062134openalex-snapshot
Discrete Wigner formalism for qubits and noncontextuality of Clifford gates on qubit stabilizer states
inferred← citeshttps://doi.org/10.1103/physreva.97.052327openalex-snapshot
Continuous-variable measurement-device-independent quantum key distribution: Composable security against coherent attacks
inferred← citeshttps://doi.org/10.1103/physreva.98.012314openalex-snapshot
Composable security analysis of continuous-variable measurement-device-independent quantum key distribution with squeezed states for coherent attacks
inferred← citeshttps://doi.org/10.1103/physreva.98.032314openalex-snapshot
Gaussian one-way thermal quantum cryptography with finite-size effects
inferred← citeshttps://doi.org/10.1103/physrevlett.121.070404openalex-snapshot
Probabilistic Distillation of Quantum Coherence
inferred← citeshttps://doi.org/10.1103/physrevlett.125.010502openalex-snapshot
Long-Distance Continuous-Variable Quantum Key Distribution over 202.81 km of Fiber
inferred← citeshttps://doi.org/10.1103/physrevlett.126.090505openalex-snapshot
Quantum Computational Advantage with String Order Parameters of One-Dimensional Symmetry-Protected Topological Order
inferred← citeshttps://doi.org/10.1103/physrevresearch.2.013109openalex-snapshot
Coherence manipulation with dephasing-covariant operations
inferred← citeshttps://doi.org/10.1103/prxquantum.4.010313openalex-snapshot
Advantages and Limitations of Quantum Routing
inferred← citeshttps://doi.org/10.22331/q-2018-06-07-71openalex-snapshot
Codes and Protocols for Distilling T , controlled- S , and Toffoli Gates
inferred← citeshttps://doi.org/10.22331/q-2018-10-19-100openalex-snapshot
Using and reusing coherence to realize quantum processes
inferred← citeshttps://doi.org/10.4204/eptcs.287.1openalex-snapshot
Towards Large-scale Functional Verification of Universal Quantum Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.2204.08782openalex-snapshot
The Interplay between Quantum Contextuality and Wigner Negativity
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.