Searcharxiv⌕ Search

arXiv subjects

Heng Fan

Publications and source records attributed to Heng Fan.

At least 163 records · Page 9Linked to original sources

Quantum simulation of Hawking radiation and curved spacetime with a superconducting on-chip black hole

Hawking radiation is one of the quantum features of a black hole that can be understood as a quantum tunneling across the event horizon of the black hole, but it is quite difficult to directly observe the Hawking radiation of an astrophysical black hole. Here, we report a fermionic lattice-model-type realization of an analogue black hole by using a chain of 10 superconducting transmon qubits with interactions mediated by 9 transmon-type tunable couplers. The quantum walks of quasi-particle in the curved spacetime reflect the gravitational effect near the black hole, resulting in the behaviour of stimulated Hawking radiation, which is verified by the state tomography measurement of all 7 qubits outside the horizon. In addition, the dynamics of entanglement in the curved spacetime is directly measured. Our results would stimulate more interests to explore the related features of black holes using the programmable superconducting processor with tunable couplers.

quant-ph↗

Entanglement-interference complementarity and experimental demonstration in a superconducting circuit

Quantum entanglement between an interfering particle and a detector for acquiring the which-path information plays a central role for enforcing Bohr's complementarity principle. However, the quantitative relation between this entanglement and the fringe visibility remains untouched upon for an initial mixed state. Here we find an equality for quantifying this relation. Our equality characterizes how well the interference pattern can be preserved when an interfering particle, initially carrying a definite amount of coherence, is entangled, to a certain degree, with a which-path detector. This equality provides a connection between entanglement and interference in the unified framework of coherence, revealing the quantitative entanglement-interference complementarity. We experimentally demonstrate this relation with a superconducting circuit, where a resonator serves as a which-path detector for an interfering qubit. The measured fringe visibility of the qubit's Ramsey signal and the qubit-resonator entanglement exhibit a complementary relation, in well agreement with the theoretical prediction.

quant-ph↗

Augment and Criticize: Exploring Informative Samples for Semi-Supervised Monocular 3D Object Detection

In this paper, we improve the challenging monocular 3D object detection problem with a general semi-supervised framework. Specifically, having observed that the bottleneck of this task lies in lacking reliable and informative samples to train the detector, we introduce a novel, simple, yet effective `Augment and Criticize' framework that explores abundant informative samples from unlabeled data for learning more robust detection models. In the `Augment' stage, we present the Augmentation-based Prediction aGgregation (APG), which aggregates detections from various automatically learned augmented views to improve the robustness of pseudo label generation. Since not all pseudo labels from APG are beneficially informative, the subsequent `Criticize' phase is presented. In particular, we introduce the Critical Retraining Strategy (CRS) that, unlike simply filtering pseudo labels using a fixed threshold (e.g., classification score) as in 2D semi-supervised tasks, leverages a learnable network to evaluate the contribution of unlabeled images at different training timestamps. This way, the noisy samples prohibitive to model evolution could be effectively suppressed. To validate our framework, we apply it to MonoDLE and MonoFlex. The two new detectors, dubbed 3DSeMo_DLE and 3DSeMo_FLEX, achieve state-of-the-art results with remarkable improvements for over 3.5% AP_3D/BEV (Easy) on KITTI, showing its effectiveness and generality. Code and models will be released.

cs.CV↗

PlanarTrack: A Large-scale Challenging Benchmark for Planar Object Tracking

Planar object tracking is a critical computer vision problem and has drawn increasing interest owing to its key roles in robotics, augmented reality, etc. Despite rapid progress, its further development, especially in the deep learning era, is largely hindered due to the lack of large-scale challenging benchmarks. Addressing this, we introduce PlanarTrack, a large-scale challenging planar tracking benchmark. Specifically, PlanarTrack consists of 1,000 videos with more than 490K images. All these videos are collected in complex unconstrained scenarios from the wild, which makes PlanarTrack, compared with existing benchmarks, more challenging but realistic for real-world applications. To ensure the high-quality annotation, each frame in PlanarTrack is manually labeled using four corners with multiple-round careful inspection and refinement. To our best knowledge, PlanarTrack, to date, is the largest and most challenging dataset dedicated to planar object tracking. In order to analyze the proposed PlanarTrack, we evaluate 10 planar trackers and conduct comprehensive comparisons and in-depth analysis. Our results, not surprisingly, demonstrate that current top-performing planar trackers degenerate significantly on the challenging PlanarTrack and more efforts are needed to improve planar tracking in the future. In addition, we further derive a variant named PlanarTrack$_{\mathbf{BB}}$ for generic object tracking from PlanarTrack. Our evaluation of 10 excellent generic trackers on PlanarTrack$_{\mathrm{BB}}$ manifests that, surprisingly, PlanarTrack$_{\mathrm{BB}}$ is even more challenging than several popular generic tracking benchmarks and more attention should be paid to handle such planar objects, though they are rigid. All benchmarks and evaluations will be released at the project webpage.

