Searcharxiv⌕ Search

arXiv subjects

Ke Sun

Publications and source records attributed to Ke Sun.

At least 163 records · Page 9Linked to original sources

Underwater Transmission of High-dimensional Twisted Photons over 55 Meters

As an emerging channel resource for modern optics, big data, internet traffic and quantum technologies, twisted photons carrying orbital angular momentum (OAM) have been extended their applicable boundary in different media, such as optical fiber and atmosphere. Due to the extreme condition of loss and pressure, underwater transmission of twisted photons has not been well investigated yet. Especially, single-photon tests were all limited at a level of a few meters, and it is in practice unclear what will happen for longer transmission distances. Here we experimentally demonstrate the transmission of single-photon twisted light over an underwater channel up to 55 meters, which reach a distance allowing potential real applications. For different order OAM states and their superposition, a good preservation of modal structure and topological charge are observed. Our results for the first time reveal the real transmission performance of twisted photons in a long-distance regime, representing a step further towards OAM-based underwater quantum communication.

quant-ph↗

Photonic Newton's Cradle for Remote Energy Transport

Energy transport is of central importance in understanding a wide variety of transitions of physical states in nature. Recently, the coherence and noise have been identified for their existence and key roles in energy transport processes, for instance, in a photosynthesis complex, DNA, and odor sensing etc, of which one may have to reveal the inner mechanics in the quantum regime. Here we present an analog of Newton's cradle by manipulating a boundary-controlled chain on a photonic chip. Long-range interactions can be mediated by a long chain composed of 21 strongly coupled sites, where single-photon excitations are transferred between two remote sites via simultaneous control of inter-site weak and strong couplings. We observe a high retrieval efficiency in both uniform and defect-doped chain structures. Our results may offer a flexible approach to Hamiltonian engineering beyond geometric limitation, enabling the design and construction of quantum simulators on demand.

quant-ph↗

Relative Geometry-Aware Siamese Neural Network for 6DOF Camera Relocalization

6DOF camera relocalization is an important component of autonomous driving and navigation. Deep learning has recently emerged as a promising technique to tackle this problem. In this paper, we present a novel relative geometry-aware Siamese neural network to enhance the performance of deep learning-based methods through explicitly exploiting the relative geometry constraints between images. We perform multi-task learning and predict the absolute and relative poses simultaneously. We regularize the shared-weight twin networks in both the pose and feature domains to ensure that the estimated poses are globally as well as locally correct. We employ metric learning and design a novel adaptive metric distance loss to learn a feature that is capable of distinguishing poses of visually similar images from different locations. We evaluate the proposed method on public indoor and outdoor benchmarks and the experimental results demonstrate that our method can significantly improve localization performance. Furthermore, extensive ablation evaluations are conducted to demonstrate the effectiveness of different terms of the loss function.

cs.CV↗

Mapping Twisted Light into and out of a Photonic Chip

Twisted light carrying orbital angular momentum (OAM) provides an additional degree of freedom for modern optics and an emerging resource for both classical and quantum information technologies. Its inherently infinite dimensions can potentially be exploited by using mode multiplexing to enhance data capacity for sustaining the unprecedented growth in big data and internet traffic, and can be encoded to build large-scale quantum computing machines in high-dimensional Hilbert space. While the emission of twisted light from the surface of integrated devices to free space has been widely investigated, the transmission and processing inside a photonic chip remain to be addressed. Here, we present the first laser-direct-written waveguide being capable of supporting OAM modes and experimentally demonstrate a faithful mapping of twisted light into and out of a photonic chip. The states OAM$_{0}$, OAM$_{-1}$, OAM$_{+1}$ and their superpositions can transmit through the photonic chip with a total efficiency up to 60% with minimal crosstalk. In addition, we present the transmission of quantum twisted light states of single photons and measure the output states with single-photon imaging. Our results may add OAM as a new degree of freedom to be transmitted and manipulated in a photonic chip for high-capacity communication and high-dimensional quantum information processing.

quant-ph↗

