Search

Tracking the time evolution of a quantum state allows one to verify the thermalization rate or the propagation speed of correlations in generic quantum systems. Inspired by the energy-time uncertainty principle, bounds have been demonstrated on the maximal speed at which a quantum state can change, resulting in immediate and practical tasks. Based on a programmable superconducting quantum processor, we test the dynamics of various emulated quantum mechanical systems encompassing single- and many-body states. We show that one can test the known quantum speed limits and that modifying a single Hamiltonian parameter allows the observation of the crossover of the different bounds on the dynamics. We also unveil the observation of minimal quantum speed limits in addition to more common maximal ones, i.e., the lowest rate of change of a unitarily evolved quantum state. Our results establish a comprehensive experimental characterization of quantum speed limits and pave the way for their subsequent study in engineered non-unitary conditions., Comment: 9 pages,4 figures + supplementary information

In this paper, we first introduce the concept of Rota-Baxter family BiHom-$\Omega$-associative algebras, then we define the cochain complex of BiHom-$\Omega$-associative algebras and verify it via Maurer-Cartan methods. Next, we further introduce and study the cohomology theory of Rota-Baxter family BiHom-$\Omega$-associative algebras of weight $\lambda$ and show that this cohomology controls the corresponding deformations. Finally, we study abelian extensions of Rota-Baxter family BiHom-$\Omega$-associative algebras in terms of the second cohomology group., Comment: 29pp;Comments are welcome!

Seismic tomography has long been an effective tool for constructing reliable subsurface structures. However, simultaneous inversion of P- and S-wave velocities presents a significant challenge for conventional seismic tomography methods, which depend on numerical algorithms to calculate traveltimes. A physics informed neural network (PINN)-based seismic tomography method (PINNtomo) has been proposed to solve the eikonal equation and construct the velocity model. Leveraging the powerful approximation capabilities of neural networks, we propose extending PINNtomo to perform multiparameter inversion of P- and S-wave velocities jointly, which we refer to as PINNPStomo. In PINNPStomo, we employ two neural networks: one for the P- and S-wave traveltimes, and another for the P- and S-wave velocities. By optimizing the misfits of P- and S-wave first-arrival traveltimes calculated from the eikonal equations, we can obtain the predicted P- and S-wave velocities that determine these traveltimes. Recognizing that the original PINNtomo utilizes a multiplicative factored eikonal equation, which depends on background traveltimes corresponding to a homogeneous velocity at the source location. We propose a new factored eikonal equation for PINNPStomo to eliminate this dependency. The proposed PINNPStomo, incorporating the new factored eikonal equation, demonstrates superior convergence speed and multiparameter inversion accuracy. We validate these improvements using 2D Marmousi and 2D/3D Overthrust elastic velocity models across three different seismic data acquisition geometries., Comment: submitted to Geophysics

Bell nonlocality is an intrinsic feature of quantum mechanics, which can be certified via the violation of Bell inequalities. It is therefore a fundamental question to certify Bell nonlocality from experimental data. Here, we present an optimization scheme to improve nonlocality certification by exploring flexible mappings between Bell inequalities and Hamiltonians corresponding to the Bell operators. We show that several Hamiltonian models can be mapped to new inequalities with improved classical bounds than the original one, enabling a more robust detection of nonlocality. From the other direction, we investigate the mapping from fixed Bell inequalities to Hamiltonians, aiming to maximize quantum violations while considering experimental imperfections. As a practical demonstration, we apply this method to an XXZ-like honeycomb-lattice model utilizing over 70 superconducting qubits. The successful application of this technique, as well as combining the two directions to form an optimization loop, may open new avenues for developing more practical and noise-resilient nonlocality certification techniques and enable broader experimental explorations., Comment: 11 pages, 5 figures, 1 table

