arXiv subjects

Shengjun Wu

Publications and source records attributed to Shengjun Wu.

At least 37 records · Page 2Linked to original sources

arXiv2023

Quantum-accelerated algorithms for generating random primitive polynomials over finite fields

Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient classical algorithm for generating random primitive polynomials over finite fields remains an ongoing challenge. In this paper, we show how to solve this problem efficiently through hybrid quantum-classical algorithms, and designs of the specific quantum circuits to implement them are also presented. Our research paves the way for the rapid and real-time generation of random primitive polynomials in diverse quantum communication and computation applications.

quant-ph↗

arXiv2023

General framework of quantum complementarity from a measurement-based perspective

One of the most remarkable features of quantum physics is that attributes of quantum objects, such as the wave-like and particle-like behaviors of single photons, can be complementary in the sense that they are equally real but cannot be observed simultaneously. Quantum measurements, serving as windows providing views into the abstract edifice of quantum theory, are basic tools for manifesting the intrinsic behaviors of quantum objects. However, quantitative formulation of complementarity that highlights its manifestations in sophisticated measurements remains elusive. Here we develop a general framework for demonstrating quantum complementarity in the form of information exclusion relations (IERs), which incorporates the wave-particle duality relations as particular examples. Moreover, we explore the applications of our theory in entanglement witnessing and elucidate that our IERs lead to an extended form of entropic uncertainty relations, providing intriguing insights into the connection between quantum complementarity and the preparation uncertainty.

quant-ph↗

arXiv2023

Implementing arbitrary quantum operations via quantum walks on a cycle graph

The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. The circuit model usually implements a desired unitary operation by a sequence of single-qubit and two-qubit unitary gates from a universal set. Although this certainly facilitates the experimentalists as they only need to prepare several different kinds of universal gates, the number of gates required to implement an arbitrary desired unitary operation is usually large. Hence the efficiency in terms of the circuit depth or running time is not guaranteed. Here we propose an alternative approach; we use a simple discrete-time quantum walk (DTQW) on a cycle graph to model an arbitrary unitary operation without the need to decompose it into a sequence of gates of smaller sizes. Our model is essentially a quantum neural network based on DTQW. Firstly, it is universal as we show that any unitary operation can be realized via an appropriate choice of coin operators. Secondly, our DTQW-based neural network can be updated efficiently via a learning algorithm, i.e., a modified stochastic gradient descent algorithm adapted to our network. By training this network, one can promisingly find approximations to arbitrary desired unitary operations. With an additional measurement on the output, the DTQW-based neural network can also implement general measurements described by positive-operator-valued measures (POVMs). We show its capacity in implementing arbitrary 2-outcome POVM measurements via numeric simulation. We further demonstrate that the network can be simplified and can overcome device noises during the training so that it becomes more friendly for laboratory implementations. Our work shows the capability of the DTQW-based neural network in quantum computation and its potential in laboratory implementations.

quant-ph↗

arXiv2023

Implementing arbitrary quantum operations via quantum walks on a cycle graph

The quantum circuit model is the most commonly used model for implementing quantum computers and quantum neural networks whose essential tasks are to realize certain unitary operations. Here we propose an alternative approach; we use a simple discrete-time quantum walk (DTQW) on a cycle graph to model an arbitrary unitary operation $U(N)$ without the need to decompose it into a sequence of gates of smaller sizes. Our model is essentially a quantum neural network based on DTQW. Firstly, it is universal as we show that any unitary operation $U(N)$ can be realized via an appropriate choice of coin operators. Secondly, our DTQW-based neural network can be updated efficiently via a learning algorithm, i.e., a modified stochastic gradient descent algorithm adapted to our network. By training this network, one can promisingly find approximations to arbitrary desired unitary operations. With an additional measurement on the output, the DTQW-based neural network can also implement general measurements described by positive-operator-valued measures (POVMs). We show its capacity in implementing arbitrary 2-outcome POVM measurements via numeric simulation. We further demonstrate that the network can be simplified and can overcome device noises during the training so that it becomes more friendly for laboratory implementations. Our work shows the capability of the DTQW-based neural network in quantum computation and its potential in laboratory implementations.

quant-ph↗

arXiv2023

State Classification via a Random-Walk-Based Quantum Neural Network

In quantum information technology, crucial information is regularly encoded in different quantum states. To extract information, the identification of one state from the others is inevitable. However, if the states are non-orthogonal and unknown, this task will become awesomely tricky, especially when our resources are also limited. Here, we introduce the quantum stochastic neural network (QSNN), and show its capability to accomplish the binary discrimination of quantum states. After a handful of optimizing iterations, the QSNN achieves a success probability close to the theoretical optimum, no matter whether the states are pure or mixed. Other than binary discrimination, the QSNN is also applied to classify an unknown set of states into two types: entangled ones and separable ones. After training with four samples, it can classify a number of states with acceptable accuracy. Our results suggest that the QSNN has the great potential to process unknown quantum states in quantum information.

