activity
20162023
most citedTime complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations

51 citations · 130 across the 11 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

quant-ph2018

Client-friendly continuous-variable blind and verifiable quantum computing

Nana Liu, Tommaso F. Demarie, Si-Hui Tan +2

We present a verifiable and blind protocol for assisted universal quantum computing on continuous-variable (CV) platforms. This protocol is highly experimentally-friendly to the cl…