Experimental Quantum Fast Hitting on Hexagonal Graphs

Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their faster hitting performances than in the case of classical random walks. However, its experimental implementation is challenging as it involves highly complex arrangements of exponentially increasing number of nodes. Here we propose an alternative structure with a polynomially increasing number of nodes. We successfully map such graphs on quantum photonic chips using femtosecond laser direct writing techniques in a geometrically scalable fashion. We experimentally demonstrate quantum fast hitting by implementing two-dimensional quantum walks on these graphs with up to 160 nodes and a depth of 8 layers, achieving a linear relationship between the optimal hitting time and the network depth. Our results open up a scalable way towards quantum speed-up in complex problems classically intractable.

quant-ph↗

Stochastic 2-D Motion Planning with a POMDP Framework

Motion planning is challenging when it comes to the case of imperfect state information. Decision should be made based on belief state which evolves according to the noise from the system dynamics and sensor measurement. In this paper, we propose the QV-Tree Search algorithm which combines the state-of-art offline and online approximation methods for POMDP. Instead of full node expansions in the tree search, only probable future observations are considered through forward sampling. This modification helps reduce online computation time and allows for GPU acceleration. We show using repre- sentative examples that the proposed QV-Tree Search is able to actively localize the robot in order to reach the goal location with high probability. The results of the proposed method is also compared with the A* and MDP algorithms, neither of which handles state uncertainty directly. The comparison shows that QV-Tree Search is able to drive the robot to the goal with higher success rate and fewer steps.

cs.RO↗

The Open Vision Computer: An Integrated Sensing and Compute System for Mobile Robots

In this paper we describe the Open Vision Computer (OVC) which was designed to support high speed, vision guided autonomous drone flight. In particular our aim was to develop a system that would be suitable for relatively small-scale flying platforms where size, weight, power consumption and computational performance were all important considerations. This manuscript describes the primary features of our OVC system and explains how they are used to support fully autonomous indoor and outdoor exploration and navigation operations on our Falcon 250 quadrotor platform.

cs.RO↗

Quantum Topological Boundary States in Quasi-crystal

Topological phase, a novel and fundamental role in matter, displays an extraordinary robustness to smooth changes in material parameters or disorder. A crossover between topological physics and quantum information may lead to inherent fault-tolerant quantum simulations and quantum computing. Quantum features may be preserved by being encoded among topological structures of physical evolution systems. This requires us to stimulate, manipulate and observe topological phenomena at single quantum particle level, which, however, hasn't been realized yet. Here, we address such a question whether the quantum features of single photons can be preserved in topological structures. We experimentally observe the boundary states of single photons and demonstrate the performance of topological phase on protecting the quantum features in quasi-periodic systems. Our work confirms the compatibility between macroscopic topological states and microscopic single photons on a photonic chip. We believe the emerging 'quantum topological photonics' will add entirely new and versatile capacities into quantum technologies.

quant-ph↗

IGCV3: Interleaved Low-Rank Group Convolutions for Efficient Deep Neural Networks

In this paper, we are interested in building lightweight and efficient convolutional neural networks. Inspired by the success of two design patterns, composition of structured sparse kernels, e.g., interleaved group convolutions (IGC), and composition of low-rank kernels, e.g., bottle-neck modules, we study the combination of such two design patterns, using the composition of structured sparse low-rank kernels, to form a convolutional kernel. Rather than introducing a complementary condition over channels, we introduce a loose complementary condition, which is formulated by imposing the complementary condition over super-channels, to guide the design for generating a dense convolutional kernel. The resulting network is called IGCV3. We empirically demonstrate that the combination of low-rank and sparse kernels boosts the performance and the superiority of our proposed approach to the state-of-the-arts, IGCV2 and MobileNetV2 over image classification on CIFAR and ImageNet and object detection on COCO.

cs.CV↗

Chinese Lexical Analysis with Deep Bi-GRU-CRF Network

Lexical analysis is believed to be a crucial step towards natural language understanding and has been widely studied. Recent years, end-to-end lexical analysis models with recurrent neural networks have gained increasing attention. In this report, we introduce a deep Bi-GRU-CRF network that jointly models word segmentation, part-of-speech tagging and named entity recognition tasks. We trained the model using several massive corpus pre-tagged by our best Chinese lexical analysis tool, together with a small, yet high-quality human annotated corpus. We conducted balanced sampling between different corpora to guarantee the influence of human annotations, and fine-tune the CRF decoding layer regularly during the training progress. As evaluated by linguistic experts, the model achieved a 95.5% accuracy on the test set, roughly 13% relative error reduction over our (previously) best Chinese lexical analysis tool. The model is computationally efficient, achieving the speed of 2.3K characters per second with one thread.

