Search

Multipartite high-dimensional entanglement presents different physics from multipartite two-dimensional entanglement. However, how to prepare multipartite high-dimensional entanglement is still a challenge with linear optics. In this paper, a multiphoton GHZ state with arbitrary dimensions preparation protocol is proposed in optical systems. In this protocol, we use auxiliary entanglements to realize a high-dimensional entanglement gate, so that high-dimensional entangled pairs can be connected into a multipartite high-dimensional GHZ state. Specifically, we give an example of using photons' path degree of freedom to prepare a 4-particle 3-dimensional GHZ state. Our method can be extended to other degrees of freedom and can generate arbitrary GHZ entanglement in any dimension., Comment: 10 pages, 3 figures

Quantum secret sharing (QSS) is one of the basic communication primitives in future quantum networks which addresses part of the basic cryptographic tasks of multiparty communication and computation. Nevertheless, it is a challenge to provide a practical QSS protocol with security against general attacks. A QSS protocol that balances security and practicality is still lacking. Here, we propose a QSS protocol with simple phase encoding of coherent states among three parties. Removing the requirement of impractical entangled resources and the need for phase randomization, our protocol can be implemented with accessible technology. We provide the finite-key analysis against coherent attacks and implement a proof-of-principle experiment to demonstrate our scheme's feasibility. Our scheme achieves a key rate of 85.3 bps under a 35 dB channel loss. Combined with security against general attacks and accessible technology, our protocol is a promising candidate for practical multiparty quantum communication networks., Comment: 10 pages, 5 figures, 3 tables, accepted by Sci. China-Phys. Mech. Astron

Quantum key distribution provides a promising solution for sharing secure keys between two distant parties with unconditional security. Nevertheless, quantum key distribution is still severely threatened by the imperfections of devices. In particular, the classical pulse correlation threatens security when sending decoy states. To address this problem and simplify experimental requirements, we propose a phase-matching quantum key distribution protocol without intensity modulation. Instead of using decoy states, we propose a novel method to estimate the theoretical upper bound on the phase error rate contributed by even-photon-number components. Simulation results show that the transmission distance of our protocol could reach 305 km in telecommunication fiber. Furthermore, we perform a proof-of-principle experiment to demonstrate the feasibility of our protocol, and the key rate reaches 22.5 bps under a 45 dB channel loss. Addressing the security loophole of pulse intensity correlation and replacing continuous random phase with 6 or 8 slices random phase, our protocol provides a promising solution for constructing quantum networks., Comment: Comments are welcome! 12 pages, 6 figures

The spectrum of laser-plasma-generated X-rays is very important as it can characterize electron dynamics and also be useful for applications, and nowadays with the forthcoming high-repetition-rate laser-plasma experiments, there is a raising demand for online diagnosis for the X-ray spectrum. In this paper, scintillators and silicon PIN diodes are used to build a wideband online filter stack spectrometer. The genetic algorithm is used to optimize the arrangements of the X-ray sensors and filters by minimizing the condition number of the response matrix, thus the unfolding error can be significantly decreased according to the numerical experiments. The detector responses are quantitatively calibrated by irradiating the scintillator and PIN diode using different nuclides and comparing the measured gamma-ray peaks. Finally, a 15-channel spectrometer prototype has been implemented. The X-ray detector, front-end electronics, and back-end electronics are integrated into the prototype, and the prototype can determine the spectrum with 1 kHz repetition rates.

Quantum network applications like distributed quantum computing and quantum secret sharing present a promising future network equipped with quantum resources. Entanglement generation and distribution over long distances is critical and unavoidable to utilize quantum technology in a fully-connected network. The distribution of bipartite entanglement over long distances has seen some progresses, while the distribution of multipartite entanglement over long distances remains unsolved. Here we report a two-dimensional quantum repeater protocol for the generation of multipartite entanglement over long distances with all-photonic framework to fill this gap. The yield of the proposed protocol shows long transmission distance under various numbers of network users. With the improved efficiency and flexibility of extending the number of users, we anticipate that our protocol can work as a significant building block for quantum networks in the future.

