arXiv subjects

Xuejun Yang

Publications and source records attributed to Xuejun Yang.

12 recordsLinked to original sources

arXiv2025

Learning High-Quality Initial Noise for Single-View Synthesis with Diffusion Models

Single-view novel view synthesis (NVS) models based on diffusion models have recently attracted increasing attention, as they can generate a series of novel view images from a single image prompt and camera pose information as conditions. It has been observed that in diffusion models, certain high-quality initial noise patterns lead to better generation results than others. However, there remains a lack of dedicated learning frameworks that enable NVS models to learn such high-quality noise. To obtain high-quality initial noise from random Gaussian noise, we make the following contributions. First, we design a discretized Euler inversion method to inject image semantic information into random noise, thereby constructing paired datasets of random and high-quality noise. Second, we propose a learning framework based on an encoder-decoder network (EDN) that directly transforms random noise into high-quality noise. Experiments demonstrate that the proposed EDN can be seamlessly plugged into various NVS models, such as SV3D and MV-Adapter, achieving significant performance improvements across multiple datasets. Code is available at: https://github.com/zhihao0512/EDN.

cs.CV↗

arXiv2022

Large-scale full-programmable quantum walk and its applications

With photonics, the quantum computational advantage has been demonstrated on the task of boson sampling. Next, developing quantum-enhanced approaches for practical problems becomes one of the top priorities for photonic systems. Quantum walks are powerful kernels for developing new and useful quantum algorithms. Here we realize large-scale quantum walks using a fully programmable photonic quantum computing system. The system integrates a silicon quantum photonic chip, enabling the simulation of quantum walk dynamics on graphs with up to 400 vertices and possessing full programmability over quantum walk parameters, including the particle property, initial state, graph structure, and evolution time. In the 400-dimensional Hilbert space, the average fidelity of random entangled quantum states after the whole on-chip circuit evolution reaches as high as 94.29$\pm$1.28$\%$. With the system, we demonstrated exponentially faster hitting and quadratically faster mixing performance of quantum walks over classical random walks, achieving more than two orders of magnitude of enhancement in the experimental hitting efficiency and almost half of the reduction in the experimental evolution time for mixing. We utilize the system to implement a series of quantum applications, including measuring the centrality of scale-free networks, searching targets on Erd\"{o}s-R\'{e}nyi networks, distinguishing non-isomorphic graph pairs, and simulating the topological phase of higher-order topological insulators. Our work shows one feasible path for quantum photonics to address applications of practical interests in the near future.

quant-ph↗

arXiv2020

General Quantum Bernoulli Factory: Framework Analysis and Experiments

The unremitting pursuit for quantum advantages gives rise to the discovery of a quantum-enhanced randomness processing named quantum Bernoulli factory (QBF). This quantum enhanced process can show its priority over the corresponding classical process through readily available experimental resources, thus in the near term it may be capable of accelerating the applications of classical Bernoulli factories, such as the widely used sampling algorithms. In this work, we provide the framework analysis of the QBF. We thoroughly analyze the quantum state evolution in this process, discovering the field structure of the constructible quantum states. Our framework analysis shows that naturally, the previous works can be described as specific instances of this framework. Then, as a proof of principle, we experimentally demonstrate this framework via an entangled two-photon source along with a reconfigurable photonic logic, and show the advantages of the QBF over the classical model through a classically infeasible instance. These results may stimulate the discovery of advantages of the quantum randomness processing in a wider range of tasks, as well as its potential applications.

quant-ph↗

arXiv2019

Variational Quantum Circuits for Quantum State Tomography

Quantum state tomography is a key process in most quantum experiments. In this work, we employ quantum machine learning for state tomography. Given an unknown quantum state, it can be learned by maximizing the fidelity between the output of a variational quantum circuit and this state. The number of parameters of the variational quantum circuit grows linearly with the number of qubits and the circuit depth, so that only polynomial measurements are required, even for highly-entangled states. After that, a subsequent classical circuit simulator is used to transform the information of the target quantum state from the variational quantum circuit into a familiar format. We demonstrate our method by performing numerical simulations for the tomography of the ground state of a one-dimensional quantum spin chain, using a variational quantum circuit simulator. Our method is suitable for near-term quantum computing platforms, and could be used for relatively large-scale quantum state tomography for experimentally relevant quantum states.

