arXiv subjects

Si-Hui Tan

Publications and source records attributed to Si-Hui Tan.

At least 19 recordsLinked to original sources

arXiv2025

The Quantum Internet (Technical Version)

Following the emergence of quantum computing, the subsequent quantum revolution will be that of interconnecting individual quantum computers at global level. In the same way that classical computers only realised their full potential with the emergence of the internet, a fully realised quantum internet is the next stage of evolution for quantum computation. This work examines in detail how the quantum internet would evolve in practice, focusing not only on the technology itself but also on the implications it will have economically and politically. We present both original ideas, as well as an extensive review of relevant and related background material. This work begins with a description of classical networks before introducing the key concepts behind quantum networks, such as quantum internet protocols, quantum cryptography, and cloud quantum computing. The work is divided into technical sections (requiring only a basic knowledge of the notation of quantum mechanics), for those interested in mathematical details, as well as non-technical sections for those seeking a more general understanding. We target this work very broadly at quantum and classical computer scientists, classical computer systems, software and network engineers, physicists, economists, artists, musicians, and those just generally curious about the future of quantum technologies and what they might bring to humanity.

quant-ph↗

arXiv2020

Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security

Future quantum computers are likely to be expensive and affordable outright by few, motivating client/server models for outsourced computation. However, the applications for quantum computing will often involve sensitive data, and the client would like to keep her data secret, both from eavesdroppers and the server itself. Homomorphic encryption is an approach for encrypted, outsourced quantum computation, where the client's data remains secret, even during execution of the computation. We present a scheme for the homomorphic encryption of arbitrary quantum states of light with no more than a fixed number of photons, under the evolution of both passive and adaptive linear optics, the latter of which is universal for quantum computation. The scheme uses random coherent displacements in phase-space to obfuscate client data. In the limit of large coherent displacements, the protocol exhibits asymptotically perfect information-theoretic secrecy. The experimental requirements are modest, and easily implementable using present-day technology.

quant-ph↗

arXiv2018

Composable secure multi-client delegated quantum computation

The engineering challenges involved in building large scale quantum computers, and the associated infrastructure requirements, mean that when such devices become available it is likely that this will be in limited numbers and in limited geographic locations. It is likely that many users will need to rely on remote access to delegate their computation to the available hardware. In such a scenario, the privacy and reliability of the delegated computations are important concerns. On the other hand, the distributed nature of modern computations has led to a widespread class of applications in which a group of parties attempt to perform a joint task over their inputs, e.g., in cloud computing. In this paper, we study the multi-client delegated quantum computation problem where we consider the global computation be made up of local computations that are individually decided by the clients. Each client part is kept secret from the server and the other clients. We construct a composable secure multi-client delegated quantum computation scheme from any composable secure single-client delegated quantum computation protocol and quantum authentication codes.

quant-ph↗

arXiv2018

Quantum homomorphic encryption from quantum codes

The recent discovery of fully-homomorphic classical encryption schemes has had a dramatic effect on the direction of modern cryptography. Such schemes, however, implicitly rely on the assumptions that solving certain computation problems are intractable. Here we present a quantum encryption scheme which is homomorphic for arbitrary classical and quantum circuits which have at most some constant number of non-Clifford gates. Unlike classical schemes, the security of the scheme we present is information theoretic and hence independent of the computational power of an adversary.

quant-ph↗

arXiv2018

Client-friendly continuous-variable blind and verifiable quantum computing

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 client, as it only requires Gaussian-operation capabilities from the latter. Moreover, the server is not required universal quantum-computational power either, its only function being to supply the client with copies of a single-mode non-Gaussian state. Universality is attained based on state-injection of the server's non-Gaussian supplies. The protocol is automatically blind because the non-Gaussian resource requested to the server is always the same, regardless of the specific computation. Verification, in turn, is possible thanks to an efficient non-Gaussian state fidelity test where we assume identical state preparation by the server. It is based on Gaussian measurements by the client on the injected states, which is potentially interesting on its own. The division of quantum hardware between client and server assumed here is in agreement with the experimental constraints expected in realistic schemes for CV cloud quantum computing.

quant-ph↗

arXiv2018

The resurgence of the linear optics quantum interferometer --- recent advances & applications

Linear optics has seen a resurgence for applications in quantum information processing owing to its miniaturisation on-chip, and increase in production efficiency and quality of single photons. Time-bin encodings have also become feasible owing to architectural breakthroughs, and new processing capabilities. Theoretical efforts have found new ways to implement universal quantum computations with linear optics requiring less resources, and to demonstrate the capabilities of linear optics without requiring a universal optical quantum computer.

quant-ph↗

arXiv2018

Experimental Quantum Homomorphic Encryption