Quantum conference key agreement is an important cryptographic primitive for future quantum network. Realizing this primitive requires high-brightness and robust multiphoton entanglement sources, which is challenging in experiment and unpractical in application because of limited transmission distance caused by channel loss. Here we report a measurement-device-independent quantum conference key agreement protocol with enhanced transmission efficiency over lossy channel. With spatial multiplexing nature and adaptive operation, our protocol can break key rate bounds on quantum communication over quantum network without quantum memory. Compared with previous work, our protocol shows superiority in key rate and transmission distance within the state-of-the-art technology. Furthermore, we analyse the security of our protocol in the composable framework and evaluate its performance in the finite-size regime to show practicality. Based on our results, we anticipate that our protocol will play an indispensable role in constructing multipartite quantum network., Comment: 9 pages, 4 figures, 1 table

Currently most progresses on quantum secret sharing suffer from rate-distance bound, and thus the key rates are limited. In addition to the limited key rate, the technical difficulty and the corresponding cost together prevent large-scale deployment. Furthermore, the performance of most existing protocols is analyzed in the asymptotic regime without considering participant attacks. Here we report a measurement-device-independent quantum secret sharing protocol with improved key rate and transmission distance. Based on spatial multiplexing, our protocol shows it can break rate-distance bounds over network under at least ten communication parties. Compared with other protocols, our work improves the secret key rate by more than two orders of magnitude and has a longer transmission distance. We analyze the security of our protocol in the composable framework considering participant attacks and evaluate its performance in the finite-size regime. In addition, we investigate applying our protocol to digital signatures where the signature rate is improved more than $10^7$ times compared with existing protocols. We anticipate that our quantum secret sharing protocol will provide a solid future for multiparty applications on the quantum network., Comment: 14 pages, 6 figs, arXiv admin note: text overlap with arXiv:2212.05226

The strongly-constrained physics-informed neural network (SCPINN) is proposed by adding the information of compound derivative embedded into the soft-constraint of physics-informed neural network(PINN). It is used to predict nonlinear dynamics and the formation process of bright and dark picosecond optical solitons, and femtosecond soliton molecule in the single-mode fiber, and reveal the variation of physical quantities including the energy, amplitude, spectrum and phase of pulses during the soliton transmission. The adaptive weight is introduced to accelerate the convergence of loss function in this new neural network. Compared with the PINN, the accuracy of SCPINN in predicting soliton dynamics is improved by 5-11 times. Therefore, the SCPINN is a forward-looking method to study the modeling and analysis of soliton dynamics in the fiber.

This paper highlights the design philosophy and architecture of the Health Guardian, a platform developed by the IBM Digital Health team to accelerate discoveries of new digital biomarkers and development of digital health technologies. The Health Guardian allows for rapid translation of artificial intelligence (AI) research into cloud-based microservices that can be tested with data from clinical cohorts to understand disease and enable early prevention. The platform can be connected to mobile applications, wearables, or Internet of things (IoT) devices to collect health-related data into a secure database. When the analytics are created, the researchers can containerize and deploy their code on the cloud using pre-defined templates, and validate the models using the data collected from one or more sensing devices. The Health Guardian platform currently supports time-series, text, audio, and video inputs with 70+ analytic capabilities and is used for non-commercial scientific research. We provide an example of the Alzheimer's disease (AD) assessment microservice which uses AI methods to extract linguistic features from audio recordings to evaluate an individual's mini-mental state, the likelihood of having AD, and to predict the onset of AD before turning the age of 85. Today, IBM research teams across the globe use the Health Guardian internally as a test bed for early-stage research ideas, and externally with collaborators to support and enhance AI model development and clinical study efforts., Comment: 6 pages, 3 figures, https://ieeexplore.ieee.org/document/9861047