Quantum nonlocality describes a stronger form of quantum correlation than that of entanglement. It refutes Einstein's belief of local realism and is among the most distinctive and enigmatic features of quantum mechanics. It is a crucial resource for achieving quantum advantages in a variety of practical applications, ranging from cryptography and certified random number generation via self-testing to machine learning. Nevertheless, the detection of nonlocality, especially in quantum many-body systems, is notoriously challenging. Here, we report an experimental certification of genuine multipartite Bell correlations, which signal nonlocality in quantum many-body systems, up to 24 qubits with a fully programmable superconducting quantum processor. In particular, we employ energy as a Bell correlation witness and variationally decrease the energy of a many-body system across a hierarchy of thresholds, below which an increasing Bell correlation depth can be certified from experimental data. As an illustrating example, we variationally prepare the low-energy state of a two-dimensional honeycomb model with 73 qubits and certify its Bell correlations by measuring an energy that surpasses the corresponding classical bound with up to 48 standard deviations. In addition, we variationally prepare a sequence of low-energy states and certify their genuine multipartite Bell correlations up to 24 qubits via energies measured efficiently by parity oscillation and multiple quantum coherence techniques. Our results establish a viable approach for preparing and certifying multipartite Bell correlations, which provide not only a finer benchmark beyond entanglement for quantum devices, but also a valuable guide towards exploiting multipartite Bell correlation in a wide spectrum of practical applications., Comment: 11 pages,6 figures + 14 pages, 6 figures

Recent advancements of intermediate-scale quantum processors have triggered tremendous interest in the exploration of practical quantum advantage. The simulation of fluid dynamics, a highly challenging problem in classical physics but vital for practical applications, emerges as a good candidate for showing quantum utility. Here, we report an experiment on the digital simulation of unsteady flows, which consists of quantum encoding, evolution, and detection of flow states, with a superconducting quantum processor. The quantum algorithm is based on the Hamiltonian simulation using the hydrodynamic formulation of the Schr\"odinger equation. With the median fidelities of 99.97% and 99.67% for parallel single- and two-qubit gates respectively, we simulate the dynamics of a two-dimensional (2D) compressible diverging flow and a 2D decaying vortex with ten qubits. The experimental results well capture the temporal evolution of averaged density and momentum profiles, and qualitatively reproduce spatial flow fields with moderate noises. This work demonstrates the potential of quantum computing in simulating more complex flows, such as turbulence, for practical applications.

Non-Abelian topological orders offer an intriguing path towards fault-tolerant quantum computation, where information can be encoded and manipulated in a topologically protected manner immune to arbitrary local noises and perturbations. However, realizing non-Abelian topologically ordered states is notoriously challenging in both condensed matter and programmable quantum systems, and it was not until recently that signatures of non-Abelian statistics were observed through digital quantum simulation approaches. Despite these exciting progresses, none of them has demonstrated the appropriate type of topological orders and associated non-Abelian anyons whose braidings alone support universal quantum computation. Here, we report the realization of non-Abelian topologically ordered states of the Fibonacci string-net model and demonstrate braidings of Fibonacci anyons featuring universal computational power, with a superconducting quantum processor. We exploit efficient quantum circuits to prepare the desired states and verify their nontrivial topological nature by measuring the topological entanglement entropy. In addition, we create two pairs of Fibonacci anyons and demonstrate their fusion rule and non-Abelian braiding statistics by applying unitary gates on the underlying physical qubits. Our results establish a versatile digital approach to exploring exotic non-Abelian topological states and their associated braiding statistics with current noisy intermediate-scale quantum processors.

The spectral form factor (SFF) captures universal spectral fluctuations as signatures of quantum chaos, and has been instrumental in advancing multiple frontiers of physics including the studies of black holes and quantum many-body systems. However, the measurement of SFF in many-body systems is challenging due to the difficulty in resolving level spacings that become exponentially small with increasing system size. Here we experimentally measure the SFF to probe the presence or absence of chaos in quantum many-body systems using a superconducting quantum processor with a randomized measurement protocol. For a Floquet chaotic system, we observe signatures of spectral rigidity of random matrix theory in SFF given by the ramp-plateau behavior. For a Hamiltonian system, we utilize SFF to distinguish the quantum many-body chaotic phase and the prethermal many-body localization. We observe the dip-ramp-plateau behavior of random matrix theory in the chaotic phase, and contrast the scaling of the plateau time in system size between the many-body chaotic and localized phases. Furthermore, we probe the eigenstate statistics by measuring a generalization of the SFF, known as the partial SFF, and observe distinct behaviors in the purities of the reduced density matrix in the two phases. This work unveils a new way of extracting the universal signatures of many-body quantum chaos in quantum devices by probing the correlations in eigenenergies and eigenstates., Comment: 12 pages, 9 figures

