vicentesteve

5 ms·

1.
by vicentesteve 1y ago
Hello everyone, I wrote this preprint article in an attempt to create a protocol that secures communications between classical clients and quantum servers in the cloud. I am posting here on Hacker News not to advertise the article, but to g
2.
Safe communication to a quantum cloud from classic clients is possible?(researchgate.net)
1 points by vicentesteve 1y ago|1 comments
3.
Can a classic client use a quantum server safely?(researchgate.net)
1 points by vicentesteve 1y ago|1 comments
4.
by vicentesteve 1y ago
Hola a tothom, he escrit aquest article preprint per intentar crear un protocol que asseguri les comunicacions entre clients clàssics i servidors quàntics al núvol. Publico aquí a Hacker News no per fer publicitat de l'article, sinó pe
5.
by vicentesteve 1y ago
Thanks for this — I really appreciate how clearly you explained the issue. You're absolutely right that, by definition, a verifier for an NP language must return false for all certificates if the instance is not in the language. That’s
6.
by vicentesteve 1y ago
Thanks for pointing that out. I’m not sure what happened with the DOI — I’m already in contact with ResearchGate to get that fixed. But the PDF is still available and can be viewed or downloaded directly from the ResearchGate page, just bel
7.
by vicentesteve 1y ago
Thank you very much for spending the time reading it — I really appreciate such a thoughtful and thorough comment. You're right on a couple of things. For instance, I probably overstated the time for parsing in a way that makes it soun
8.
by vicentesteve 1y ago
Appreciate the comment, I understand what you're trying to say. Just to clear something up where I'm at: I'm a student, not a professional researcher (yet, anyway), and I'm trying to get into this realm step by step. I d
9.
Definitive solution to the hardest problem in computing: P = NP?(researchgate.net)
22 points by vicentesteve 1y ago|14 comments
10.
by vicentesteve 1y ago
Hi everyone, I’m an independent researcher and recently completed a formal, self-contained proof that P ≠ NP. The result is based on an explicit language L* ∈ NP \ P that resists all polynomial-time machines via a certified local test. The
11.
Solution of the biggest Computational Problem P vs. NP(researchgate.net)
3 points by vicentesteve 1y ago|0 comments
12.
Universal Blind and Verifiable Delegated Quantum Computation with Classic Client(researchgate.net)
1 points by vicentesteve 1y ago|1 comments
13.
by vicentesteve 1y ago
Quantum computing offers immense power, but remains out of reach for most users. This preprint introduces a universal protocol that enables purely classical clients to securely delegate quantum computations to remote servers, while ensuring
14.
A new formal attempt at P ≠ NP avoiding known barriers(researchgate.net)
2 points by vicentesteve 1y ago|0 comments
15.
Universal Blind and Verifiable Delegated Quantum Computation with Classic Client(researchgate.net)
2 points by vicentesteve 1y ago|1 comments
16.
by vicentesteve 1y ago
Quantum computing offers immense power, but remains out of reach for most users. This preprint introduces a universal protocol that enables purely classical clients to securely delegate quantum computations to remote servers, while ensuring
17.
A constructive proof that P ≠ NP using circuit-resistant encodings(doi.org)
4 points by vicentesteve 1y ago|1 comments
18.
by vicentesteve 1y ago
Hi everyone, I’m an independent researcher and recently completed a formal, self-contained proof that P ≠ NP. The result is based on an explicit language L* ∈ NP \ P that resists all polynomial-time machines via a certified local test. The
19.
A constructive proof that P ≠ NP using circuit-resistant encodings(doi.org)
2 points by vicentesteve 1y ago|1 comments
20.
by vicentesteve 1y ago
Hi everyone, I’m an independent researcher and recently completed a formal, self-contained proof that P ≠ NP. The result is based on an explicit language L* ∈ NP \ P that resists all polynomial-time machines via a certified local test. The
21.
Universal Blind and Verifiable Delegated Quantum Computation Classic Client(zenodo.org)
1 points by vicentesteve 1y ago|1 comments
22.
by vicentesteve 1y ago
Quantum computing offers immense power, but remains out of reach for most users. This preprint introduces a universal protocol that enables purely classical clients to securely delegate quantum computations to remote servers, while ensuring
23.
Universal Blind and Verifiable Quantum Computation with Classical Clients(doi.org)
1 points by vicentesteve 1y ago|1 comments
24.
by vicentesteve 1y ago
Quantum computing offers immense power, but remains out of reach for most users. This preprint introduces a universal protocol that enables purely classical clients to securely delegate quantum computations to remote servers, while ensuring