On the public citation graph

Quantum Proofs

0 signed · 173 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.1006/jcss.1999.1651openalex-snapshot
Complexity Limitations on Quantum Computation
inferredcites →https://doi.org/10.1006/jcss.1999.1664openalex-snapshot
On Relationships between Statistical Zero-Knowledge Proofs
inferredcites →https://doi.org/10.1007/11672142_12openalex-snapshot
Entanglement in Interactive Proof Systems with Binary Answers
inferredcites →https://doi.org/10.1007/11776420_38openalex-snapshot
Online Variance Minimization
inferredcites →https://doi.org/10.1007/11830924_40openalex-snapshot
Consistency of Local Density Matrices Is QMA-Complete
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-24587-2_20openalex-snapshot
Non-interactive Quantum Perfect and Statistical Zero-Knowledge
inferredcites →https://doi.org/10.1007/978-3-540-70583-3_48openalex-snapshot
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
inferredcites →https://doi.org/10.1007/978-3-540-74240-1_38openalex-snapshot
Product Rules in Semidefinite Programming
inferredcites →https://doi.org/10.1007/978-3-540-78524-8_7openalex-snapshot
General Properties of Quantum Zero-Knowledge Proofs
inferredcites →https://doi.org/10.1007/978-3-642-10366-7_4openalex-snapshot
Quantum-Secure Coin-Flipping and Applications
inferredcites →https://doi.org/10.1007/978-3-642-22792-9_23openalex-snapshot
Classical Cryptographic Protocols in a Quantum World
inferredcites →https://doi.org/10.1007/978-3-642-29011-4_10openalex-snapshot
Quantum Proofs of Knowledge
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_33openalex-snapshot
Hardness of Approximation for Quantum Problems
inferredcites →https://doi.org/10.1007/978-3-662-43948-7_25openalex-snapshot
Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_50openalex-snapshot
Ground State Connectivity of Local Hamiltonians
inferredcites →https://doi.org/10.1007/978-3-662-48054-0_14openalex-snapshot
QMA with Subset State Witnesses
inferredcites →https://doi.org/10.1007/bf01200056openalex-snapshot
Non-deterministic exponential time has two-prover interactive protocols
inferredcites →https://doi.org/10.1007/bf01232444openalex-snapshot
On non-semisplit extensions, tensor products and exactness of groupC *-algebras
inferredcites →https://doi.org/10.1007/bf01663472openalex-snapshot
Quantum analogues of the Bell inequalities. The case of two spatially separated domains
inferredcites →https://doi.org/10.1007/s00037-008-0250-4openalex-snapshot
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems
inferredcites →https://doi.org/10.1007/s00037-013-0065-9openalex-snapshot
Parallel Approximation of Min-Max Problems
inferredcites →https://doi.org/10.1007/s11537-013-1280-5openalex-snapshot
About the Connes embedding conjecture
inferredcites →https://doi.org/10.1016/0022-0000(84)90068-0openalex-snapshot
The complexity of facets (and some facets of complexity)
inferredcites →https://doi.org/10.1016/0022-0000(88)90028-1openalex-snapshot
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
inferredcites →https://doi.org/10.1016/0022-0000(91)90006-qopenalex-snapshot
Statistical zero-knowledge languages can be recognized in two rounds
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1016/0304-3975(86)90135-0openalex-snapshot
NP is as easy as detecting unique solutions
inferredcites →https://doi.org/10.1016/0304-3975(94)90251-8openalex-snapshot
On the power of multi-prover interactive protocols
inferredcites →https://doi.org/10.1016/0375-9601(90)90172-kopenalex-snapshot
Incompatible results of quantum measurements
inferredcites →https://doi.org/10.1016/j.ipl.2004.02.005openalex-snapshot
Polynomial time quantum computation with advice
inferredcites →https://doi.org/10.1016/j.ipl.2014.05.005openalex-snapshot
Parallelization of entanglement-resistant multi-prover interactive proofs
inferredcites →https://doi.org/10.1016/s0019-9958(83)80060-6openalex-snapshot
Parallel computation for well-endowed rings and space-bounded probabilistic machines
inferredcites →https://doi.org/10.1016/s0022-0000(03)00035-7openalex-snapshot
Quantum multi-prover interactive proof systems with limited prior entanglement
inferredcites →https://doi.org/10.1016/s0022-0000(05)80061-3openalex-snapshot
Specified precision polynomial root isolation is in NC
inferredcites →https://doi.org/10.1016/s0304-3975(01)00375-9openalex-snapshot
PSPACE has constant-round quantum interactive proof systems
inferredcites →https://doi.org/10.1063/1.3514538openalex-snapshot
Connes' embedding problem and Tsirelson's problem
inferredcites →https://doi.org/10.1063/1.3652924openalex-snapshot
Lower bounds on the entanglement needed to play XOR non-local games
inferredcites →https://doi.org/10.1088/1367-2630/10/7/073013openalex-snapshot
A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
inferredcites →https://doi.org/10.1088/1751-8113/45/45/455304openalex-snapshot
Robust self-testing of the singlet
inferredcites →https://doi.org/10.1090/conm/536/10552openalex-snapshot
Efficient algorithm for a quantum analogue of 2-SAT
inferredcites →https://doi.org/10.1090/gsm/047openalex-snapshot
Classical and Quantum Computation
inferredcites →https://doi.org/10.1093/oso/9780198570004.001.0001openalex-snapshot
An Introduction to Quantum Computing
inferredcites →https://doi.org/10.1098/rspa.1998.0164openalex-snapshot
Quantum algorithms revisited
inferredcites →https://doi.org/10.1098/rspa.2008.0149openalex-snapshot
Monogamy of non-local quantum correlations
inferredcites →https://doi.org/10.1103/physicsphysiquefizika.1.195openalex-snapshot
On the Einstein Podolsky Rosen paradox
inferredcites →https://doi.org/10.1103/physreva.65.012310openalex-snapshot
Degrees of concealment and bindingness in quantum bit commitment protocols
inferredcites →https://doi.org/10.1103/physreva.67.060302openalex-snapshot
Universal entanglement transformations without communication
inferredcites →https://doi.org/10.1103/physreva.79.042106openalex-snapshot
Bounding the dimension of bipartite quantum systems
inferredcites →https://doi.org/10.1103/physrevlett.100.210503openalex-snapshot
Testing the Dimension of Hilbert Spaces
inferredcites →https://doi.org/10.1103/physrevlett.24.549openalex-snapshot
Proposed Experiment to Test Local Hidden Variable Theories.
inferredcites →https://doi.org/10.1103/physrevlett.65.3373openalex-snapshot
Simple unified form for the major no-hidden-variables theorems
inferredcites →https://doi.org/10.1103/physrevlett.86.1911openalex-snapshot
Bell's Theorem without Inequalities and without Probabilities for Two Observers
inferredcites →https://doi.org/10.1109/ccc.2004.1313850openalex-snapshot
Quantum Arthur-Merlin games
inferredcites →https://doi.org/10.1109/ccc.2005.21openalex-snapshot
On the Hardness of Distinguishing Mixed-State Quantum Computations
inferredcites →https://doi.org/10.1109/ccc.2005.37openalex-snapshot
Upper bounds for quantum interactive proofs with competing provers
inferredcites →https://doi.org/10.1109/ccc.2007.27openalex-snapshot
Quantum versus Classical Proofs and Advice
inferredcites →https://doi.org/10.1109/ccc.2008.6openalex-snapshot
Using Entanglement in Quantum Multi-prover Interactive Proofs
inferredcites →https://doi.org/10.1109/ccc.2009.22openalex-snapshot
Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies
inferredcites →https://doi.org/10.1109/ccc.2009.26openalex-snapshot
Parallel Approximation of Non-interactive Zero-sum Quantum Games
inferredcites →https://doi.org/10.1109/ccc.2014.12openalex-snapshot
On Physical Problems that are Slightly More Difficult than QMA
inferredcites →https://doi.org/10.1109/ccc.2014.28openalex-snapshot
A Parallel Repetition Theorem for Entangled Projection Games
inferredcites →https://doi.org/10.1109/ccc.2014.29openalex-snapshot
A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions
inferredcites →https://doi.org/10.1109/focs.2007.4389508openalex-snapshot
The Power of Quantum Systems on a Line
inferredcites →https://doi.org/10.1109/focs.2008.57openalex-snapshot
Quantum Multi Prover Interactive Proofs with Communicating Provers
inferredcites →https://doi.org/10.1109/focs.2009.22openalex-snapshot
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
inferredcites →https://doi.org/10.1109/focs.2009.30openalex-snapshot
Two-Message Quantum Interactive Proofs Are in PSPACE
inferredcites →https://doi.org/10.1109/focs.2012.11openalex-snapshot
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers
inferredcites →https://doi.org/10.1109/focs.2014.21openalex-snapshot
Complexity Classification of Local Hamiltonian Problems
inferredcites →https://doi.org/10.1109/focs.2014.57openalex-snapshot
Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding
inferredcites →https://doi.org/10.1109/icqnm.2009.21openalex-snapshot
All Languages in NP Have Very Short Quantum Proofs
inferredcites →https://doi.org/10.1109/psct.1987.10319265openalex-snapshot
The Complexity of Perfect Zero-Knowledge
inferredcites →https://doi.org/10.1109/sfcs.1984.715919openalex-snapshot
On The Complexity Of Matrix Group Problems I
inferredcites →https://doi.org/10.1109/sfcs.1992.267824openalex-snapshot
Probabilistic checking of proofs; a new characterization of NP
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.1997.646133openalex-snapshot
A complete promise problem for statistical zero-knowledge
inferredcites →https://doi.org/10.1109/sfcs.2000.892141openalex-snapshot
Succinct quantum proofs for properties of finite groups
inferredcites →https://doi.org/10.1109/sfcs.2002.1181970openalex-snapshot
Limits on the power of quantum statistical zero-knowledge
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1137/060670997openalex-snapshot
Zero-Knowledge against Quantum Attacks
inferredcites →https://doi.org/10.1137/090751293openalex-snapshot
Entangled Games Are Hard to Approximate
inferredcites →https://doi.org/10.1137/110856939openalex-snapshot
A Full Characterization of Quantum Advice
inferredcites →https://doi.org/10.1137/s0097539704445226openalex-snapshot
The Complexity of the Local Hamiltonian Problem
inferredcites →https://doi.org/10.1137/s0097539790182482openalex-snapshot
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
inferredcites →https://doi.org/10.1137/s0097539795280895openalex-snapshot
A Parallel Repetition Theorem
inferredcites →https://doi.org/10.1137/s0097539795293639openalex-snapshot
Quantum Computability
inferredcites →https://doi.org/10.1137/s0097539797325375openalex-snapshot
Two-Prover Protocols---Low Error at Affordable Rates
inferredcites →https://doi.org/10.1142/s0219749905001067openalex-snapshot
"NON-IDENTITY-CHECK" IS QMA-COMPLETE
inferredcites →https://doi.org/10.1145/103418.103440openalex-snapshot
Local expansion of vertex-transitive graphs and random generation in finite groups
inferredcites →https://doi.org/10.1145/1089023.1089025openalex-snapshot
Lattice problems in NP ∩ coNP
inferredcites →https://doi.org/10.1145/12130.12165openalex-snapshot
A fast parallel algorithm for determining all roots of a polynomial with real roots
inferredcites →https://doi.org/10.1145/1250790.1250823openalex-snapshot
A combinatorial, primal-dual approach to semidefinite programs
inferredcites →https://doi.org/10.1145/146585.146605openalex-snapshot
Algebraic methods for interactive proof systems
inferredcites →https://doi.org/10.1145/1536414.1536472openalex-snapshot
The detectability lemma and quantum gap amplification
inferredcites →https://doi.org/10.1145/1993636.1993684openalex-snapshot
Parallel repetition of entangled games
inferredcites →https://doi.org/10.1145/2090236.2090259openalex-snapshot
Quantum interactive proofs with weak error bounds
inferredcites →https://doi.org/10.1145/22145.22178openalex-snapshot
The knowledge complexity of interactive proof-systems
inferredcites →https://doi.org/10.1145/22145.22192openalex-snapshot
Trading group theory for randomness
inferredcites →https://doi.org/10.1145/226643.226652openalex-snapshot
Interactive proofs and the hardness of approximating cliques
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/2422436.2422475openalex-snapshot
Stronger methods of making quantum interactive proofs perfectly complete
inferredcites →https://doi.org/10.1145/2432622.2432625openalex-snapshot
Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
inferredcites →https://doi.org/10.1145/258533.258536openalex-snapshot
Some optimal inapproximability results
inferredcites →https://doi.org/10.1145/2591796.2591884openalex-snapshot
Analytical approach to parallel repetition
inferredcites →https://doi.org/10.1145/2688073.2688094openalex-snapshot
A Multiprover Interactive Proof System for the Local Hamiltonian Problem
inferredcites →https://doi.org/10.1145/2746539.2746565openalex-snapshot
Small Value Parallel Repetition for General Games
inferredcites →https://doi.org/10.1145/276698.276708openalex-snapshot
Quantum circuits with mixed states
inferredcites →https://doi.org/10.1145/276698.276852openalex-snapshot
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/2897518.2897634openalex-snapshot
Classical verification of quantum proofs
inferredcites →https://doi.org/10.1145/3335741.3335758openalex-snapshot
Multi-prover interactive proofs: how to remove intractability assumptions
inferredcites →https://doi.org/10.1145/335305.335387openalex-snapshot
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
inferredcites →https://doi.org/10.1145/505482.505499openalex-snapshot
Quantum computation and quantum information
inferredcites →https://doi.org/10.1145/780542.780545openalex-snapshot
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.21236/ada585814openalex-snapshot
Quantum Interactive Proofs with Short Messages
inferredcites →https://doi.org/10.22331/q-2022-03-17-668openalex-snapshot
The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings
inferredcites →https://doi.org/10.26421/qic10.3-4-11openalex-snapshot
Strong NP-hardness of the quantum separability problem
inferredcites →https://doi.org/10.26421/qic14.5-6-2openalex-snapshot
Two-message quantum interactive proofs and the quantum separability problem
inferredcites →https://doi.org/10.4153/cjm-1965-045-4openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.4230/lipics.stacs.2008.1322openalex-snapshot
Distinguishing Short Quantum Computations
inferredcites →https://doi.org/10.48550/arxiv.0804.4118openalex-snapshot
Coherent state exchange in multi-prover quantum interactive proof systems
inferredcites →https://doi.org/10.48550/arxiv.0909.3930openalex-snapshot
Computational Distinguishability of Quantum Channels
inferredcites →https://doi.org/10.48550/arxiv.1004.0264openalex-snapshot
Equilibrium Value Method for the Proof of QIP=PSPACE
inferredcites →https://doi.org/10.48550/arxiv.1209.0448openalex-snapshot
A classical leash for a quantum system: Command of quantum systems via rigidity of CHSH games
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0206070openalex-snapshot
A simple demonstration of Bell's theorem involving two observers and no probabilities or inequalities
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9610012openalex-snapshot
Quantum Randomness and Nondeterminism
inferredcites →https://doi.org/10.5555/2011534.2011541openalex-snapshot
3-local Hamitonian is QMA-complete
inferredcites →https://doi.org/10.5555/2016985.2016987openalex-snapshot
The complexity of quantum spin systems on a two-dimensional square lattice
inferredcites →https://doi.org/10.6028/jres.069b.004openalex-snapshot
Minimum partition of a matroid into independent subsets

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-030-64381-2_6openalex-snapshot
Non-interactive Classical Verification of Quantum Computation
inferred← citeshttps://doi.org/10.1007/978-3-032-16356-1_83openalex-snapshot
Games and Algebras
inferred← citeshttps://doi.org/10.1007/978-3-0348-0692-3_83-1openalex-snapshot
Games and Algebras
inferred← citeshttps://doi.org/10.1007/978-981-15-4451-4_55openalex-snapshot
Synchronization Safety Problem in Quantum Key Distribution System
inferred← citeshttps://doi.org/10.1007/978-981-15-7804-5_29openalex-snapshot
The Modified Algorithm of Quantum Key Distribution System Synchronization
inferred← citeshttps://doi.org/10.1007/978-981-92-3768-5_4openalex-snapshot
Toward a Framework for Ethical Quantum Computing: Foundations and Research Directions
inferred← citeshttps://doi.org/10.1007/s00023-017-0609-7openalex-snapshot
The Complexity of Translationally Invariant Spin Chains with Low Local Dimension
inferred← citeshttps://doi.org/10.1007/s00037-025-00273-8openalex-snapshot
Quantum state testing beyond the polarizing regime and quantum triangular discrimination
inferred← citeshttps://doi.org/10.1038/s41597-022-01639-1openalex-snapshot
QDataSet, quantum datasets for machine learning
inferred← citeshttps://doi.org/10.1038/s42254-024-00770-9openalex-snapshot
Challenges and opportunities in quantum optimization
inferred← citeshttps://doi.org/10.1088/1367-2630/aac153openalex-snapshot
Amortization does not enhance the max-Rains information of a quantum channel
inferred← citeshttps://doi.org/10.1088/2058-9565/ab8c51openalex-snapshot
Certification of a functionality in a quantum network stage
inferred← citeshttps://doi.org/10.1090/bull/1768openalex-snapshot
The Connes embedding problem: A guided tour
inferred← citeshttps://doi.org/10.1103/p84v-1xqvopenalex-snapshot
Quantum cryptography beyond key distribution: Theory and experiment
inferred← citeshttps://doi.org/10.1103/physreva.108.012409openalex-snapshot
Estimating distinguishability measures on quantum computers
inferred← citeshttps://doi.org/10.1103/physreva.94.022310openalex-snapshot
Operational meaning of quantum measures of recovery
inferred← citeshttps://doi.org/10.1103/physreva.97.042309openalex-snapshot
Bipartite discrimination of independently prepared quantum states as a counterexample to a parallel repetition conjecture
inferred← citeshttps://doi.org/10.1103/physrevlett.129.160503openalex-snapshot
Quantum Algorithms for Testing Hamiltonian Symmetry
inferred← citeshttps://doi.org/10.1109/ewdts.2016.7807623openalex-snapshot
Quantum-cryptographic network
inferred← citeshttps://doi.org/10.1109/focs.2019.00044openalex-snapshot
Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00082openalex-snapshot
stateQIP = statePSPACE
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174425openalex-snapshot
Coherent Quantum Channel Discrimination
inferred← citeshttps://doi.org/10.1109/jiot.2024.3410702openalex-snapshot
Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
inferred← citeshttps://doi.org/10.1109/jsac.2020.2967955openalex-snapshot
Entanglement Verification in Quantum Networks With Tampered Nodes
inferred← citeshttps://doi.org/10.1137/20m134592xopenalex-snapshot
Nonlocal Games with Noisy Maximally Entangled States are Decidable
inferred← citeshttps://doi.org/10.1139/cjp-2023-0260openalex-snapshot
Quantum computational complexity and symmetry
inferred← citeshttps://doi.org/10.1142/s0219749918400014openalex-snapshot
Classifying data using near-term quantum devices
inferred← citeshttps://doi.org/10.1142/s1230161223500178openalex-snapshot
Efficient Quantum Algorithms for Testing Symmetries of Open Quantum Systems
inferred← citeshttps://doi.org/10.1145/3023924.3023927openalex-snapshot
Data Transmission Network Based on Quantum Keys Distribution
inferred← citeshttps://doi.org/10.1145/3055399.3055441openalex-snapshot
Compression of quantum multi-prover interactive proofs
inferred← citeshttps://doi.org/10.1145/3058060.3058078openalex-snapshot
Features of the Photon Pulse Detection Algorithm in the Quantum Key Distribution System
inferred← citeshttps://doi.org/10.1145/3721487openalex-snapshot
Non-Destructive Zero-Knowledge Proofs on Quantum States, and Multi-Party Generation of Authorized Hidden GHZ States
inferred← citeshttps://doi.org/10.15488/16429openalex-snapshot
Certification of a functionality in a quantum network stage
inferred← citeshttps://doi.org/10.1561/0400000122openalex-snapshot
Security Models and Cryptographic Protocols in a Quantum World
inferred← citeshttps://doi.org/10.17863/cam.15638openalex-snapshot
The Complexity of Translationally Invariant Spin Chains with Low Local Dimension
inferred← citeshttps://doi.org/10.22331/q-2021-09-07-537openalex-snapshot
Policies for elementary links in a quantum network
inferred← citeshttps://doi.org/10.22331/q-2023-09-25-1120openalex-snapshot
Testing symmetry on quantum computers
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5456openalex-snapshot
Towards a General Framework for Practical Quantum Network Protocols
inferred← citeshttps://doi.org/10.4086/toc.2019.v015a005openalex-snapshot
inferred← citeshttps://doi.org/10.70675/02a59bcfz95b8z490cz85dbz51284b7c84f8openalex-snapshot
Nonlocality and self-testing graph states with bounded communication
inferred← citeshttps://doi.org/10.70675/81ee6bd6zb577z4b9bza57fzb37719ed77f2openalex-snapshot
Study of Protocols Between Classical Clients and a Quantum Server
inferred← citeshttps://doi.org/10.70675/eebef4cdzf16dz4fbcz9077z90e6d536c474openalex-snapshot
Few-body Förster resonances in Rydberg atoms for the implementation of quantum computing
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.