Quantum speed limits (QSLs) impose fundamental constraints on the evolution speed of quantum systems. Traditionally, the Mandelstam-Tamm (MT) and Margolus-Levitin (ML) bounds have been widely employed, relying on the standard deviation and mean of energy distribution to define the QSLs. However, these universal bounds only offer loose restrictions on the quantum evolution. Here we introduce the generalized ML bounds, which prove to be more stringent in constraining dynamic evolution, by utilizing moments of energy spectra of arbitrary orders, even noninteger orders. To validate our findings, we conduct experiments in a superconducting circuit, where we have the capability to prepare a wide range of quantum photonic states and rigorously test these bounds by measuring the evolution of the system and its photon statistics using quantum state tomography. While, in general, the MT bound is effective for short-time evolution, we identify specific parameter regimes where either the MT or the generalized ML bounds suffice to constrain the entire evolution. Our findings not only establish new criteria for estimating QSLs but also substantially enhance our comprehension of the dynamic evolution of quantum systems.

The ability to realize high-fidelity quantum communication is one of the many facets required to build generic quantum computing devices. In addition to quantum processing, sensing, and storage, transferring the resulting quantum states demands a careful design that finds no parallel in classical communication. Existing experimental demonstrations of quantum information transfer in solid-state quantum systems are largely confined to small chains with few qubits, often relying upon non-generic schemes. Here, by using a large-scale superconducting quantum circuit featuring thirty-six tunable qubits, accompanied by general optimization procedures deeply rooted in overcoming quantum chaotic behavior, we demonstrate a scalable protocol for transferring few-particle quantum states in a two-dimensional quantum network. These include single-qubit excitation and also two-qubit entangled states, and two excitations for which many-body effects are present. Our approach, combined with the quantum circuit's versatility, paves the way to short-distance quantum communication for connecting distributed quantum processors or registers, even if hampered by inherent imperfections in actual quantum devices., Comment: 10 pages, 4 figures (main text); 14 pages, 20 figures (supplementary materials)

With the productive evolution of large language models (LLMs) in the field of natural language processing (NLP), tons of effort has been made to effectively fine-tune common pre-trained LLMs to fulfill a variety of tasks in one or multiple specific domain. In practice, there are two prevailing ways, in which the adaptation can be achieved: (i) Multiple Independent Models: Pre-trained LLMs are fine-tuned a few times independently using the corresponding training samples from each task. (ii) An Integrated Model: Samples from all tasks are employed to fine-tune a pre-trianed LLM unitedly. To address the high computing cost and seesawing issue simultaneously, we propose a unified framework that implements a 1 + N mutli-task fine-tuning pattern in LLMs using a novel Customized Gate Control (CGC) Low-rank Adaptation (LoRA) algorithm. Our work aims to take an advantage of both MTL (i.e., CGC) and PEFT (i.e., LoRA) scheme. For a given cluster of tasks, we design an innovative layer that contains two types of experts as additional trainable parameters to make LoRA be compatible with MTL. To comprehensively evaluate the proposed framework, we conduct well-designed experiments on two public datasets. The experimental results demonstrate that the unified framework with CGC-LoRA modules achieves higher evaluation scores than all benchmarks on both two datasets.