cs.CV↗

Multipartite entanglement detection based on generalized state-dependent entropic uncertainty relation for multiple measurements

We present the generalized state-dependent entropic uncertainty relations in multiple measurements setting, and the optimal lower bound is obtained by considering different measurement sequences. We then apply this uncertainty relation to witness entanglement, and give the experimentally accessible lower bounds on both bipartite and tripartite entanglements. This method of detecting entanglement is applied to a physical system of two particles on a one-dimensional lattice, and GHZ-Werner state. It is shown that, for measurements that are not in mutually unbiased bases, this new entropic uncertainty relation is superior to the previous state-independent one in entanglement detection. Furthermore, we conduct an online experiment to detect multipartite entanglement of GHZ states up to 10 qubits on Quafu cloud quantum computation platform. Our results might play important roles in detecting multipartite entanglement experimentally.

quant-ph↗

Improving the performance of quantum approximate optimization for preparing non-trivial quantum states without translational symmetry

The variational preparation of complex quantum states using the quantum approximate optimization algorithm (QAOA) is of fundamental interest, and becomes a promising application of quantum computers. Here, we systematically study the performance of QAOA for preparing ground states of target Hamiltonians near the critical points of their quantum phase transitions, and generating Greenberger-Horne-Zeilinger (GHZ) states. We reveal that the performance of QAOA is related to the translational invariance of the target Hamiltonian: Without the translational symmetry, for instance due to the open boundary condition (OBC) or randomness in the system, the QAOA becomes less efficient. We then propose a generalized QAOA assisted by the parameterized resource Hamiltonian (PRH-QAOA), to achieve a better performance. In addition, based on the PRH-QAOA, we design a low-depth quantum circuit beyond one-dimensional geometry, to generate GHZ states with perfect fidelity. The experimental realization of the proposed scheme for generating GHZ states on Rydberg-dressed atoms is discussed. Our work paves the way for performing QAOA on programmable quantum processors without translational symmetry, especially for recently developed two-dimensional quantum processors with OBC.

quant-ph↗

ScQ cloud quantum computation for generating Greenberger-Horne-Zeilinger states of up to 10 qubits

In this study, we introduce an online public quantum computation platform, named as ScQ, based on a 1D array of a 10-qubit superconducting processor. Single-qubit rotation gates can be performed on each qubit. Controlled-NOT gates between nearest-neighbor sites on the 1D array of 10 qubits are available. We show the online preparation and verification of Greenberger-Horne-Zeilinger states of up to 10 qubits through this platform for all possible blocks of qubits in the chain. The graphical user interface and quantum assembly language methods are presented to achieve the above tasks, which rely on a parameter scanning feature implemented on ScQ. The performance of this quantum computation platform, such as fidelities of logic gates and details of the superconducting device, are presented.

quant-ph↗

PIDray: A Large-scale X-ray Benchmark for Real-World Prohibited Item Detection

Automatic security inspection relying on computer vision technology is a challenging task in real-world scenarios due to many factors, such as intra-class variance, class imbalance, and occlusion. Most previous methods rarely touch the cases where the prohibited items are deliberately hidden in messy objects because of the scarcity of large-scale datasets, hindering their applications. To address this issue and facilitate related research, we present a large-scale dataset, named PIDray, which covers various cases in real-world scenarios for prohibited item detection, especially for deliberately hidden items. In specific, PIDray collects 124,486 X-ray images for $12$ categories of prohibited items, and each image is manually annotated with careful inspection, which makes it, to our best knowledge, to largest prohibited items detection dataset to date. Meanwhile, we propose a general divide-and-conquer pipeline to develop baseline algorithms on PIDray. Specifically, we adopt the tree-like structure to suppress the influence of the long-tailed issue in the PIDray dataset, where the first course-grained node is tasked with the binary classification to alleviate the influence of head category, while the subsequent fine-grained node is dedicated to the specific tasks of the tail categories. Based on this simple yet effective scheme, we offer strong task-specific baselines across object detection, instance segmentation, and multi-label classification tasks and verify the generalization ability on common datasets (e.g., COCO and PASCAL VOC). Extensive experiments on PIDray demonstrate that the proposed method performs favorably against current state-of-the-art methods, especially for deliberately hidden items. Our benchmark and codes will be released at https://github.com/lutao2021/PIDray.

cs.CV↗

AnimalTrack: A Benchmark for Multi-Animal Tracking in the Wild

