arXiv subjects

Xiaogang Qiang

Publications and source records attributed to Xiaogang Qiang.

16 recordsLinked to original sources

arXiv2026

High-efficiency Weak-trace-free Counterfactual Communication via Quantum Zeno Effect

The quantum Zeno effect, which inhibits quantum state evolution via repeated weak measurements, significantly enhances the efficiency of interaction-free measurement (IFM). This fundamental mechanism facilitates high-efficiency counterfactual quantum communication, enabling information delivery without particle transmission through the channel. However, the transmission time of the counterfactual communication requires minutes for bit and suffers the bit error when transmitting an image. Applying the quantum Zeno effect, we experimentally demonstrate high-efficiency weak-trace-free counterfactual communication on a quantum photonic chip, achieving a transmission probability of 74.2 $\pm$ 1.6\% for bit 0 and 85.1 $\pm$ 1.3\% for bit 1. Furthermore, we successfully transmit our group's logo -- Quanta -- through counterfactual communication, and reduce the time cost from minutes to seconds for bit, with zero bit errors after information processing. Our study provides a promising approach for secure and efficient communication using integrated silicon quantum photonics.

quant-ph↗

arXiv2025

Correcting for finite statistics effects in a quantum steering experiment

Verifying entanglement between parties is essential for creating secure quantum communication. However, finite statistics can lead to false positive outcomes in any tests for entanglement. Here, we introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions, caused by statistical fluctuations and experimental imperfections. We use semidefinite programming to identify the optimal inequality, for our experimental probability distribution, without resource-intensive tomography. Our protocol is numerically and experimentally analysed in the context of random, misaligned measurements, correcting apparent signaling where necessary. Our results show a significantly higher probability of violation than existing state-of-the-art inequalities. This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.

quant-ph↗

arXiv2024

Review on Quantum Walk Computing: Theory, Implementation, and Application

Classical random walk formalism shows a significant role across a wide range of applications. As its quantum counterpart, the quantum walk is proposed as an important theoretical model for quantum computing. By exploiting the quantum effects such as superposition, interference and entanglement, quantum walks and their variety have been extensively studied for achieving beyond classical computing power, and they have been broadly used in designing quantum algorithms in fields ranging from algebraic and optimization problems, graph and network analysis, to quantum Hamiltonian and biochemical process simulations, and even further quantum walk models have proven their capabilities for universal quantum computation. Compared to the conventional quantum circuit models, quantum walks show a feasible path for implementing application-specific quantum computing in particularly the noisy intermediate-scale quantum era. Recently remarkable progress has been achieved in implementing a wide variety of quantum walks and quantum walk applications, demonstrating the great potential of quantum walks. In this review, we provide a thorough summary of quantum walks and quantum walk computing, including aspects of quantum walk theories and characteristics, advances in their physical implementations and the flourishingly developed quantum walk computing applications. We also discuss the challenges facing quantum walk computing, toward realizing a practical quantum computer in the near future.

quant-ph↗

arXiv2023

Fidelity estimation of quantum states on a silicon photonic chip

As a measure of the 'closeness' of two quantum states, fidelity plays a fundamental role in quantum information theory. Fidelity estimation protocols try to strike a balance between information gleaned from an experiment, and the efficiency of its implementation, in terms of the number of states consumed by the protocol. Here we adapt a previously reported optimal state verification protocol (Phys. Rev. Lett. 120, 170502, 2018) for fidelity estimation of two-qubit states. We demonstrate the protocol experimentally using a fully-programmable silicon photonic two-qubit chip. Our protocol outputs significantly smaller error bars of its point estimate in comparison with another widely-used estimation protocol, showing a clear step forward in the ability to estimate the fidelity of quantum states produced by a practical device.

quant-ph↗

arXiv2022

Large-scale full-programmable quantum walk and its applications

With photonics, the quantum computational advantage has been demonstrated on the task of boson sampling. Next, developing quantum-enhanced approaches for practical problems becomes one of the top priorities for photonic systems. Quantum walks are powerful kernels for developing new and useful quantum algorithms. Here we realize large-scale quantum walks using a fully programmable photonic quantum computing system. The system integrates a silicon quantum photonic chip, enabling the simulation of quantum walk dynamics on graphs with up to 400 vertices and possessing full programmability over quantum walk parameters, including the particle property, initial state, graph structure, and evolution time. In the 400-dimensional Hilbert space, the average fidelity of random entangled quantum states after the whole on-chip circuit evolution reaches as high as 94.29$\pm$1.28$\%$. With the system, we demonstrated exponentially faster hitting and quadratically faster mixing performance of quantum walks over classical random walks, achieving more than two orders of magnitude of enhancement in the experimental hitting efficiency and almost half of the reduction in the experimental evolution time for mixing. We utilize the system to implement a series of quantum applications, including measuring the centrality of scale-free networks, searching targets on Erdös-Rényi networks, distinguishing non-isomorphic graph pairs, and simulating the topological phase of higher-order topological insulators. Our work shows one feasible path for quantum photonics to address applications of practical interests in the near future.