Topologically ordered phases of matter elude Landau's symmetry-breaking theory, featuring a variety of intriguing properties such as long-range entanglement and intrinsic robustness against local perturbations. Their extension to periodically driven systems gives rise to exotic new phenomena that are forbidden in thermal equilibrium. Here, we report the observation of signatures of such a phenomenon -- a prethermal topologically ordered time crystal -- with programmable superconducting qubits arranged on a square lattice. By periodically driving the superconducting qubits with a surface-code Hamiltonian, we observe discrete time-translation symmetry breaking dynamics that is only manifested in the subharmonic temporal response of nonlocal logical operators. We further connect the observed dynamics to the underlying topological order by measuring a nonzero topological entanglement entropy and studying its subsequent dynamics. Our results demonstrate the potential to explore exotic topologically ordered nonequilibrium phases of matter with noisy intermediate-scale quantum processors., Comment: 8 pages (main text), 16 pages (supplementary information)

Seismic traveltime is critical information conveyed by seismic waves, widely utilized in various geophysical applications. Conventionally, the simulation of seismic traveltime involves solving the eikonal equation. However, the efficiency of traditional numerical solvers is hindered, as they are typically capable of simulating seismic traveltime for only a single source at a time. Recently, deep learning tools, particularly physics-informed neural networks (PINNs), have proven effective in simulating seismic traveltimes for multiple sources. Nonetheless, PINNs face challenges such as limited generalization capabilities across different models and difficulties in training convergence. To address these issues, we have developed a method for simulating multi-source seismic traveltimes in variable velocity models using a deep-learning technique, known as the physics-informed Fourier neural operator (PIFNO). The PIFNO-based method for seismic traveltime generation takes both velocity and background traveltime as inputs, generating the perturbation traveltime as the output. This method incorporates a factorized eikonal equation as the loss function and relies solely on physical laws, eliminating the need for labeled training data. We demonstrate that our proposed method is not only effective in calculating seismic traveltimes for velocity models used during training but also shows promising prediction capabilities for test velocity models. We validate these features using velocity models from the OpenFWI dataset., Comment: 13 pages, 12 figures, submitted to IEEE TGRS

The morphing of 3D structures is suitable for i) future tunable material design for customizing material properties and ii) advanced manufacturing tools for fabricating 3D structures on a 2D plane. However, there is no inverse design method for topologically variable and volumetric morphing or morphing with shape locking, which limits practical engineering applications. In this study, we construct a general inverse design method for 3D architected materials for topologically variable and volumetric morphing, whose shapes are lockable in the morphed states, which can contribute to future tunable materials, design, and advanced manufacturing. Volumetric mapping of bistable unit cells onto any 3D morphing target geometry with kinematic and kinetic modifications can produce flat-foldable and volumetric morphing structures with shape-locking. This study presents a generalized inverse design method for 3D metamaterial morphing that can be used for structural applications with shape locking. Topologically variable morphing enables the manufacture of volumetric structures on a 2D plane, saving tremendous energy and materials compared with conventional 3D printing. Volumetric morphing can significantly expand the design space with tunable physical properties without limiting the selection of base materials.

User modeling, which aims to capture users' characteristics or interests, heavily relies on task-specific labeled data and suffers from the data sparsity issue. Several recent studies tackled this problem by pre-training the user model on massive user behavior sequences with a contrastive learning task. Generally, these methods assume different views of the same behavior sequence constructed via data augmentation are semantically consistent, i.e., reflecting similar characteristics or interests of the user, and thus maximizing their agreement in the feature space. However, due to the diverse interests and heavy noise in user behaviors, existing augmentation methods tend to lose certain characteristics of the user or introduce noisy behaviors. Thus, forcing the user model to directly maximize the similarity between the augmented views may result in a negative transfer. To this end, we propose to replace the contrastive learning task with a new pretext task: Augmentation-Adaptive SelfSupervised Ranking (AdaptSSR), which alleviates the requirement of semantic consistency between the augmented views while pre-training a discriminative user model. Specifically, we adopt a multiple pairwise ranking loss which trains the user model to capture the similarity orders between the implicitly augmented view, the explicitly augmented view, and views from other users. We further employ an in-batch hard negative sampling strategy to facilitate model training. Moreover, considering the distinct impacts of data augmentation on different behavior sequences, we design an augmentation-adaptive fusion mechanism to automatically adjust the similarity order constraint applied to each sample based on the estimated similarity between the augmented views. Extensive experiments on both public and industrial datasets with six downstream tasks verify the effectiveness of AdaptSSR., Comment: Accepted by NeurIPS 2023