Multi-animal tracking (MAT), a multi-object tracking (MOT) problem, is crucial for animal motion and behavior analysis and has many crucial applications such as biology, ecology and animal conservation. Despite its importance, MAT is largely under-explored compared to other MOT problems such as multi-human tracking due to the scarcity of dedicated benchmarks. To address this problem, we introduce AnimalTrack, a dedicated benchmark for multi-animal tracking in the wild. Specifically, AnimalTrack consists of 58 sequences from a diverse selection of 10 common animal categories. On average, each sequence comprises of 33 target objects for tracking. In order to ensure high quality, every frame in AnimalTrack is manually labeled with careful inspection and refinement. To our best knowledge, AnimalTrack is the first benchmark dedicated to multi-animal tracking. In addition, to understand how existing MOT algorithms perform on AnimalTrack and provide baselines for future comparison, we extensively evaluate 14 state-of-the-art representative trackers. The evaluation results demonstrate that, not surprisingly, most of these trackers become degenerated due to the differences between pedestrians and animals in various aspects (e.g., pose, motion, and appearance), and more efforts are desired to improve multi-animal tracking. We hope that AnimalTrack together with evaluation and analysis will foster further progress on multi-animal tracking. The dataset and evaluation as well as our analysis will be made available at https://hengfan2010.github.io/projects/AnimalTrack/.

cs.CV↗

SwinTrack: A Simple and Strong Baseline for Transformer Tracking

Recently Transformer has been largely explored in tracking and shown state-of-the-art (SOTA) performance. However, existing efforts mainly focus on fusing and enhancing features generated by convolutional neural networks (CNNs). The potential of Transformer in representation learning remains under-explored. In this paper, we aim to further unleash the power of Transformer by proposing a simple yet efficient fully-attentional tracker, dubbed SwinTrack, within classic Siamese framework. In particular, both representation learning and feature fusion in SwinTrack leverage the Transformer architecture, enabling better feature interactions for tracking than pure CNN or hybrid CNN-Transformer frameworks. Besides, to further enhance robustness, we present a novel motion token that embeds historical target trajectory to improve tracking by providing temporal context. Our motion token is lightweight with negligible computation but brings clear gains. In our thorough experiments, SwinTrack exceeds existing approaches on multiple benchmarks. Particularly, on the challenging LaSOT, SwinTrack sets a new record with 0.713 SUC score. It also achieves SOTA results on other benchmarks. We expect SwinTrack to serve as a solid baseline for Transformer tracking and facilitate future research. Our codes and results are released at https://github.com/LitingLin/SwinTrack.

cs.CV↗

A Probabilistic Imaginary Time Evolution Algorithm Based on Non-unitary Quantum Circuit

Imaginary time evolution is a powerful tool applied in quantum physics, while existing classical algorithms for simulating imaginary time evolution suffer high computational complexity as the quantum systems become larger and more complex. In this work, we propose a probabilistic algorithm for implementing imaginary time evolution based on non-unitary quantum circuit. We demonstrate the feasibility of this method by solving the ground state energy of several quantum many-body systems, including H2, LiH molecules and the quantum Ising chain. Moreover, we perform experiments on superconducting and trapped ion cloud platforms respectively to find the ground state energy of H2 and its most stable molecular structure. We also analyze the successful probability of the algorithm, which is a polynomial of the output error and introduce an approach to increase the success probability by rearranging the terms of Hamiltonian.

quant-ph↗

Variational Quantum Computation of Molecular Linear Response Properties on a Superconducting Quantum Processor

Simulating response properties of molecules is crucial for interpreting experimental spectroscopies and accelerating materials design. However, it remains a long-standing computational challenge for electronic structure methods on classical computers. While quantum computers hold the promise to solve this problem more efficiently in the long run, existing quantum algorithms requiring deep quantum circuits are infeasible for near-term noisy quantum processors. Here, we introduce a pragmatic variational quantum response (VQR) algorithm for response properties, which circumvents the need for deep quantum circuits. Using this algorithm, we report the first simulation of linear response properties of molecules including dynamic polarizabilities and absorption spectra on a superconducting quantum processor. Our results indicate that a large class of important dynamical properties such as Green's functions are within the reach of near-term quantum hardware using this algorithm in combination with suitable error mitigation techniques.

quant-ph↗

Observation of entanglement negativity transition of pseudo-random mixed states

Multipartite entanglement is a key resource for quantum computation. It is expected theoretically that entanglement transition may happen for multipartite random quantum states, however, which is still absent experimentally. Here, we report the observation of entanglement transition quantified by negativity using a fully connected 20-qubit superconducting processor. We implement multi-layer pseudo-random circuits to generate pseudo-random pure states of 7 to 15 qubits. Then, we investigate negativity spectra of reduced density matrices obtained by quantum state tomography for 6 qubits.Three different phases can be identified by calculating logarithmic negativities based on the negativity spectra. We observe the phase transitions by changing the sizes of environment and subsystems. The randomness of our circuits can be also characterized by quantifying the distance between the distribution of output bit-string probabilities and Porter-Thomas distribution. Our simulator provides a powerful tool to generate random states and understand the entanglement structure for multipartite quantum systems.