quant-ph↗

arXiv2022

Implementation of quantum stochastic walks for function approximation, two-dimensional data classification, and sequence classification

We study a quantum stochastic neural network (QSNN) based on quantum stochastic walks on a graph, and use gradient descent to update the network parameters. We apply a toy model of QSNN with a few neurons to the problems of function approximation, two-dimensional data classification, and sequence classification. A simple QSNN with five neurons is trained to determine whether a sequence of words is a sentence or not, and we find that a QSNN can reduce the number of training steps. A QSNN with 11 neurons shows a quantum advantage in improving the accuracy of recognizing new types of inputs like verses. Moreover, with our toy model, we find the coherent QSNN is more robust against both label noise and device noise, compared with the decoherent QSNN. These results show that quantum stochastic walks may be a useful resource to implement a quantum neural network.

quant-ph↗

arXiv2022

Efficient Distinction between Quantum Direct and Common Causes and its Experimental Verification

Identifying the causal structures between two statistically correlated events has been widely investigated in many fields of science. While some of the well-studied classical methods are carefully generalized to quantum version of causal inference for certain cases, an effective and efficient way to detect the more general quantum causal structures is still lacking. Here, we introduce a quantity named `Causal Determinant' to efficiently identify the quantum causal structures between two quantum systems and experimentally verify the validity of the method. According to the causal determinant, the quantum direct cause imposed by an arbitrary unitary operator can be perfectly discriminated with the quantum common cause, in which the two quantum systems share a joint quantum state. In addition, the causal determinant has the capability to discriminate between more general causal structures and predict the range of their parameters. The ability to detect more general quantum causal structures of our method can shed new light on the field of quantum causal inference.

quant-ph↗

arXiv2021

Role of symmetry in quantum search via continuous-time quantum walk

For quantum search via the continuous-time quantum walk, the evolution of the whole system is usually limited in a small subspace. In this paper, we discuss how the symmetries of the graphs are related to the existence of such an invariant subspace, which also suggests a dimensionality reduction method based on group representation theory. We observe that in the one-dimensional subspace spanned by each desired basis state which assembles the identically evolving original basis states, we always get a trivial representation of the symmetry group. So we could find the desired basis by exploiting the projection operator of the trivial representation. Besides being technical guidance in this type of problem, this discussion also suggests that all the symmetries are used up in the invariant subspace and the asymmetric part of the Hamiltonian is very important for the purpose of quantum search.

quant-ph↗

arXiv2021

Entropic uncertainty relations for SIC-POVMs and MUMs

We construct inequalities between Rényi entropy and the indexes of coincidence of probability distributions, based on which we obtain improved state-dependent entropic uncertainty relations for general symmetric informationally complete positive operator-valued measures (SIC-POVM) and mutually unbiased measurements (MUM) on finite dimensional systems. We show that our uncertainty relations for general SIC-POVMs and MUMs can be tight for sufficiently mixed states, and moreover, comparisons to the numerically optimal results are made via information diagrams.

quant-ph↗

arXiv2018

Controlled quantum search on structured databases

We present quantum algorithms to search for marked vertices in structured databases with low connectivity. Adopting a multi-stage search process, we achieve a success probability close to $100\%$ on Cayley trees with large branching factors. We find that the number of stages required is given by the height of the Cayley tree. At each stage, the jumping rate should be chosen as different values. The dominant term of the runtime in the search process is proportional to $N^{(2r-1)/2r}$ for the Cayley tree of height $r$ with $N$ vertices. We further find that one can control the number of stages by adjusting the weight of the edges in the graphs. The multi-stage search process can be merged into a single stage, and then an optimal runtime proportional to $\sqrt{N}$ is achieved, yielding a substantial speedup. The search process is quite robust under various kinds of small perturbations.

quant-ph↗

arXiv2017

Uncertainty conservation relations: theory and experiment

As a very fundamental principle in quantum physics, uncertainty principle has been studied intensively via various uncertainty inequalities. Based on the information measure introduced by Brukner and Zeilinger in [Phys. Rev. Lett. 83, 3354 (1999)], we derive an uncertainty conservation relation in the presence of quantum memory. We show that the sum of measurement uncertainties over a complete set of mutually unbiased bases on a subsystem is equal to a total uncertainty determined by the initial bipartite state. Hence for a given bipartite system the uncertainty is conserved and the uncertainty relation is given by an equality. When the total uncertainty vanishes, all the uncertainties related to every mutually unbiased base measurement are zero, which is substantially different from the uncertainty relation given by Berta et. al. [Nat. Phys. 6, 659 (2010)] where an uncertainty inequality is presented. By directly measuring the corresponding quantum mechanical observables on a 5-qubit spin system, we experimentally verify the uncertainty conservation relation in the presence of quantum memory without quantum state tomography.

quant-ph↗

arXiv2016

Direct state reconstruction with coupling-deformed pointer observables

Direct state tomography (DST) using weak measurements has received wide attention. Based on the concept of coupling-deformed pointer observables presented by Zhang \emph{et al}.[Phys. Rev. A \textbf{93}, 032128 (2016)], a modified direct state tomography (MDST) is proposed, examined, and compared with other typical state tomography schemes. MDST has exact validity for measurements of any strength. We identify the strength needed to attain the highest efficiency level of MDST by using statistical theory. MDST is much more efficient than DST in the sense that far fewer samples are needed to reach DST's level of reconstruction accuracy. Moreover, MDST has no inherent bias when compared to DST.

quant-ph↗

arXiv2016

Ground-state cooling of dispersively coupled optomechanical system in unresolved sideband regime via dissipatively coupled oscillator

In the optomechanical cooling of a dispersively coupled oscillator, it is only possible to reach the oscillator ground state in the resolved sideband regime, where the cavity-mode line width is smaller than the resonant frequency of the mechanical oscillator being cooled. In this paper, we show that the dispersively coupled system can be cooled to the ground state in the unresolved sideband regime using an ancillary oscillator, which is coupled to the same optical mode via dissipative interaction. The ancillary oscillator has a resonant frequency close to that of the target oscillator; thus, the ancillary oscillator is also in the unresolved sideband regime. We require only a single blue-detuned laser mode to drive the cavity.

quant-ph↗

arXiv2016

Coupling-Deformed Pointer Observables and Weak Values

While the novel applications of weak values have recently attracted wide attention, weak measurement, the usual way to extract weak values, suffers from risky approximations and severe quantum noises. In this paper, we show that the weak-value information can be obtained exactly in strong measurement with postselections, via measuring the coupling-deformed pointer observables, i.e., the observables selected according to the coupling strength. With this approach, we keep all the advantages claimed by weak-measurement schemes and at the same time solve some widely criticized problems thereof, such as the questionable universality, systematical bias, and drastic inefficiency.

quant-ph↗

arXiv2015

Localization in Quantum Walks on a Honeycomb Network

We systematically study the localization effect in discrete-time quantum walks on a honeycomb network and establish the mathematical framework. We focus on the Grover walk first and rigorously derive the limit form of the walker's state, showing it has a certain probability to be localized at the starting position. The relationship between localization and the initial coin state is concisely represented by a linear map. We also define and calculate the average probability of localization by generating random initial states. Further, coin operators varying with positions are considered and the sufficient condition for localization is discussed. We also similarly analyze another four-state Grover walk. Theoretical predictions are all in accord with numerical simulation results. Finally, our results are compared with previous works to demonstrate the unusual trapping effect of quantum walks on a honeycomb network, as well as the advantages of our method.

quant-ph↗

arXiv2015

State-Independent Error-Disturbance Tradeoff For Measurement Operators

In general, classical measurement statistics of a quantum measurement is disturbed by performing an additional incompatible quantum measurement beforehand. Using this observation, we introduce a state-independent definition of disturbance by relating it to the distinguishability problem between two classical statistical distributions --- one resulting from a single quantum measurement and the other from a succession of two quantum measurements. Interestingly, we find an error-disturbance trade-off relation for any measurements in two-dimensional Hilbert space and for measurements with mutually unbiased bases in any finite-dimensional Hilbert space. This relation shows that error should be reduced to zero in order to minimize the sum of error and disturbance. We conjecture that a similar trade-off relation can be generalized to any measurements in an arbitrary finite-dimensional Hilbert space.

quant-ph↗

arXiv2015

Entangled bases with fixed Schmidt number

An entangled basis with fixed Schmidt number $k$ (EBk) is a set of orthonormal basis states with the same Schmidt number $k$ in a product Hilbert space $\mathbb{C}^d\otimes\mathbb{C}^{d'}$. It is a generalization of both the product basis and the maximally entangled basis. We show here that, for any $k\leq\min\{d,d'\}$, EBk exists in $\mathbb{C}^d\otimes\mathbb{C}^{d'}$ for any $d$ and $d'$. Consequently, general methods of constructing SEBk (EBk with the same Schmidt coefficients) and EBk (but not SEBk) are proposed. Moreover, we extend the concept of EBk to multipartite case and find out that the multipartite EBk can be constructed similarly.

quant-ph↗

arXiv2014

Unextendible entangled bases with fixed Schmidt number

The unextendible product basis (UPB) is generalized to the unextendible entangled basis with any arbitrarily given Schmidt number $k$ (UEBk) for any bipartite system $\mathbb{C}^d\otimes\mathbb{C}^{d'}$ ($2\leq k<d\leq d'$), which can also be regarded as a generalization of the unextendible maximally entangled basis (UMEB). A general way of constructing such a basis with arbitrary $d$ and $d'$ is proposed. Consequently, it is shown that there are at least $k-r$ (here $r=d$ mod $k$, or $r=d'$ mod $k$) sets of UEBk when $d$ or $d'$ is not the multiple of $k$, while there are at least $2(k-1)$ sets of UEBk when both $d$ and $d'$ are the multiples of $k$.

quant-ph↗