SearcharxivSearch

arXiv subjects

Minghua Pan

Publications and source records attributed to Minghua Pan.

10 recordsLinked to original sources

CausalGS: Learning Physical Causality of 3D Dynamic Scenes with Gaussian Representations

Learning a physical model from video data that can comprehend physical laws and predict the future trajectories of objects is a formidable challenge in artificial intelligence. Prior approaches either leverage various Partial Differential Equations (PDEs) as soft constraints in the form of PINN losses, or integrate physics simulators into neural networks; however, they often rely on strong priors or high-quality geometry reconstruction. In this paper, we propose CausalGS, a framework that learns the causal dynamics of complex dynamic 3D scenes solely from multi-view videos, while dispensing with the reliance on explicit priors. At its core is an inverse physics inference module that decouples the complex dynamics problem from the video into the joint inference of two factors: the initial velocity field representing the scene's kinematics, and the intrinsic material properties governing its dynamics. This inferred physical information is then utilized within a differentiable physics simulator to guide the learning process in a physics-regularized manner. Extensive experiments demonstrate that CausalGS surpasses the state-of-the-art on the highly challenging task of long-term future frame extrapolation, while also exhibiting advanced performance in novel view interpolation. Crucially, our work shows that, without any human annotation, the model is able to learn the complex interactions between multiple physical properties and understand the causal relationships driving the scene's dynamic evolution, solely from visual observations.

cs.CV

GS-DMSR: Dynamic Sensitive Multi-scale Manifold Enhancement for Accelerated High-Quality 3D Gaussian Splatting

In the field of 3D dynamic scene reconstruction, how to balance model convergence rate and rendering quality has long been a critical challenge that urgently needs to be addressed, particularly in high-precision modeling of scenes with complex dynamic motions. To tackle this issue, this study proposes the GS-DMSR method. By quantitatively analyzing the dynamic evolution process of Gaussian attributes, this mechanism achieves adaptive gradient focusing, enabling it to dynamically identify significant differences in the motion states of Gaussian models. It then applies differentiated optimization strategies to Gaussian models with varying degrees of significance, thereby significantly improving the model convergence rate. Additionally, this research integrates a multi-scale manifold enhancement module, which leverages the collaborative optimization of an implicit nonlinear decoder and an explicit deformation field to enhance the modeling efficiency for complex deformation scenes. Experimental results demonstrate that this method achieves a frame rate of up to 96 FPS on synthetic datasets, while effectively reducing both storage overhead and training time.Our code and data are available at https://anonymous.4open.science/r/GS-DMSR-2212.

cs.CV

The probabilistic combinatorial attacks on atmospheric continuous-variable quantum secret sharing

The combination of quantum secret sharing (QSS) and continuous-variable quantum key distribution (CV-QKD) has demonstrated clear advantages and has undergone significant development in recent years. However, research on the practical security of CV-QSS remains limited, particularly in the context of free-space channels, which exhibit considerable flexibility. In this paper, we study the practical security of free-space CV-QSS, innovatively propose an attack strategy that probabilistically combines two-point distribution attack (TDA) and uniform distribution attack (UDA). We also establish channel parameter models, especially a channel noise model based on local local oscillators (LLO), to further evaluate the key rate. In principle, the analysis can be extended to any number of probabilistic combinations of channel manipulation attacks. The numerical results demonstrate that the probabilistic combination attacks reduce the real key rate of CV-QSS under moderate intensity turbulence, but still enable secure QSS at a distance of 8 km on a scale of hundreds. However, it should be noted that the probabilistic combination attacks will make the deviation between the estimated key rate and the real key rate, i.e., the key rate is overestimated, which may pose a security risk.

quant-ph

Free-space Continuous-variable Quantum Secret Sharing

Free-space quantum cryptography has the potential to enable global quantum communication. However, most existing continuous-variable quantum secret sharing (CV-QSS) schemes rely on fiber channels. In this paper, we present a CV-QSS protocol designed for free-space transmission and construct models of crucial parameters, including channel transmittance, excess noise, and interruption probability, thus deriving the bound of the secret key rate. In particular, we provide a multi-source excess noise model for free-space CV-QSS based on the local local oscillator (LLO) scheme and a straightforward optimization of the noise. Furthermore, our research considers the impact of atmospheric turbulence on the protocol. Simulation results demonstrate that the intensification of atmospheric turbulence adversely affects the aforementioned crucial parameters, leading to a significant reduction in the key rate. However, our protocol shows its capability to securely share secrets over a distance of exceeding $60$ km among five participants in the presence of turbulence with $C^2_n=1\times 10^{-15}m^{-2/3}$, while maintaining a high key rate of approximately $0.55$ bit/pulse over a distance of $10$ km across twenty participants. These findings suggest that efficient CV-QSS in free space is indeed achievable. This research may serve as a reference for the design and optimization of the practical CV-QSS system.

quant-ph

Lifting query complexity to time-space complexity for two-way finite automata

Time-space tradeoff has been studied in a variety of models, such as Turing machines, branching programs, and finite automata, etc. While communication complexity as a technique has been applied to study finite automata, it seems it has not been used to study time-space tradeoffs of finite automata. We design a new technique showing that separations of query complexity can be lifted, via communication complexity, to separations of time-space complexity of two-way finite automata. As an application, one of our main results exhibits the first example of a language $L$ such that the time-space complexity of two-way probabilistic finite automata with a bounded error (2PFA) is $\widetildeΩ(n^2)$, while of exact two-way quantum finite automata with classical states (2QCFA) is $\widetilde{O}(n^{5/3})$, that is, we demonstrate for the first time that exact quantum computing has an advantage in time-space complexity comparing to classical computing.

cs.CC

Detection and evaluation of abnormal user behavior based on quantum generation adversarial network