The interest in refractory materials is increasing rapidly in recent decades due to the development of hypersonic vehicles. However, which substance has the highest melting point keeps a secret, since precise measurements in extreme condition are overwhelmingly difficult. In the present work, an accurate deep potential model of Hf-Ta-C-N system was firstly trained, and then applied to search for the highest melting point material by using molecular dynamics simulation and Bayesian global optimization. The predicted melting points agree well with experiments, and confirm that the carbon site vacancy can enhance melting points of rock-salt structure carbides. Solid solution with N is verified as another new and more effective melting point enhancing approach for HfC, while the conventional routing of solid solution with Ta (e.g. HfTa4C5) is not suggested to result in a maximum melting point. The highest melting point (~ 4236 K) is achieved with composition of HfC0.638N0.271, which is ~ 80 K higher than the highest value in Hf-C binary system. The dominating mechanism of N addition is believed to be the instable C-N and N-N bonds in liquid phase, which reduces the liquid phase entropy and renders the liquid phase less stable. The improved melting point and fewer gas generation during oxidation by addition of N provides new routing to modify the thermal protection materials for hypersonic vehicles.

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., Comment: 13 pages (including 7 pages in the main text), 6 figures

We derive the spin Boltzmann equations for spin-1/2 fermions in a non-relativistic model with four-fermion contact interaction which conserves spin degrees of freedom. A great advantage of the model is that the spin matrix elements in collision terms can be completely worked out and be put into such a compact form that one can clearly see how spins are coupled in particle scatterings. A semi-classical expansion in the Planck constant has been made and the on-shell part of the spin Boltzmann equation up to the next-to-leading order is derived. At the leading order the equilibrium spin distribution can be obtained from the vanishing of the collision term for the spin density. The spin chemical potential emerges as a natural consequence of spin conservation. The off-shell part of the spin Boltzmann equation is also discussed. The work can be extended to more sophisticated interaction such as nuclear force in order to apply to spin polarization phenomena in heavy-ion collisions at low energies., Comment: RevTex 4, 15 pages, 1 figure

Named entity recognition (NER) task aims at identifying entities from a piece of text that belong to predefined semantic types such as person, location, organization, etc. The state-of-the-art solutions for flat entities NER commonly suffer from capturing the fine-grained semantic information in underlying texts. The existing span-based approaches overcome this limitation, but the computation time is still a concern. In this work, we propose a novel span-based NER framework, namely Global Pointer (GP), that leverages the relative positions through a multiplicative attention mechanism. The ultimate goal is to enable a global view that considers the beginning and the end positions to predict the entity. To this end, we design two modules to identify the head and the tail of a given entity to enable the inconsistency between the training and inference processes. Moreover, we introduce a novel classification loss function to address the imbalance label problem. In terms of parameters, we introduce a simple but effective approximate method to reduce the training parameters. We extensively evaluate GP on various benchmark datasets. Our extensive experiments demonstrate that GP can outperform the existing solution. Moreover, the experimental results show the efficacy of the introduced loss function compared to softmax and entropy alternatives.

In the era of deep learning, loss functions determine the range of tasks available to models and algorithms. To support the application of deep learning in multi-label classification (MLC) tasks, we propose the ZLPR (zero-bounded log-sum-exp \& pairwise rank-based) loss in this paper. Compared to other rank-based losses for MLC, ZLPR can handel problems that the number of target labels is uncertain, which, in this point of view, makes it equally capable with the other two strategies often used in MLC, namely the binary relevance (BR) and the label powerset (LP). Additionally, ZLPR takes the corelation between labels into consideration, which makes it more comprehensive than the BR methods. In terms of computational complexity, ZLPR can compete with the BR methods because its prediction is also label-independent, which makes it take less time and memory than the LP methods. Our experiments demonstrate the effectiveness of ZLPR on multiple benchmark datasets and multiple evaluation metrics. Moreover, we propose the soft version and the corresponding KL-divergency calculation method of ZLPR, which makes it possible to apply some regularization tricks such as label smoothing to enhance the generalization of models.

We revisit Minkowski's lost legacy on relativistic electromagnetism in order to resolve long-standing puzzles over the charge distribution of relativistic systems like hadrons. Hadrons are unique relativistic electromagnetic systems characterized by their comparable size and Compton wavelength $r_h \sim \lambda_C$. As such, it was recently realized that the traditional Sachs definition of the charge distribution based on a non-relativistic formula is invalid. We explain that this is the same problem pursued by Lorentz, Einstein and others, on the electromagnetism of a moving body. We show how various charge distributions proposed in hadronic physics naturally emerge as the multipole moment densities in the macroscopic theory of relativistic electromagnetism., Comment: 7 pages, 2 figures; published on Physics Letters B