quant-ph↗

arXiv2019

Sample caching Markov chain Monte Carlo approach to boson sampling simulation

Boson sampling is a promising candidate for quantum supremacy. It requires to sample from a complicated distribution, and is trusted to be intractable on classical computers. Among the various classical sampling methods, the Markov chain Monte Carlo method is an important approach to the simulation and validation of boson sampling. This method however suffers from the severe sample loss issue caused by the autocorrelation of the sample sequence. Addressing this, we propose the sample caching Markov chain Monte Carlo method that eliminates the correlations among the samples, and prevents the sample loss at the meantime, allowing more efficient simulation of boson sampling. Moreover, our method can be used as a general sampling framework that can benefit a wide range of sampling tasks, and is particularly suitable for applications where a large number of samples are taken.

quant-ph↗

arXiv2019

Experimental Evidence of the Topological Surface States in Mg3Bi2 Films Grown by Molecular Beam Epitaxy

Type-II nodal line semimetal (NLS) is a new quantum state hosting one-dimensional closed loops formed by the crossing of two bands which have the same sign in their slopes along the radial direction of the loop. According to the theoretical prediction, Mg3Bi2 is an ideal candidate for studying the type-II NLS by tuning its spin-orbit coupling (SOC). In this paper, high quality Mg3Bi2 films are grown by molecular beam epitaxy (MBE). By in-situ angle resolved photoemission spectroscopy (ARPES), a pair of surface resonance bands (SRBs) around Gamma point is clearly seen. It shows that Mg3Bi2 films grown by MBE is Mg(1)-terminated by comparing the ARPES data with the first principles calculations results. And, the temperature dependent weak anti-localization (WAL) effect in Mg3Bi2 films is observed under low magnetic field, which shows a clear two dimensional (2D) e-e scattering characteristics by fitting with the Hikami-Larkin-Nagaoka (HLN) model. Combining with ARPES, magneto-transport measurements and the first principles calculations, this work proves that Mg3Bi2 is a semimetal with topological surface states TSSs, which paves the way for Mg3Bi2 as an ideal materials platform for studying the exotic features of type-II nodal line semimetals (NLSs) and the topological phase transition by tuning its SOC.

cond-mat.mtrl-sci↗

arXiv2017

CNN Feature boosted SeqSLAM for Real-Time Loop Closure Detection

Loop closure detection (LCD) is an indispensable part of simultaneous localization and mapping systems (SLAM); it enables robots to produce a consistent map by recognizing previously visited places. When robots operate over extended periods, robustness to viewpoint and condition changes as well as satisfactory real-time performance become essential requirements for a practical LCD system. This paper presents an approach to directly utilize the outputs at the intermediate layer of a pre-trained convolutional neural network (CNN) as image descriptors. The matching location is determined by matching the image sequences through a method called SeqCNNSLAM. The utility of SeqCNNSLAM is comprehensively evaluated in terms of viewpoint and condition invariance. Experiments show that SeqCNNSLAM outperforms state-of-the-art LCD systems, such as SeqSLAM and Change Removal, in most cases. To allow for the real-time performance of SeqCNNSLAM, an acceleration method, A-SeqCNNSLAM, is established. This method exploits the location relationship between the matching images of adjacent images to reduce the matching range of the current image. Results demonstrate that acceleration of 4-6 is achieved with minimal accuracy degradation, and the method's runtime satisfies the real-time demand. To extend the applicability of A-SeqCNNSLAM to new environments, a method called O-SeqCNNSLAM is established for the online adjustment of the parameters of A-SeqCNNSLAM.

cs.RO↗

arXiv2016

A Benchmark Test of Boson Sampling on Tianhe-2 Supercomputer