Quantum computers promise not only to outperform classical machines for certain important tasks, but also to preserve privacy of computation. For example, the blind quantum computing protocol enables secure delegated quantum computation, where a client can protect the privacy of their data and algorithms from a quantum server assigned to run the computation. However, this security comes at the expense of interaction: the client and server must communicate after each step of the computation. Homomorphic encryption, on the other hand, avoids this limitation. In this scenario, the server specifies the computation to be performed, and the client provides only the input data, thus enabling secure non-interactive computation. Here we demonstrate a homomorphic-encrypted quantum random walk using single-photon states and non-birefringent integrated optics. The client encrypts their input state in the photons' polarization degree of freedom, while the server performs the computation using the path degree of freedom. Our random walk computation can be generalized, suggesting a promising route toward more general homomorphic encryption protocols.

quant-ph↗

arXiv2017

Practical quantum somewhat-homomorphic encryption with coherent states

We present a scheme for implementing homomorphic encryption on coherent states encoded using phase-shift keys. The encryption operations require only rotations in phase space, which commute with computations in the codespace performed via passive linear optics, and with generalized non-linear phase operations that are polynomials of the photon-number operator in the codespace. This encoding scheme can thus be applied to any computation with coherent state inputs, and the computation proceeds via a combination of passive linear optics and generalized non-linear phase operations. An example of such a computation is matrix multiplication, whereby a vector representing coherent state amplitudes is multiplied by a matrix representing a linear optics network, yielding a new vector of coherent state amplitudes. By finding an orthogonal partitioning of the support of our encoded states, we quantify the security of our scheme via the indistinguishability of the encrypted codewords. Whilst we focus on coherent state encodings, we expect that this phase-key encoding technique could apply to any continuous-variable computation scheme where the phase-shift operator commutes with the computation.

quant-ph↗

arXiv2017

Overarching framework between Gaussian quantum discord and Gaussian quantum illumination

We cast the problem of illuminating an object in a noisy environment into a communication protocol. A probe is sent into the environment, and the presence or absence of the object constitutes a signal encoded on the probe. The probe is then measured to decode the signal. We calculate the Holevo information and bounds to the accessible information between the encoded and received signal with two different Gaussian probes---an Einstein-Podolsky-Rosen (EPR) state and a coherent state. We also evaluate the Gaussian discord consumed during the encoding process with the EPR probe. We find that the Holevo quantum advantage, defined as the difference between the Holevo information obtained from the EPR and coherent state probes, is approximately equal to the discord consumed. These quantities become exact in the typical illumination regime of low object reflectivity and low probe energy. Hence we show that discord is the resource responsible for the quantum advantage in Gaussian quantum illumination.

quant-ph↗

arXiv2017

Computing on quantum shared secrets

A (k,n)-threshold secret-sharing scheme allows for a string to be split into n shares in such a way that any subset of at least k shares suffices to recover the secret string, but such that any subset of at most k-1 shares contains no information about the secret. Quantum secret-sharing schemes extend this idea to the sharing of quantum states. Here we propose a method of performing computation on quantum shared secrets. We introduce a (n,n)-quantum secret sharing scheme together with a set of protocols that allow quantum circuits to be evaluated on the shared secret without the need to decode the secret. We consider a multipartite setting, with each participant holding a share of the secret. We show that if there exists at least one honest participant, no group of dishonest participants can recover any information about the shared secret, independent of their deviations from the protocol.

quant-ph↗

arXiv2015

Measuring Quantum Correlations using Lossy Photon-Number-Resolving Detectors with Saturation

The variance of difference of photocounts (VDPs) is an established measure of quantum correlations for quantum states of light. It enables us to discriminate between the classical correlation of a two-mode coherent state and the quantum correlation of a twin-beam state. We study the effect of loss and saturation of the photon-number-resolving detector on the measurement of the VDPs. An analytic function is derived for this variance, both for the coherent and the twin-beam states. It is found that the VDPs is no longer a reliable entanglement measure in the nonlinear regime of the detector response but it remains useful in some range of values of average photon numbers of the incident light. We also quantify the linear regime of the detector with saturation which will be useful for calibration of the detector quantum efficiency.

quant-ph↗

arXiv2015

A quantum approach to homomorphic encryption

Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum homomorphic encryption scheme that enables a broad class of quantum computation on encrypted data. A particular instance of our encoding hides up to a constant fraction of the information encrypted. This fraction can be made arbitrarily close to unity with overhead scaling only polynomially in the message length. This highlights the potential of our protocol to hide a non-trivial amount of information, and is suggestive of a large class of encodings that might yield better security.

quant-ph↗

arXiv2015

Generalized multi-photon quantum interference