quant-ph↗

arXiv2022

Silicon photonic devices for scalable quantum information applications

With high integration density and excellent optical properties, silicon photonics is becoming a promising platform for complete integration and large-scale optical quantum information processing. Scalable quantum information applications need photon generation and detection to be integrated on the same chip, and we have seen that various devices on the silicon photonic chip have been developed for this goal. This paper reviews the relevant research results and state-of-the-art technologies on the silicon photonic chip for scalable quantum applications. Despite the shortcomings, properties of some components have already met the requirements for further expansion. Furthermore, we point out the challenges ahead and further research directions for on-chip scalable quantum information applications.

quant-ph↗

arXiv2021

General Quantum Bernoulli Factory: Framework Analysis and Experiments

The unremitting pursuit for quantum advantages gives rise to the discovery of a quantum-enhanced randomness processing named quantum Bernoulli factory (QBF). This quantum enhanced process can show its priority over the corresponding classical process through readily available experimental resources, thus in the near term it may be capable of accelerating the applications of classical Bernoulli factories, such as the widely used sampling algorithms. In this work, we provide the framework analysis of the QBF. We thoroughly analyze the quantum state evolution in this process, discovering the field structure of the constructible quantum states. Our framework analysis shows that naturally, the previous works can be described as specific instances of this framework. Then, as a proof of principle, we experimentally demonstrate this framework via an entangled two-photon source along with a reconfigurable photonic logic, and show the advantages of the QBF over the classical model through a classically infeasible instance. These results may stimulate the discovery of advantages of the quantum randomness processing in a wider range of tasks, as well as its potential applications.

quant-ph↗

arXiv2021

A Steering Paradox for Einstein-Podolsky-Rosen Argument and its Extended Inequality

The Einstein-Podolsky-Rosen (EPR) paradox is one of the milestones in quantum foundations, arising from the lack of local realistic description of quantum mechanics. The EPR paradox has stimulated an important concept of "quantum nonlocality", which manifests itself by three different types: quantum entanglement, quantum steering, and Bell nonlocality. Although Bell nonlocality is more often used to show the "quantum nonlocality", the original EPR paradox is essentially a steering paradox. In this work, we formulate the original EPR steering paradox into a contradiction equality,thus making it amenable to an experimental verification. We perform an experimental test of the steering paradox in a two-qubit scenario. Furthermore, by starting from the steering paradox, we generate a generalized linear steering inequality and transform this inequality into a mathematically equivalent form, which is more friendly for experimental implementation, i.e., one may only measure the observables in $x$-, $y$-, or $z$-axis of the Bloch sphere, rather than other arbitrary directions. We also perform experiments to demonstrate this scheme. Within the experimental errors, the experimental results coincide with the theoretical predictions. Our results deepen the understanding of quantum foundations and provide an efficient way to detect the steerability of quantum states.

quant-ph↗

arXiv2020

Hacking single-photon avalanche detector in quantum key distribution via pulse illumination

Quantum key distribution (QKD) has been proved to be information-theoretically secure in theory. Unfortunately, the imperfect devices in practice compromise its security. Thus, to improve the security property of practical QKD systems, a commonly used method is to patch the loopholes in the existing QKD systems. However, in this work, we show an adversary's capability of exploiting the imperfection of the patch itself to bypass the patch. Specifically, we experimentally demonstrate that, in the detector under test, the patch of photocurrent monitor against the detector blinding attack can be defeated by the pulse illumination attack proposed in this paper. We also analyze the secret key rate under the pulse illumination attack, which theoretically confirmed that Eve can conduct the attack to learn the secret key. This work indicates the importance of inspecting the security loopholes in a detection unit to further understand their impacts on a QKD system. The method of pulse illumination attack can be a general testing item in the security evaluation standard of QKD.

quant-ph↗

arXiv2020

Sample caching Markov chain Monte Carlo approach to boson sampling simulation