Recently, a type of Hall effect due to an unusual layer-locked Berry curvature called the layer Hall effect (LHE) has been reported in the even-layered two-dimensional antiferromagnetic (AFM) MnBi2Te4 [A. Gao et.al, Nature 595, 521 (2021)]. In this work, we report that the quantization of LHE, which we call the quantum anomalous layer Hall effect (QALHE), can be realized in MnBi2Te4. The QALHE originates from kicking a layer-locked Berry-curvature monopole out of the Fermi sea by a vertielectric cal field. Remarkably, we demonstrate that the electric-field reversal can switch the sign of the quantized Hall conductance of QALHE in the even-layered AFM phase. The QALHE can also be realized in the ferromagnetic phase. These results provide a promising way toward the electric engineering of the Berry curvature monopoles and quantized-layered transport in topological magnets., Comment: 6 pages, 4 figures (+ supplementary materials 6 pages, 4 figures)

Byzantine agreement, the underlying core of blockchain, aims to make every node in a decentralized network reach consensus. Classical Byzantine agreements unavoidably face two major problems. One is $1/3$ fault-tolerance bound, which means that the system to tolerate $f$ malicious players requires at least $3f+1$ players. The other is the security loopholes from its classical cryptography methods. Here, we propose a Byzantine agreement framework with unconditional security to break this bound with nearly $1/2$ fault tolerance due to multiparty correlation provided by quantum digital signatures. \textcolor{black}{It is intriguing that quantum entanglement is not necessary to break the $1/3$ fault-tolerance bound, and we show that weaker correlation, such as asymmetric relationship of quantum digital signature, can also work.} Our work strictly obeys two Byzantine conditions and can be extended to any number of players without requirements for multiparticle entanglement. We experimentally demonstrate three-party and five-party consensus for a digital ledger. Our work indicates the quantum advantage in terms of consensus problems and suggests an important avenue for quantum blockchain and quantum consensus networks., Comment: 21 pages, 7 figures. All comments are welcome!

Randomness, mainly in the form of random numbers, is the fundamental prerequisite for the security of many cryptographic tasks. Quantum randomness can be extracted even if adversaries are fully aware of the protocol and even control the randomness source. However, an adversary can further manipulate the randomness via tailored detector blinding attacks, which are hacking attacks suffered by protocols with trusted detectors. Here, by treating no-click events as valid events, we propose a quantum random number generation protocol that can simultaneously address source vulnerability and ferocious tailored detector blinding attacks. The method can be extended to high-dimensional random number generation. We experimentally demonstrate the ability of our protocol to generate random numbers for two-dimensional measurement with a generation speed of 0.1 bit per pulse., Comment: 14 pages, 6 figures, 6 tables, comments are welcome

Lifelong on-device learning is a key challenge for machine intelligence, and this requires learning from few, often single, samples. Memory augmented neural network has been proposed to achieve the goal, but the memory module has to be stored in an off-chip memory due to its size. Therefore the practical use has been heavily limited. Previous works on emerging memory-based implementation have difficulties in scaling up because different modules with various structures are difficult to integrate on the same chip and the small sense margin of the content addressable memory for the memory module heavily limited the degree of mismatch calculation. In this work, we implement the entire memory augmented neural network architecture in a fully integrated memristive crossbar platform and achieve an accuracy that closely matches standard software on digital hardware for the Omniglot dataset. The successful demonstration is supported by implementing new functions in crossbars in addition to widely reported matrix multiplications. For example, the locality-sensitive hashing operation is implemented in crossbar arrays by exploiting the intrinsic stochasticity of memristor devices. Besides, the content-addressable memory module is realized in crossbars, which also supports the degree of mismatches. Simulations based on experimentally validated models show such an implementation can be efficiently scaled up for one-shot learning on the Mini-ImageNet dataset. The successful demonstration paves the way for practical on-device lifelong learning and opens possibilities for novel attention-based algorithms not possible in conventional hardware., Comment: 54 pages, 21 figures, 3 tables