cs.CL↗

Guaranteed Deterministic Bounds on the Total Variation Distance between Univariate Mixtures

The total variation distance is a core statistical distance between probability measures that satisfies the metric axioms, with value always falling in $[0,1]$. This distance plays a fundamental role in machine learning and signal processing: It is a member of the broader class of $f$-divergences, and it is related to the probability of error in Bayesian hypothesis testing. Since the total variation distance does not admit closed-form expressions for statistical mixtures (like Gaussian mixture models), one often has to rely in practice on costly numerical integrations or on fast Monte Carlo approximations that however do not guarantee deterministic lower and upper bounds. In this work, we consider two methods for bounding the total variation of univariate mixture models: The first method is based on the information monotonicity property of the total variation to design guaranteed nested deterministic lower bounds. The second method relies on computing the geometric lower and upper envelopes of weighted mixture components to derive deterministic bounds based on density ratio. We demonstrate the tightness of our bounds in a series of experiments on Gaussian, Gamma and Rayleigh mixture models.

cs.LG↗

Mapping and Measuring Large-scale Photonic Correlation with Single-photon Imaging

Quantum correlation and its measurement are essential in exploring fundamental quantum physics problems and developing quantum enhanced technologies. Quantum correlation may be generated and manipulated in different spaces, which demands different measurement approaches corresponding to position, time, frequency and polarization of quantum particles. In addition, after early proof-of-principle demonstrations, it is of great demand to measure quantum correlation in a Hilbert space large enough for real quantum applications. When the number of modes goes up to several hundreds, it becomes economically unfeasible for single-mode addressing and also extremely challenging for processing correlation events with hardware. Here we present a general and large-scale measurement approach of Correlation on Spatially-mapped Photon-Level Image (COSPLI). The quantum correlations in other spaces are mapped into the position space and are captured by single-photon-sensitive imaging system. Synthetic methods are developed to suppress noises so that single-photon registrations can be faithfully identified in images. We eventually succeed in retrieving all the correlations with big-data technique from tens of millions of images. We demonstrate our COSPLI by measuring the joint spectrum of parametric down-conversion photons. Our approach provides an elegant way to observe the evolution results of large-scale quantum systems, representing an innovative and powerful tool added into the platform for boosting quantum information processing.

quant-ph↗

Experiments in Fast, Autonomous, GPS-Denied Quadrotor Flight

High speed navigation through unknown environments is a challenging problem in robotics. It requires fast computation and tight integration of all the subsystems on the robot such that the latency in the perception-action loop is as small as possible. Aerial robots add a limitation of payload capacity, which restricts the amount of computation that can be carried onboard. This requires efficient algorithms for each component in the navigation system. In this paper, we describe our quadrotor system which is able to smoothly navigate through mixed indoor and outdoor environments and is able to fly at speeds of more than 18 m/s. We provide an overview of our system and details about the specific component technologies that enable the high speed navigation capability of our platform. We demonstrate the robustness of our system through high speed autonomous flights and navigation through a variety of obstacle rich environments.

cs.RO↗

q-Neurons: Neuron Activations based on Stochastic Jackson's Derivative Operators

We propose a new generic type of stochastic neurons, called $q$-neurons, that considers activation functions based on Jackson's $q$-derivatives with stochastic parameters $q$. Our generalization of neural network architectures with $q$-neurons is shown to be both scalable and very easy to implement. We demonstrate experimentally consistently improved performances over state-of-the-art standard activation functions, both on training and testing loss functions.

cs.NE↗

Experimental Two-dimensional Quantum Walk on a Photonic Chip

