Optimised resource construction for verifiable quantum computation (Q2988006): Difference between revisions

@@ Property / cites work @@
+Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
+Normal rank
@@ Property / cites work @@
+The computational complexity of linear optics
@@ Property / cites work: The computational complexity of linear optics / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial quantum algorithm for approximating the Jones polynomial
+Normal rank
@@ Property / cites work @@
+Q2969059
@@ Property / cites work: Q2969059 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5741632
@@ Property / cites work: Q5741632 / rank @@
+Normal rank
@@ Property / cites work @@
+Robustness and device independence of verifiable blind quantum computing
+Normal rank
@@ Property / cites work @@
+Composable Security of Delegated Quantum Computation
+Normal rank
@@ Property / cites work @@
+Practical Sharing of Quantum Secrets over Untrusted Channels
+Normal rank
@@ Property / cites work @@
+Quantum One-Time Programs
@@ Property / cites work: Quantum One-Time Programs / rank @@
+Normal rank
@@ Property / cites work @@
+The measurement calculus
@@ Property / cites work: The measurement calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Multiparty entanglement in graph states
@@ Property / cites work: Multiparty entanglement in graph states / rank @@
+Normal rank
@@ Property / cites work @@
+Universal Blind Quantum Computation
@@ Property / cites work: Universal Blind Quantum Computation / rank @@
+Normal rank