Dr. Si-Hui Tan Profile

Dr. Si-Hui Tan

Research Scientist at Singapore Univ of Technology & Design

SPIE Involvement:

Author

Publications (3)

Proceedings Article | 6 November 2018 Presentation

Non-interactive protocols for processing encrypted data (Conference Presentation)

Si-Hui Tan

Proceedings Volume 10771, 107710M (2018) https://doi.org/10.1117/12.2324404

KEYWORDS: Data processing, Quantum communications, Computer security, Quantum computing, Computing systems

Read Abstract +

Proceedings Article | 11 October 2018 Presentation

Client-friendly continuous variable blind and verifiable quantum computing (Conference Presentation)

Nana Liu, Tommaso Demarie, Si-Hui Tan, Leandro Aolita, Joseph Fitzsimons

Proceedings Volume 10803, 108030J (2018) https://doi.org/10.1117/12.2326145

KEYWORDS: Quantum computing, Clouds, Integrated optics, Quantum information, Quantum efficiency, Data hiding, Quantum wells, Quantum optics, Optical networks, Computing systems

Read Abstract +

Limitations due to high costs and technological requirements will require users to access the first quantum processors through the cloud. Delegating a computation, however, raises privacy issues about the clients' data and poses questions about the verifiability of computations in high complexity regimes. These concerns have inspired a plethora of blind and verifiable quantum computation protocols, which allow a client with limited quantum capabilities to delegate a quantum computation to a remote server while hiding her data and preserving the integrity of the computation. The majority of these protocols are constrained to discrete quantum systems, but quantum information can also be processed by continuous-variable architectures. These offer a competitive alternative to their discrete-variable counterparts for numerous practical benefits: They rely on well-established quantum optical techniques, allow for the generation of very large optical resource states, offer higher detection efficiencies, and can be integrated into existing optical-fibre networks, all of which are highly desirable features for cloud quantum computing. In this work we fill this gap by presenting a blind and verifiable quantum computing protocol tailored to the unique features of continuous-variable systems. One such feature is the experimental accessibility of Gaussian operations. Our protocol is then based on the delegation of the experimentally challenging non-Gaussian operations. In this sense, it is experimentally friendly to the client, who only needs to perform Gaussian operations. Furthermore, unlike previous schemes, this protocol does not require repeated interactions between the client and server because it only involves the server sending the client non-Gaussian states. We prove universality and blindness using standard techniques, and we introduce an efficient fidelity test - based on homodyne detection - that allows the client to verify the correctness of the computation. This test is interesting in its own right because it could be employed in the context of state-certification of optical systems. The division of quantum hardware between client and server assumed here is typical of the experimental constraints expected in realistic, commercially useful schemes for continuous-variable cloud quantum computing. As such, we believe our protocol constitutes a significant advance towards their actual realisation.

Proceedings Article | 4 October 2016 Presentation + Paper

Photon-number-resolving detectors and their role in quantifying quantum correlations

Si-Hui Tan, Leonid Krivitsky, Berthold-Georg Englert

Proceedings Volume 9980, 99800E (2016) https://doi.org/10.1117/12.2239002

KEYWORDS: Scientific research, Sensors, Photodetectors, Quantum physics, Chemical mechanical planarization, Beam splitters, Statistical analysis, Quantum optics, Photon counting, Roads

Read Abstract +

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Keywords/Phrases

Search In:

Publication Years