Kwek, Leong Chuan

We construct an entanglement witness for many-qubit systems, based on symmetric two-body correlations with two measurement settings. This witness is able to detect the entanglement of some Dicke states for any number of particles and such detection exhibits some robustness against white noise and thermal noise under the Lipkin-Meshkov-Glick Hamiltonian. In addition, it detects the entanglement of spin-squeezed states, with a detection strength that approaches the maximal value for sufficiently large numbers of particles. As spin-squeezed states can be experimentally generated, the properties of the witness with respect to these states may be amenable to experimental investigation. We show that while the witness is unable to detect Greenberger-Horne-Zeilinger (GHZ) states, it is instead able to detect superpositions of Dicke states with GHZ states.

Quantum synchronization has emerged as a crucial phenomenon in quantum nonlinear dynamics with potential applications in quantum information processing. Multiple measures for quantifying quantum synchronization exist. However, there is currently no widely agreed metric that is universally adopted. In this paper, we propose using classical and quantum Fisher information (FI) as alternative metrics to detect and measure quantum synchronization. We establish the connection between FI and quantum synchronization, demonstrating that both classical and quantum FI can be deployed as more general indicators of quantum phase synchronization in some regimes where all other existing measures fail to provide reliable results. We show advantages in FI-based measures, especially in 2-to-1 synchronization. Furthermore, we analyze the impact of noise on the synchronization measures, revealing the robustness and susceptibility of each method in the presence of dissipation and decoherence. Our results open up new avenues for understanding and exploiting quantum synchronization.

We study the state decay of two qubits interacting with a common harmonic oscillator reservoir. We find both a decoherence error and the error caused by the amplitude change of the superradiant state. We show that frequent π-phase pulses can eliminate both types of errors and therefore protect a two-qubit odd-parity state more effectively than the frequent measurement method. This shows that the methods using dynamical decoupling and the quantum Zeno effects actually can give rather different results when the operation frequency is finite.

Simulating quantum dynamics is expected to be performed more easily on a quantum computer than on a classical computer. However, the currently available quantum devices lack the capability to implement fault-tolerant quantum algorithms for quantum simulation. Hybrid classical quantum algorithms such as the variational quantum algorithms have been proposed to effectively use current term quantum devices. One promising approach to quantum simulation in the noisy intermediate-scale quantum (NISQ) era is the diagonalisation based approach, with some of the promising examples being the subspace variational quantum simulator (SVQS), variational fast forwarding (VFF), fixed-state variational fast forwarding (fs-VFF), and the variational Hamiltonian diagonalisation (VHD) algorithms. However, these algorithms require a feedback loop between the classical and quantum computers, which can be a crucial bottleneck in practical application. Here, we present the classical quantum fast forwarding (CQFF) as an alternative diagonalisation based algorithm for quantum simulation. CQFF shares some similarities with SVQS, VFF, fs-VFF and VHD but removes the need for a classical-quantum feedback loop and controlled multi-qubit unitaries. The CQFF algorithm does not suffer from the barren plateau problem and the accuracy can be systematically increased. Furthermore, if the Hamiltonian to be simulated is expressed as a linear combination of tensored-Pauli matrices, the CQFF algorithm reduces to the task of sampling some many-body quantum state in a set of Pauli-rotated bases, which is easy to do in the NISQ era. We run the CQFF algorithm on existing quantum processors and demonstrate the promise of the CQFF algorithm for current-term quantum hardware. We compare CQFF with Trotterization for a XY spin chain model Hamiltonian and find that the CQFF algorithm can simulate the dynamics more than 105 times longer than Trotterization on current-term quantum hardware. This provides a 104 times improvement over the previous record.

We construct a Bell inequality in terms of correlation functions for three qubits. The inequality is violated by quantum mechanics for all pure entangled states of three qubits. The strength of the violation for the GHZ state is stronger than the result given by Chen et al. [ Phys. Rev. Lett. 93, 140407 (2004)] , indicating that our three-qubit Bell inequality is more resistant to noise than those presented in the literature and hence is more useful in its practical applications.

Recent advances in silicon photonic chips have made huge progress in optical computing owing to their flexibility in the reconfiguration of various tasks. Its deployment of neural networks serves as an alternative for mitigating the rapidly increased demand for computing resources in electronic platforms. However, it remains a formidable challenge to train the online programmable optical neural networks efficiently, being restricted by the difficulty in obtaining gradient information on a physical device when executing a gradient descent algorithm. Here, we experimentally demonstrate an efficient, physics-agnostic, and closed-loop protocol for training optical neural networks on chip. A gradient-free algorithm, that is, the genetic algorithm, is adopted. The protocol is on-chip implementable, physical agnostic (no need to rely on characterization and offline modeling), and gradient-free. The protocol works for various types of chip structures and is especially helpful to those that cannot be analytically decomposed and characterized. We confirm its viability using several practical tasks, including the crossbar switch and the Iris classification. Finally, by comparing our physics-agonistic and gradient-free method to the off-chip and gradient-based training methods, we demonstrate the robustness of our system to perturbations such as imperfect phase implementation and photodetection noise. Optical processors with gradient-free genetic algorithms have broad application potentials in pattern recognition, reinforcement learning, quantum computing, and realistic applications (such as facial recognition, natural language processing, and autonomous vehicles).

We studied the use of quantum dots as a resource for teleportation and investigated how entanglement of the resource would affect the average fidelity of such a process. We then identified a suitable magnetic field, interdot distance, and the temperature to be used to achieve an average fidelity beyond the limit of the classical communication channel. We also explored the effects of decoherence on the teleportation process. We then investigated the state transfer or swapping between two quantum dots. We found that perfect quantum swap is possible in this system. A smaller magnetic field and interdot distance shortened the perfect state transfer time. Finally, we report on the performance of the system under different decoherence models.

Geometric and holonomic quantum computation utilizes intrinsic geometric properties of quantum-mechanical state spaces to realize quantum logic gates. Since both geometric phases and quantum holonomies are global quantities depending only on the evolution paths of quantum systems, quantum gates based on them possess built-in resilience to certain kinds of errors. This review provides an introduction to the topic as well as gives an overview of the theoretical and experimental progress for constructing geometric and holonomic quantum gates and how to combine them with other error-resistant techniques.

We study the multiparticle generalized GHZ states. It has been shown that for an odd number of qubits and for a specific range of parameters, they do not violate any Bell inequality for correlation functions. We show here both analytically and numerically that, nevertheless, such states violate local realism, once a more detailed analysis of the correlations is made than the one allowed by correlation functions. The results imply that multiparticle Clauser-Horne-type inequalities involving probabilities are stronger tools for analyzing violations of local realism in multiparticle systems than inequalities involving the correlation functions.

When prior partial information about a state to be cloned is available, it can be cloned with a fidelity higher than that of universal quantum cloning. We experimentally verify this intriguing relationship between the cloning fidelity and the prior information by reporting the first experimental optimal quantum state-dependent cloning, using nuclear magnetic resonance techniques. Our experiments may further have important implications into many quantum information processing protocols.