Quantum computing holds tremendous potential for processing high-dimensional data, capitalizing on the unique capabilities of superposition and parallelism within quantum states. As we navigate the noisy intermediate-scale quantum (NISQ) era, the exploration of quantum computing applications has emerged as a compelling frontier. One area of particular interest within the realm of cyberspace security is Behavior Detection and Evaluation (BDE). Notably, the detection and evaluation of internal abnormal behaviors pose significant challenges, given their infrequent occurrence or even their concealed nature amidst vast volumes of normal data. In this paper, we introduce a novel quantum behavior detection and evaluation algorithm (QBDE) tailored for internal user analysis. The QBDE algorithm comprises a Quantum Generative Adversarial Network (QGAN) in conjunction with a classical neural network for detection and evaluation tasks. The QGAN is built upon a hybrid architecture, encompassing a Quantum Generator ($G_Q$) and a Classical Discriminator ($D_C$). $G_Q$, designed as a parameterized quantum circuit (PQC), collaborates with $D_C$, a classical neural network, to collectively enhance the analysis process. To address the challenge of imbalanced positive and negative samples, $G_Q$ is employed to generate negative samples. Both $G_Q$ and $D_C$ are optimized through gradient descent techniques. Through extensive simulation tests and quantitative analyses, we substantiate the effectiveness of the QBDE algorithm in detecting and evaluating internal user abnormal behaviors. Our work not only introduces a novel approach to abnormal behavior detection and evaluation but also pioneers a new application scenario for quantum algorithms. This paradigm shift underscores the promising prospects of quantum computing in tackling complex cybersecurity challenges.

quant-ph

Performance of Grover's search algorithm with diagonalizable collective noises

Grover's search algorithm (GSA) is known to experience a loss of its quadratic speedup when exposed to quantum noise. In this study, we partially agree with this result and present our findings. First, we examine different typical diagonalizable noises acting on the oracles in GSA and find that the success probability decreases and oscillates around $1/2$ as the number of iterations increases. Secondly, our results show that the performance of GSA can be improved by certain types of noise, such as bit flip and bit-phase flip noise. Finally, we determine the noise threshold for bit-phase flip noise to achieve a desired success probability and demonstrate that GSA with bit-phase flip noise still outperforms its classical counterpart. These results suggest new avenues for research in noisy intermediate-scale quantum (NISQ) computing, such as evaluating the feasibility of quantum algorithms with noise and exploring their applications in machine learning.

quant-ph

Complementarity between Success Probability and Coherence in Grover Search Algorithm

Coherence plays a very important role in Grover search algorithm (GSA). In this paper, we define the normalization coherence N(C), where C is a coherence measurement. In virtue of the constraint of large N and Shannon's maximum entropy principle, a surprising complementary relationship between the coherence and the success probability of GSA is obtained. Namely, P_s(t)+N(C(t))\simeq 1, where C is in terms of the relative entropy of coherence and l_1 norm of coherence, t is the number of the search iterations in GSA. Moreover, the equation holds no matter in ideal or noisy environments. Considering the number of qubits is limited in the recent noisy intermediate-scale quantum (NISQ) era, some exact numerical calculation experiments are presented for different database sizes N with different types of noises. The results show that the complementary between the success probability and the coherence almost always hold. This work provides a new perspective to improve the success probability by manipulating its complementary coherence, and vice versa. It has an excellent potential for helping quantum algorithms design in the NISQ era.

quant-ph

Quantum continual learning of quantum data realizing knowledge backward transfer

For the goal of strong artificial intelligence that can mimic human-level intelligence, AI systems would have the ability to adapt to ever-changing scenarios and learn new knowledge continuously without forgetting previously acquired knowledge. When a machine learning model is consecutively trained on multiple tasks that come in sequence, its performance on previously learned tasks may drop dramatically during the learning process of the newly seen task. To avoid this phenomenon termed catastrophic forgetting, continual learning, also known as lifelong learning, has been proposed and become one of the most up-to-date research areas of machine learning. As quantum machine learning blossoms in recent years, it is interesting to develop quantum continual learning. This paper focuses on the case of quantum models for quantum data where the computation model and the data to be processed are both quantum. The gradient episodic memory method is incorporated to design a quantum continual learning scheme that overcomes catastrophic forgetting and realizes knowledge backward transfer. Specifically, a sequence of quantum state classification tasks is continually learned by a variational quantum classifier whose parameters are optimized by a classical gradient-based optimizer. The gradient of the current task is projected to the closest gradient, avoiding the increase of the loss at previous tasks, but allowing the decrease. Numerical simulation results show that our scheme not only overcomes catastrophic forgetting, but also realize knowledge backward transfer, which means the classifier's performance on previous tasks is enhanced rather than compromised while learning a new task.

quant-ph

Global multipartite entanglement dynamics in Grover's search algorithm

Entanglement is considered to be one of the primary reasons for why quantum algorithms are more efficient than their classical counterparts for certain computational tasks. The global multipartite entanglement of the multiqubit states in Grover's search algorithm can be quantified using the geometric measure of entanglement (GME). Rossi {\em et al.} (Phys. Rev. A \textbf{87}, 022331 (2013)) found that the entanglement dynamics is scale invariant for large $n$. Namely, the GME does not depend on the number $n$ of qubits; rather, it only depends on the ratio of iteration $k$ to the total iteration. In this paper, we discuss the optimization of the GME for large $n$. We prove that ``the GME is scale invariant'' does not always hold. We show that there is generally a turning point that can be computed in terms of the number of marked states and their Hamming weights during the curve of the GME. The GME is scale invariant prior to the turning point. However, the GME is not scale invariant after the turning point since it also depends on $n$ and the marked states.

quant-ph