As a potential revolutionary topic in future information processing, mechanical computing has gained tremendous attention for replacing or supplementing conventional electronics vulnerable to power outages, security attacks, and harsh environments. Despite its potential for constructing intelligent matter towards nonclassical computing systems beyond the von Neumann architecture, most works on mechanical computing demonstrated that the ad hoc design of simple logic gates cannot fully realize a universal mechanical processing framework involving interconnected arithmetic logic components and memory. However, such a logic-with-memory computing architecture is critical for complex and persistent state-dependent computations such as sequential logic. Here we propose a mechanical transistor (M-Transistor), abstracting omnipresent temperatures as the input-output mechanical bits, which consists of a metamaterial thermal channel as the gate terminal driving a nonlinear bistable soft actuator to selectively connect the output terminal to two other variable thermal sources. This M-Transistor is an elementary unit to modularly form various combinational and sequential circuits, such as complex logic gates, registers (volatile memory), and long-term memories (non-volatile memory) with much fewer units than the electronic counterparts. Moreover, they can establish a universal processing core comprising an arithmetic circuit and a register in a compact, reprogrammable network involving periodic read, write, memory, and logic operations of the mechanical bits. Our work contributes to realizing a non-electric universal mechanical computing architecture that combines multidisciplinary engineering with structural mechanics, materials science, thermal engineering, physical intelligence, and computational science., Comment: 25 pages, 4 figures, Article

Text-based delivery addresses, as the data foundation for logistics systems, contain abundant and crucial location information. How to effectively encode the delivery address is a core task to boost the performance of downstream tasks in the logistics system. Pre-trained Models (PTMs) designed for Natural Language Process (NLP) have emerged as the dominant tools for encoding semantic information in text. Though promising, those NLP-based PTMs fall short of encoding geographic knowledge in the delivery address, which considerably trims down the performance of delivery-related tasks in logistic systems such as Cainiao. To tackle the above problem, we propose a domain-specific pre-trained model, named G2PTL, a Geography-Graph Pre-trained model for delivery address in Logistics field. G2PTL combines the semantic learning capabilities of text pre-training with the geographical-relationship encoding abilities of graph modeling. Specifically, we first utilize real-world logistics delivery data to construct a large-scale heterogeneous graph of delivery addresses, which contains abundant geographic knowledge and delivery information. Then, G2PTL is pre-trained with subgraphs sampled from the heterogeneous graph. Comprehensive experiments are conducted to demonstrate the effectiveness of G2PTL through four downstream tasks in logistics systems on real-world datasets. G2PTL has been deployed in production in Cainiao's logistics system, which significantly improves the performance of delivery-related tasks. The code of G2PTL is available at https://huggingface.co/Cainiao-AI/G2PTL.

In this paper, we firstly construct an $L_\infty[1]$-algebra via the method of higher derived brackets, whose Maurer-Cartan elements correspond to relative $\Omega$-family Rota-Baxter algebras structures of weight $\lambda$. For a relative $\Omega$-family Rota-Baxter algebra of weight $\lambda$, the corresponding twisted $ L_{\infty}[1] $-algebra controls its deformations, which leads to the cohomology theory of relative $\Omega$-family Rota-Baxter algebras of weight $\lambda$. Moreover, we also obtain the corresponding results for absolute $\Omega$-family Rota-Baxter algebras of weight $\lambda$ from the relative version. At last, we study formal deformations of relative (resp. absolute) $\Omega$-family Rota-Baxter algebras of weight $\lambda$, which can be explained by the lower degree cohomology groups., Comment: 25 pages, all comments welcome