Non-classical interference of photons lies at the heart of optical quantum information processing. This effect is exploited in universal quantum gates as well as in purpose-built quantum computers that solve the BosonSampling problem. Although non-classical interference is often associated with perfectly indistinguishable photons this only represents the degenerate case, hard to achieve under realistic experimental conditions. Here we exploit tunable distinguishability to reveal the full spectrum of multi-photon non-classical interference. This we investigate in theory and experiment by controlling the delay times of three photons injected into an integrated interferometric network. We derive the entire coincidence landscape and identify transition matrix immanants as ideally suited functions to describe the generalized case of input photons with arbitrary distinguishability. We introduce a compact description by utilizing a natural basis which decouples the input state from the interferometric network, thereby providing a useful tool for even larger photon numbers.

quant-ph↗

arXiv2014

Coincidence Landscapes for Three-Channel Linear Optical Networks

We use permutation-group methods plus SU(3) group-theoretic methods to determine the action of a three-channel passive optical interferometer on controllably delayed single-photon pulse inputs to each channel. Permutation-group techniques allow us to relate directly expressions for rates and, in particular, investigate symmetries in the coincidence landscape. These techniques extend the traditional Hong-Ou-Mandel effect analysis for two-channel interferometry to valleys and plateaus in three-channel interferometry. Our group-theoretic approach is intuitively appealing because the calculus of Wigner $D$ functions partially accounts for permutational symmetries and directly reveals the connections among $D$ functions, partial distinguishability, and immanants.

quant-ph↗

arXiv2013

SU(3) Quantum Interferometry with single-photon input pulses

We develop a framework for solving the action of a three-channel passive optical interferometer on single-photon pulse inputs to each channel using SU(3) group-theoretic methods, which can be readily generalized to higher-order photon-coincidence experiments. We show that features of the coincidence plots vs relative time delays of photons yield information about permanents, immanants, and determinants of the interferometer SU(3) matrix.

quant-ph↗

arXiv2013

Realizable receivers for discriminating arbitrary coherent-state waveforms and multi-copy quantum states near the quantum limit

Coherent states of light, and methods for distinguishing between them, are central to all applications of laser light. We obtain the ultimate quantum limit on the error probability exponent for discriminating among any M multimode coherent-state waveforms via the quantum Chernoff exponent in M-ary multi-copy state discrimination. A receiver, i.e., a concrete realization of a quantum measurement, called the Sequential Waveform Nulling (SWN) receiver, is proposed for discriminating an arbitrary coherent-state ensemble using only auxiliary coherent-state fields, beam splitters, and non-number-resolving single photon detectors. An explicit error probability analysis of the SWN receiver is used to show that it achieves the quantum limit on the error probability exponent, which is shown to be a factor of four greater than the error probability exponent of an ideal heterodyne-detection receiver on the same ensemble. We generalize the philosophy of the SWN receiver, which is itself adapted from some existing coherent-state receivers, and propose a receiver -- the Sequential Testing (ST) receiver-- for discriminating n copies of M pure quantum states from an arbitrary Hilbert space. The ST receiver is shown to achieve the quantum Chernoff exponent in the limit of a large number of copies, and is remarkable in requiring only local operations and classical communication (LOCC) to do so. In particular, it performs adaptive copy-by-copy binary projective measurements. Apart from being of fundamental interest, these results are relevant to communication, sensing, and imaging systems that use laser light and to photonic implementations of quantum information processing protocols in general.

quant-ph↗

arXiv2012

Measurement of two-mode squeezing with photon number resolving multi-pixel detectors

The measurement of the two-mode squeezed vacuum generated in an optical parametric amplifier (OPA) was performed with photon number resolving Multi-Pixel Photon Counters (MPPCs). Implementation of the MPPCs allows for the observation of noise reduction in a broad dynamic range of the OPA gain, which is inaccessible with standard single photon avalanche photodetectors.

quant-ph↗

arXiv2012

Explicit capacity-achieving receivers for optical communication and quantum reading

An important practical open question has been to design explicit, structured optical receivers that achieve the Holevo limit in the contexts of optical communication and "quantum reading." The Holevo limit is an achievable rate that is higher than the Shannon limit of any known optical receiver. We demonstrate how a sequential decoding approach can achieve the Holevo limit for both of these settings. A crucial part of our scheme for both settings is a non-destructive "vacuum-or-not" measurement that projects an n-symbol modulated codeword onto the n-fold vacuum state or its orthogonal complement, such that the post-measurement state is either the n-fold vacuum or has the vacuum removed from the support of the n symbols' joint quantum state. The sequential decoder for optical communication requires the additional ability to perform multimode optical phase-space displacements---realizable using a beamsplitter and a laser, while the sequential decoder for quantum reading also requires the ability to perform phase-shifting (realizable using a phase plate) and online squeezing (a phase-sensitive amplifier).

quant-ph↗