Boson sampling, thought to be intractable classically, can be solved by a quantum machine composed of merely generation, linear evolution and detection of single photons. Such an analog quantum computer for this specific problem provides a shortcut to boost the absolute computing power of quantum computers to beat classical ones. However, the capacity bound of classical computers for simulating boson sampling has not yet been identified. Here we simulate boson sampling on the Tianhe-2 supercomputer which occupied the first place in the world ranking six times from 2013 to 2016. We computed the permanent of the largest matrix using up to 312,000 CPU cores of Tianhe-2, and inferred from the current most efficient permanent-computing algorithms that an upper bound on the performance of Tianhe-2 is one 50-photon sample per ~100 min. In addition, we found a precision issue with one of two permanent-computing algorithms.

quant-ph↗

arXiv2015

Joint Communication-Motion Planning in Wireless-Connected Robotic Networks: Overview and Design Guidelines

Recent years have witnessed the prosperity of robots and in order to support consensus and cooperation for multi-robot system, wireless communications and networking among robots and the infrastructure have become indispensable. In this technical note, we first provide an overview of the research contributions on communication-aware motion planning (CAMP) in designing wireless-connected robotic networks (WCRNs), where the degree-of-freedom (DoF) provided by motion and communication capabilities embraced by the robots have not been fully exploited. Therefore, we propose the framework of joint communication-motion planning (JCMP) as well as the architecture for incorporating JCMP in WCRNs. The proposed architecture is motivated by the observe-orient-decision-action (OODA) model commonly adopted in robotic motion control and cognitive radio. Then, we provide an overview of the orient module that quantify the connectivity assessment. Afterwards, we highlight the JCMP module and compare it with the conventional communication-planning, where the necessity of the JCMP is validated via both theoretical analysis and simulation results of an illustrative example. Finally, a series of open problems are discussed, which picture the gap between the state-of-the-art and a practical WCRN.

cs.RO↗

arXiv2012

One possible interaction-inertial interaction

Proposed in this paper is a possible interaction which exists in nature - inertial interaction. It gives matter an inertia and inertial mass. The formula of inertial mass has been derived. It is possible that inertial interaction leads to the redshifts of quasars, the rotation curve of spiral galaxy, the accelerating expansion of the universe, and the stronger gravitational lens effects of quasars, galaxies, or clusters of galaxies. Einstein's Gravitational Equation has been modified. Gravitational redshift, perihelion precession, and bending of light in spherically symmetric vacuum gravitational field are calculated. The differential equations of static spherically symmetric star's internal evolution are given. The accelerating expansion stage of the universe evolution equations are derived. The evolution of the universe is periodic. Time does not have an origin. There is no Big Bang. Although there is divergent singularity, there is no universe's singularity of incomplete geodesic. There are no horizon problem and no flatness problem. The problems that may exist are discussed.

physics.gen-ph↗

arXiv2003

Killing Reduction of 5-Dimensional Spacetimes

In a 5-dimensional spacetime ($M,g_{ab}$) with a Killing vector field $ξ^a$ which is either everywhere timelike or everywhere spacelike, the collection of all trajectories of $ξ^a$ gives a 4-dimensional space $S$. The reduction of ($M,g_{ab}$) is studied in the geometric language, which is a generalization of Geroch's method for the reduction of 4-dimensional spacetime. A 4-dimensional gravity coupled to a vector field and a scalar field on $S$ is obtained by the reduction of vacuum Einstein's equations on $M$, which gives also an alternative description of the 5-dimensional Kaluza-Klein theory. Besides the symmetry-reduced action from the Hilbert action on $M$, an alternative action of the fields on $S$ is also obtained, the variations of which lead to the same fields equations as those reduced from the vacuum Einstein equation on $M$.

gr-qc↗

arXiv2003

Actions for Vacuum Einstein's Equation with a Killing Symmetry

In a space-time $M$ with a Killing vector field $ξ^a$ which is either everywhere timelike or everywhere spacelike, the collection of all trajectories of $ξ^a$ gives a 3-dimension space $S$. Besides the symmetry-reduced action from that of Einstein-Hilbert, an alternative action of the fields on $S$ is also proposed, which gives the same fields equations as those reduced from the vacuum Einstein equation on $M$.

gr-qc↗