Quantum walks, in virtue of the coherent superposition and quantum interference, possess exponential superiority over its classical counterpart in applications of quantum searching and quantum simulation. The quantum enhanced power is highly related to the state space of quantum walks, which can be expanded by enlarging the photon number and/or the dimensions of the evolution network, but the former is considerably challenging due to probabilistic generation of single photons and multiplicative loss. Here we demonstrate a two-dimensional continuous-time quantum walk by using the external geometry of photonic waveguide arrays, rather than the inner degree of freedoms of photons. Using femtosecond laser direct writing, we construct a large-scale three-dimensional structure which forms a two-dimensional lattice with up to 49X49 nodes on a photonic chip. We demonstrate spatial two-dimensional quantum walks using heralded single photons and single-photon-level imaging. We analyze the quantum transport properties via observing the ballistic evolution pattern and the variance profile, which agree well with simulation results. We further reveal the transient nature that is the unique feature for quantum walks of beyond one dimension. An architecture that allows a walk to freely evolve in all directions and a large scale, combining with defect and disorder control, may bring up powerful and versatile quantum walk machines for classically intractable problems.

quant-ph↗

Dense 3-D Mapping with Spatial Correlation via Gaussian Filtering

Constructing an occupancy representation of the environment is a fundamental problem for robot autonomy. Many accurate and efficient methods exist that address this problem but most assume that the occupancy states of different elements in the map representation are statistically independent. The focus of this paper is to provide a model that captures correlation of the occupancy of map elements. Correlation is important not only for improved accuracy but also for quantifying uncertainty in the map and for planning autonomous mapping trajectories based on the correlation among known and unknown areas. Recent work proposes Gaussian Process (GP) regression to capture covariance information and enable resolution-free occupancy estimation. The drawback of techniques based on GP regression (or classification) is that the computation complexity scales cubically with the length of the measurement history. Our main contribution is a new approach for occupancy mapping that models the binary nature of occupancy measurements precisely, via a Bernoulli distribution, and provides an efficient approximation of GP classification with complexity that does not scale with time. We prove that the error between the estimates provided by our method and those provided by GP classification is negligible. The proposed method is evaluated using both simulated data and real data collected using a Velodyne Puck 3-D range sensor.

cs.RO↗

Excellent microwave and magnetic properties of La-Cu substituted Ba-hexaferrites prepared by ceramic process

We demonstrate exceptional microwave magnetic performance of crystallographycally textured barium hexaferrites prepared by conventional ceramic method. Vibrating sample magnetometer (VSM) and rectangular cavity perturbation measurements indicate that bulk Ba0.8La0.2Fe11.2Cu0.2O19 samples exhibit a strong magnetic anisotropy field Ha of 14.6kOe, the highest remanent magnetization of 3.96kGs, and the lowest ferromagnetic resonance (FMR) linewidth of 401Oe with zero applied bias field at Q-band. Broadband millimeter-wave transmittance measurements determined the complex permeability and permittivity. The remanent magnetization, anisotropy field Ha, and effective linewidth were also estimated based on Schlomann's theory of the complex permeability. These calculated values are in good agreement with the VSM and FMR measurements.

physics.app-ph↗

Robust Stereo Visual Inertial Odometry for Fast Autonomous Flight

In recent years, vision-aided inertial odometry for state estimation has matured significantly. However, we still encounter challenges in terms of improving the computational efficiency and robustness of the underlying algorithms for applications in autonomous flight with micro aerial vehicles in which it is difficult to use high quality sensors and pow- erful processors because of constraints on size and weight. In this paper, we present a filter-based stereo visual inertial odometry that uses the Multi-State Constraint Kalman Filter (MSCKF) [1]. Previous work on stereo visual inertial odometry has resulted in solutions that are computationally expensive. We demonstrate that our Stereo Multi-State Constraint Kalman Filter (S-MSCKF) is comparable to state-of-art monocular solutions in terms of computational cost, while providing signifi- cantly greater robustness. We evaluate our S-MSCKF algorithm and compare it with state-of-art methods including OKVIS, ROVIO, and VINS-MONO on both the EuRoC dataset, and our own experimental datasets demonstrating fast autonomous flight with maximum speed of 17.5m/s in indoor and outdoor environments. Our implementation of the S-MSCKF is available at https://github.com/KumarRobotics/msckf_vio.

cs.RO↗