Boson sampling is a promising candidate for quantum supremacy. It requires to sample from a complicated distribution, and is trusted to be intractable on classical computers. Among the various classical sampling methods, the Markov chain Monte Carlo method is an important approach to the simulation and validation of boson sampling. This method however suffers from the severe sample loss issue caused by the autocorrelation of the sample sequence. Addressing this, we propose the sample caching Markov chain Monte Carlo method that eliminates the correlations among the samples, and prevents the sample loss at the meantime, allowing more efficient simulation of boson sampling. Moreover, our method can be used as a general sampling framework that can benefit a wide range of sampling tasks, and is particularly suitable for applications where a large number of samples are taken.

quant-ph↗

arXiv2020

Variational Quantum Circuits for Quantum State Tomography

Quantum state tomography is a key process in most quantum experiments. In this work, we employ quantum machine learning for state tomography. Given an unknown quantum state, it can be learned by maximizing the fidelity between the output of a variational quantum circuit and this state. The number of parameters of the variational quantum circuit grows linearly with the number of qubits and the circuit depth, so that only polynomial measurements are required, even for highly-entangled states. After that, a subsequent classical circuit simulator is used to transform the information of the target quantum state from the variational quantum circuit into a familiar format. We demonstrate our method by performing numerical simulations for the tomography of the ground state of a one-dimensional quantum spin chain, using a variational quantum circuit simulator. Our method is suitable for near-term quantum computing platforms, and could be used for relatively large-scale quantum state tomography for experimentally relevant quantum states.

quant-ph↗

arXiv2019

General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier

Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Random quantum circuits are outstanding candidates to demonstrate quantum supremacy, which could be implemented on a quantum device that supports nearest-neighbour gate operations on a two-dimensional configuration. Here we show that using the Projected Entangled-Pair States algorithm, a tool to study two-dimensional strongly interacting many-body quantum systems, we can realize an effective general-purpose simulator of quantum algorithms. This technique allows to quantify precisely the memory usage and the time requirements of random quantum circuits, thus showing the frontier of quantum supremacy. With this approach we can compute the full wave-function of the system, from which single amplitudes can be sampled with unit fidelity. Applying this general quantum circuit simulator we measured amplitudes for a $7\times 7$ lattice of qubits with depth $1+40+1$ and double-precision numbers in 31 minutes using less than $93$ TB memory on the Tianhe-2 supercomputer.

quant-ph↗

arXiv2018

Large-scale silicon quantum photonics implementing arbitrary two-qubit processing

Integrated optics is an engineering solution proposed for exquisite control of photonic quantum information. Here we use silicon photonics and the linear combination of quantum operators scheme to realise a fully programmable two-qubit quantum processor. The device is fabricated with readily available CMOS based processing and comprises four nonlinear photon-sources, four filters, eighty-two beam splitters and fifty-eight individually addressable phase shifters. To demonstrate performance, we programmed the device to implement ninety-eight various two-qubit unitary operations (with average quantum process fidelity of 93.2$\pm$4.5%), a two-qubit quantum approximate optimization algorithm and efficient simulation of Szegedy directed quantum walks. This fosters further use of the linear combination architecture with silicon photonics for future photonic quantum processors.

quant-ph↗

arXiv2017

Quantum processing by remote quantum control

Client-server models enable computations to be hosted remotely on quantum servers. We present a novel protocol for realizing this task, with practical advantages when using technology feasible in the near term. Client tasks are realized as linear combinations of operations implemented by the server, where the linear coefficients are hidden from the server. We report on an experimental demonstration of our protocol using linear optics, which realizes linear combination of two single-qubit operations by a remote single-qubit control. In addition, we explain when our protocol can remain efficient for larger computations, as well as some ways in which privacy can be maintained using our protocol.

quant-ph↗

arXiv2016

60dB high-extinction auto-configured Mach--Zehnder interferometer

Imperfections in integrated photonics manufacturing have a detrimental effect on the maximal achievable visibility in interferometric architectures. These limits have profound implications for further photonics technological developments and in particular for quantum photonics technologies. Active optimisation approaches, together with reconfigurable photonics, have been proposed as a solution to overcome this. In this paper, we demonstrate an ultra-high (>60 dB) extinction ratio in a silicon photonic device consisting of cascaded Mach-Zehnder interferometers, in which additional interferometers function as variable beamsplitters. The imperfections of fabricated beamsplitters are compensated using an automated progressive optimization algorithm with no requirement for pre-calibration. This work shows the possibility of integrating and accurately controlling linear-optical components for large-scale quantum information processing and other applications.

physics.optics↗

arXiv2015

Efficient Quantum Walk on a Quantum Processor

The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms. In this paper, we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks which could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle we have experimentally implemented the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.

quant-ph↗