quant-ph↗

High-Fidelity Image Inpainting with GAN Inversion

Image inpainting seeks a semantically consistent way to recover the corrupted image in the light of its unmasked content. Previous approaches usually reuse the well-trained GAN as effective prior to generate realistic patches for missing holes with GAN inversion. Nevertheless, the ignorance of a hard constraint in these algorithms may yield the gap between GAN inversion and image inpainting. Addressing this problem, in this paper, we devise a novel GAN inversion model for image inpainting, dubbed InvertFill, mainly consisting of an encoder with a pre-modulation module and a GAN generator with F&W+ latent space. Within the encoder, the pre-modulation network leverages multi-scale structures to encode more discriminative semantics into style vectors. In order to bridge the gap between GAN inversion and image inpainting, F&W+ latent space is proposed to eliminate glaring color discrepancy and semantic inconsistency. To reconstruct faithful and photorealistic images, a simple yet effective Soft-update Mean Latent module is designed to capture more diverse in-domain patterns that synthesize high-fidelity textures for large corruptions. Comprehensive experiments on four challenging datasets, including Places2, CelebA-HQ, MetFaces, and Scenery, demonstrate that our InvertFill outperforms the advanced approaches qualitatively and quantitatively and supports the completion of out-of-domain images well.

cs.CV↗

All-optical control of thermal conduction in waveguide QED

We investigate the heat conduction between two one-dimension waveguides intermediated by a Laser-driving atom. The Laser provides the optical control on the heat conduction. The tunable asymmetric conduction of the heat against the temperature gradient is realized. Assisted by the modulated Laser, the heat conduction from either waveguide to the other waveguide can be suppressed. Meanwhile, the conduction towards the direction opposite to the suppressed one is gained. The heat currents can be significantly amplified by the energy flow of the Laser. Moveover, the scheme can act like a heat engine.

quant-ph↗

Probing Operator Spreading via Floquet Engineering in a Superconducting Circuit

Operator spreading, often characterized by out-of-time-order correlators (OTOCs), is one of the central concepts in quantum many-body physics. However, measuring OTOCs is experimentally challenging due to the requirement of reversing the time evolution of systems. Here we apply Floquet engineering to investigate operator spreading in a superconducting 10-qubit chain. Floquet engineering provides an effective way to tune the coupling strength between nearby qubits, which is used to demonstrate quantum walks with tunable couplings, reversed time evolution, and the measurement of OTOCs. A clear light-cone-like operator propagation is observed in the system with multiple excitations, and has a nearly equal velocity as the single-particle quantum walk. For the butterfly operator that is nonlocal (local) under the Jordan-Wigner transformation, the OTOCs show distinct behaviors with (without) a signature of information scrambling in the near integrable system.

quant-ph↗

Fast scrambling dynamics and many-body localization transition in an all-to-all disordered quantum spin model

We study the quantum thermalization and information scrambling dynamics of an experimentally realizable quantum spin model with homogeneous XX-type all-to-all interactions and random local potentials. We identify the thermalization-localization transition by changing the disorder strength, under a proper all-to-all interaction strength. The scrambling dynamics in the localization phase shows novel behaviors distinct from that of local models. The operator scrambling grows almost equally fast in both phases. In the thermal phase, we show there exhibits fast scrambling without appealing to the semi-classical limit. We also briefly discuss the experimental realization of the model using superconducting qubit quantum simulators.

quant-ph↗

Divert More Attention to Vision-Language Tracking

Relying on Transformer for complex visual feature learning, object tracking has witnessed the new standard for state-of-the-arts (SOTAs). However, this advancement accompanies by larger training data and longer training period, making tracking increasingly expensive. In this paper, we demonstrate that the Transformer-reliance is not necessary and the pure ConvNets are still competitive and even better yet more economical and friendly in achieving SOTA tracking. Our solution is to unleash the power of multimodal vision-language (VL) tracking, simply using ConvNets. The essence lies in learning novel unified-adaptive VL representations with our modality mixer (ModaMixer) and asymmetrical ConvNet search. We show that our unified-adaptive VL representation, learned purely with the ConvNets, is a simple yet strong alternative to Transformer visual features, by unbelievably improving a CNN-based Siamese tracker by 14.5% in SUC on challenging LaSOT (50.7% > 65.2%), even outperforming several Transformer-based SOTA trackers. Besides empirical results, we theoretically analyze our approach to evidence its effectiveness. By revealing the potential of VL representation, we expect the community to divert more attention to VL tracking and hope to open more possibilities for future tracking beyond Transformer. Code and models will be released at https://github.com/JudasDie/SOTS.

cs.CV↗