Aspect-based sentiment analysis (ABSA) aims to associate a text with a set of aspects and infer their respective sentimental polarities. State-of-the-art approaches are built on fine-tuning pre-trained language models, focusing on learning aspect-specific representations from the corpus. However, aspects are often expressed implicitly, making implicit mapping challenging without sufficient labeled examples, which may be scarce in real-world scenarios. This paper proposes a unified framework to address aspect categorization and aspect-based sentiment subtasks. We introduce a mechanism to construct an auxiliary-sentence for the implicit aspect using the corpus's semantic information. We then encourage BERT to learn aspect-specific representation in response to this auxiliary-sentence, not the aspect itself. We evaluate our approach on real benchmark datasets for both ABSA and Targeted-ABSA tasks. Our experiments show that it consistently achieves state-of-the-art performance in aspect categorization and aspect-based sentiment across all datasets, with considerable improvement margins. The BERT-ASC code is available at https://github.com/amurtadha/BERT-ASC., Comment: under review

The Schottky barrier height ($E_{SBH}$) is a crucial factor in determining the transport properties of semiconductor materials as it directly regulates the carrier mobility in opto-electronics devices. In principle, van der Waals (vdW) Janus heterostructures offer an appealing avenue to controlling the ESBH. However, the underlying atomistic mechanisms are far from understood conclusively, which prompts for further research in the topic. To this end, here, we carry out an extensive first principles study of the electronic properties and $E_{SBH}$ of several vdW Janus MXY/Graphene (M=Mo, W; X, Y=S, Se, Te) heterostructures. The results of the simulations show that by changing the composition and geometry of the heterostructure's interface, it is possible to control its electrical contact, thence electron transport properties, from Ohmic to Schottky with nearly one order of magnitude variations in the $E_{SBH}$. Detailed analysis of the simulations enables rationalization of this highly attractive property on the basis of the interplay between the permanent dipole moment of the Janus MXY sheet and the induced one due to interfacial charge redistribution at the MXY/Gr interface. Such an interplay is shown to be highly effective in altering the electrostatic potential difference across the vdW Janus heterostructure, determining its ESBH, thence Schottky (Ohmic) contact type. These computational findings contribute guidelines to control electrical contacts in Janus heterostructures towards rational design of electrical contacts in nanoscale devices.

In recent years, knowledge graphs have been widely applied as a uniform way to organize data and have enhanced many tasks requiring knowledge. In online shopping platform Taobao, we built a billion-scale e-commerce product knowledge graph. It organizes data uniformly and provides item knowledge services for various tasks such as item recommendation. Usually, such knowledge services are provided through triple data, while this implementation includes (1) tedious data selection works on product knowledge graph and (2) task model designing works to infuse those triples knowledge. More importantly, product knowledge graph is far from complete, resulting error propagation to knowledge enhanced tasks. To avoid these problems, we propose a Pre-trained Knowledge Graph Model (PKGM) for the billion-scale product knowledge graph. On the one hand, it could provide item knowledge services in a uniform way with service vectors for embedding-based and item-knowledge-related task models without accessing triple data. On the other hand, it's service is provided based on implicitly completed product knowledge graph, overcoming the common the incomplete issue. We also propose two general ways to integrate the service vectors from PKGM into downstream task models. We test PKGM in five knowledge-related tasks, item classification, item resolution, item recommendation, scene detection and sequential recommendation. Experimental results show that PKGM introduces significant performance gains on these tasks, illustrating the useful of service vectors from PKGM., Comment: This is an extension of work "Billion-scale Pre-trained E-commerce Product Knowledge Graph Model" published at ICDE2021. We test PKGM on two additional tasks, scene detection and sequential recommendation, and add serving with item embeddings as one of the baseline. The extensive experiments show the effectiveness of PKGM, pre-trained knowledge graph model. arXiv admin note: text overlap with arXiv:2105.00388