Shor's algorithm has seriously challenged information security based on public key cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of physical qubits, which is far beyond current technical capabilities. Here, we report a universal quantum algorithm for integer factorization by combining the classical lattice reduction with a quantum approximate optimization algorithm (QAOA). The number of qubits required is O(logN/loglog N), which is sublinear in the bit length of the integer $N$, making it the most qubit-saving factorization algorithm to date. We demonstrate the algorithm experimentally by factoring integers up to 48 bits with 10 superconducting qubits, the largest integer factored on a quantum device. We estimate that a quantum circuit with 372 physical qubits and a depth of thousands is necessary to challenge RSA-2048 using our algorithm. Our study shows great promise in expediting the application of current noisy quantum computers, and paves the way to factor large integers of realistic cryptographic significance., Comment: 32 pages, 12 figures

Non-Abelian anyons are exotic quasiparticle excitations hosted by certain topological phases of matter. They break the fermion-boson dichotomy and obey non-Abelian braiding statistics: their interchanges yield unitary operations, rather than merely a phase factor, in a space spanned by topologically degenerate wavefunctions. They are the building blocks of topological quantum computing. However, experimental observation of non-Abelian anyons and their characterizing braiding statistics is notoriously challenging and has remained elusive hitherto, in spite of various theoretical proposals. Here, we report an experimental quantum digital simulation of projective non-Abelian anyons and their braiding statistics with up to 68 programmable superconducting qubits arranged on a two-dimensional lattice. By implementing the ground states of the toric-code model with twists through quantum circuits, we demonstrate that twists exchange electric and magnetic charges and behave as a particular type of non-Abelian anyons, i.e., the Ising anyons. In particular, we show experimentally that these twists follow the fusion rules and non-Abelian braiding statistics of the Ising type, and can be explored to encode topological logical qubits. Furthermore, we demonstrate how to implement both single- and two-qubit logic gates through applying a sequence of elementary Pauli gates on the underlying physical qubits. Our results demonstrate a versatile quantum digital approach for simulating non-Abelian anyons, offering a new lens into the study of such peculiar quasiparticles.

Quantum many-body simulation provides a straightforward way to understand fundamental physics and connect with quantum information applications. However, suffering from exponentially growing Hilbert space size, characterization in terms of few-body probes in real space is often insufficient to tackle challenging problems such as quantum critical behavior and many-body localization (MBL) in higher dimensions. Here, we experimentally employ a new paradigm on a superconducting quantum processor, exploring such elusive questions from a Fock space view: mapping the many-body system onto an unconventional Anderson model on a complex Fock space network of many-body states. By observing the wave packet propagating in Fock space and the emergence of a statistical ergodic ensemble, we reveal a fresh picture for characterizing representative many-body dynamics: thermalization, localization, and scarring. In addition, we observe a quantum critical regime of anomalously enhanced wave packet width and deduce a critical point from the maximum wave packet fluctuations, which lend support for the two-dimensional MBL transition in finite-sized systems. Our work unveils a new perspective of exploring many-body physics in Fock space, demonstrating its practical applications on contentious MBL aspects such as criticality and dimensionality. Moreover, the entire protocol is universal and scalable, paving the way to finally solve a broader range of controversial many-body problems on future larger quantum devices., Comment: 8 pages, 4 figures + supplementary information

Topological photonics provides a novel platform to explore topological physics beyond traditional electronic materials and stimulates promising applications in topologically protected light transport and lasers. Classical degrees of freedom such as polarizations and wavevectors are routinely used to synthesize topological light modes. Beyond the classical regime, inherent quantum nature of light gives birth to a wealth of fundamentally distinct topological states, which offer topological protection in quantum information processing. Here we implement such experiments on topological states of quantized light in a superconducting circuit, on which three resonators are tunably coupled to a gmon qubit. We construct one and two-dimensional Fock-state lattices where topological transport of zero-energy states, strain induced pseudo-Landau levels, valley Hall effect and Haldane chiral edge currents are demonstrated. Our study extends the topological states of light to the quantum regime, bridges topological phases of condensed matter physics with circuit quantum electrodynamics, and offers a new freedom in controlling the quantum states of multiple resonators., Comment: 9 pages, 6 figures