Search

Measurement-device-independent entanglement witnesses (MDI-EWs) enable the detection of entanglement without relying on characterized measurements. However, the entanglement criteria for MDI-EWs typically assume the idealized condition that the lab input states are precisely the desired ones. In this work, we remove this idealization by considering the realistic scenario in which lab input states may be imprecise. We introduce a new class of MDI-EWs, termed sensitive MDI-EWs, whose entanglement criteria fail under any non-zero imprecision in the input states. We derive sufficient conditions for an MDI-EW to be classified as sensitive, revealing that a large class of MDI-EWs exhibit this sensitivity. Additionally, we demonstrate that two well-known MDI-EWs for Werner states are sensitive according to our criteria, one of which recovers the result from a previous study [Phys. Rev. A 104, 012429 (2021)]. Moreover, we clarify the concept of lab input states in a way that makes imprecisions experimentally measurable, and propose a systematic approach for modifying the criterion of any MDI-EW to accommodate small imprecisions, thus enhancing experimental relevance. A simple MDI-EW example is provided, where our modified criterion is already optimal. This work bridges the gap between idealized theoretical models and practical experimental conditions, paving the way for more robust and accessible entanglement detection in real-world settings., Comment: 12 pages, 0 figure

Existing multi-view image generation methods often make invasive modifications to pre-trained text-to-image (T2I) models and require full fine-tuning, leading to (1) high computational costs, especially with large base models and high-resolution images, and (2) degradation in image quality due to optimization difficulties and scarce high-quality 3D data. In this paper, we propose the first adapter-based solution for multi-view image generation, and introduce MV-Adapter, a versatile plug-and-play adapter that enhances T2I models and their derivatives without altering the original network structure or feature space. By updating fewer parameters, MV-Adapter enables efficient training and preserves the prior knowledge embedded in pre-trained models, mitigating overfitting risks. To efficiently model the 3D geometric knowledge within the adapter, we introduce innovative designs that include duplicated self-attention layers and parallel attention architecture, enabling the adapter to inherit the powerful priors of the pre-trained models to model the novel 3D knowledge. Moreover, we present a unified condition encoder that seamlessly integrates camera parameters and geometric information, facilitating applications such as text- and image-based 3D generation and texturing. MV-Adapter achieves multi-view generation at 768 resolution on Stable Diffusion XL (SDXL), and demonstrates adaptability and versatility. It can also be extended to arbitrary view generation, enabling broader applications. We demonstrate that MV-Adapter sets a new quality standard for multi-view image generation, and opens up new possibilities due to its efficiency, adaptability and versatility., Comment: Project page: https://huanngzh.github.io/MV-Adapter-Page/

This paper introduces MIDI, a novel paradigm for compositional 3D scene generation from a single image. Unlike existing methods that rely on reconstruction or retrieval techniques or recent approaches that employ multi-stage object-by-object generation, MIDI extends pre-trained image-to-3D object generation models to multi-instance diffusion models, enabling the simultaneous generation of multiple 3D instances with accurate spatial relationships and high generalizability. At its core, MIDI incorporates a novel multi-instance attention mechanism, that effectively captures inter-object interactions and spatial coherence directly within the generation process, without the need for complex multi-step processes. The method utilizes partial object images and global scene context as inputs, directly modeling object completion during 3D generation. During training, we effectively supervise the interactions between 3D instances using a limited amount of scene-level data, while incorporating single-object data for regularization, thereby maintaining the pre-trained generalization ability. MIDI demonstrates state-of-the-art performance in image-to-scene generation, validated through evaluations on synthetic data, real-world scene data, and stylized scene images generated by text-to-image diffusion models., Comment: Project page: https://huanngzh.github.io/MIDI-Page/

Decomposing physically-based materials from images into their constituent properties remains challenging, particularly when maintaining both computational efficiency and physical consistency. While recent diffusion-based approaches have shown promise, they face substantial computational overhead due to multiple denoising steps and separate models for different material properties. We present SuperMat, a single-step framework that achieves high-quality material decomposition with one-step inference. This enables end-to-end training with perceptual and re-render losses while decomposing albedo, metallic, and roughness maps at millisecond-scale speeds. We further extend our framework to 3D objects through a UV refinement network, enabling consistent material estimation across viewpoints while maintaining efficiency. Experiments demonstrate that SuperMat achieves state-of-the-art PBR material decomposition quality while reducing inference time from seconds to milliseconds per image, and completes PBR material estimation for 3D objects in approximately 3 seconds. The project page is at https://hyj542682306.github.io/SuperMat/., Comment: https://hyj542682306.github.io/SuperMat/

While high-quality texture maps are essential for realistic 3D asset rendering, few studies have explored learning directly in the texture space, especially on large-scale datasets. In this work, we depart from the conventional approach of relying on pre-trained 2D diffusion models for test-time optimization of 3D textures. Instead, we focus on the fundamental problem of learning in the UV texture space itself. For the first time, we train a large diffusion model capable of directly generating high-resolution texture maps in a feed-forward manner. To facilitate efficient learning in high-resolution UV spaces, we propose a scalable network architecture that interleaves convolutions on UV maps with attention layers on point clouds. Leveraging this architectural design, we train a 700 million parameter diffusion model that can generate UV texture maps guided by text prompts and single-view images. Once trained, our model naturally supports various extended applications, including text-guided texture inpainting, sparse-view texture completion, and text-driven texture synthesis. Project page is at http://cvmi-lab.github.io/TEXGen/., Comment: Accepted to SIGGRAPH Asia Journal Article (TOG 2024)

3D part segmentation is a crucial and challenging task in 3D perception, playing a vital role in applications such as robotics, 3D generation, and 3D editing. Recent methods harness the powerful Vision Language Models (VLMs) for 2D-to-3D knowledge distillation, achieving zero-shot 3D part segmentation. However, these methods are limited by their reliance on text prompts, which restricts the scalability to large-scale unlabeled datasets and the flexibility in handling part ambiguities. In this work, we introduce SAMPart3D, a scalable zero-shot 3D part segmentation framework that segments any 3D object into semantic parts at multiple granularities, without requiring predefined part label sets as text prompts. For scalability, we use text-agnostic vision foundation models to distill a 3D feature extraction backbone, allowing scaling to large unlabeled 3D datasets to learn rich 3D priors. For flexibility, we distill scale-conditioned part-aware 3D features for 3D part segmentation at multiple granularities. Once the segmented parts are obtained from the scale-conditioned part-aware 3D features, we use VLMs to assign semantic labels to each part based on the multi-view renderings. Compared to previous methods, our SAMPart3D can scale to the recent large-scale 3D object dataset Objaverse and handle complex, non-ordinary objects. Additionally, we contribute a new 3D part segmentation benchmark to address the lack of diversity and complexity of objects and parts in existing benchmarks. Experiments show that our SAMPart3D significantly outperforms existing zero-shot 3D part segmentation methods, and can facilitate various applications such as part-level editing and interactive segmentation., Comment: Project Page: https://yhyang-myron.github.io/SAMPart3D-website/

This study investigates Neutral Triple Gauge Couplings (nTGCs) through $ZZ$ production at future electron-positron colliders. The impact of beam polarization on cross section is analyzed. We compare the signals and backgrounds for five different $ZZ$ decay channels and present our event selection strategies for future $e^+e^-$ colliders. The expected coefficient constraints for each decay channels are provided, and final expected constraints are derived by combining results from the different decay patterns. Our analysis indicates that future electron-positron colliders will have significantly enhanced detection capabilities for nTGCs compared to the current LHC experiments, with expected improvements in constraints by one to two orders of magnitude., Comment: 36 pages, 25 figures, 19 tables

We introduce DreamCraft3D++, an extension of DreamCraft3D that enables efficient high-quality generation of complex 3D assets. DreamCraft3D++ inherits the multi-stage generation process of DreamCraft3D, but replaces the time-consuming geometry sculpting optimization with a feed-forward multi-plane based reconstruction model, speeding up the process by 1000x. For texture refinement, we propose a training-free IP-Adapter module that is conditioned on the enhanced multi-view images to enhance texture and geometry consistency, providing a 4x faster alternative to DreamCraft3D's DreamBooth fine-tuning. Experiments on diverse datasets demonstrate DreamCraft3D++'s ability to generate creative 3D assets with intricate geometry and realistic 360{\deg} textures, outperforming state-of-the-art image-to-3D methods in quality and speed. The full implementation will be open-sourced to enable new possibilities in 3D content creation., Comment: Project Page: https://dreamcraft3dplus.github.io/

In the presence of system-environment coupling, classical complex systems undergo stochastic dynamics, where rich phenomena can emerge at large spatio-temporal scales. To investigate these phenomena, numerical approaches for simulating stochastic dynamics are indispensable and can be computationally expensive. In light of the recent fast development in machine learning techniques, here, we establish a generic machine learning approach to simulate the stochastic dynamics, dubbed the noise-aware neural network (NANN). One key feature of this approach is its ability to generate the long-time stochastic dynamics of complex large-scale systems by just training NANN with the one-step dynamics of smaller-scale systems, thus reducing the computational cost. Furthermore, this NANN based approach is quite generic. Case-by-case special design of the architecture of NANN is not necessary when it is employed to investigate different stochastic complex systems. Using the noisy Kuramoto model and the Vicsek model as concrete examples, we demonstrate its capability in simulating stochastic dynamics. We believe that this novel machine learning approach can be a useful tool in investigating the large spatio-temporal scaling behavior of complex systems subjected to the influences of the environmental noise., Comment: 7 pages, 3 figures

In this paper, we propose an RADI-type method for large-scale stochastic continuous-time algebraic Riccati equations with sparse and low-rank matrices. This new variant of RADI-type methods is developed by integrating the core concept of the original RADI method with the implicit appearance of the left semi-tensor product in stochastic continuous-time algebraic Riccati equations.The method employs different shifts to accelerate convergence and uses compression techniques to reduce storage requirements and computational complexity.Unlike many existing methods for large-scale problems such as Newton-type methods and homotopy method, it calculates the residual at a low cost and does not require a stabilizing initial approximation, which can often be challenging to find. Numerical experiments are provided to demonstrate its efficiency., Comment: 21 pages, 2 figures, 2 tables

Self-supervised monocular depth estimation is of significant importance with applications spanning across autonomous driving and robotics. However, the reliance on self-supervision introduces a strong static-scene assumption, thereby posing challenges in achieving optimal performance in dynamic scenes, which are prevalent in most real-world situations. To address these issues, we propose PPEA-Depth, a Progressive Parameter-Efficient Adaptation approach to transfer a pre-trained image model for self-supervised depth estimation. The training comprises two sequential stages: an initial phase trained on a dataset primarily composed of static scenes, succeeded by an expansion to more intricate datasets involving dynamic scenes. To facilitate this process, we design compact encoder and decoder adapters to enable parameter-efficient tuning, allowing the network to adapt effectively. They not only uphold generalized patterns from pre-trained image models but also retain knowledge gained from the preceding phase into the subsequent one. Extensive experiments demonstrate that PPEA-Depth achieves state-of-the-art performance on KITTI, CityScapes and DDAD datasets., Comment: Accepted by AAAI 2024 Project homepage: https://yuejiangdong.github.io/PPEADepth/

Recent advancements in 3D reconstruction from single images have been driven by the evolution of generative models. Prominent among these are methods based on Score Distillation Sampling (SDS) and the adaptation of diffusion models in the 3D domain. Despite their progress, these techniques often face limitations due to slow optimization or rendering processes, leading to extensive training and optimization times. In this paper, we introduce a novel approach for single-view reconstruction that efficiently generates a 3D model from a single image via feed-forward inference. Our method utilizes two transformer-based networks, namely a point decoder and a triplane decoder, to reconstruct 3D objects using a hybrid Triplane-Gaussian intermediate representation. This hybrid representation strikes a balance, achieving a faster rendering speed compared to implicit representations while simultaneously delivering superior rendering quality than explicit representations. The point decoder is designed for generating point clouds from single images, offering an explicit representation which is then utilized by the triplane decoder to query Gaussian features for each point. This design choice addresses the challenges associated with directly regressing explicit 3D Gaussian attributes characterized by their non-structural nature. Subsequently, the 3D Gaussians are decoded by an MLP to enable rapid rendering through splatting. Both decoders are built upon a scalable, transformer-based architecture and have been efficiently trained on large-scale 3D datasets. The evaluations conducted on both synthetic datasets and real-world images demonstrate that our method not only achieves higher quality but also ensures a faster runtime in comparison to previous state-of-the-art techniques. Please see our project page at https://zouzx.github.io/TriplaneGaussian/., Comment: Project Page: https://zouzx.github.io/TriplaneGaussian/

Diffusion models trained on large-scale text-image datasets have demonstrated a strong capability of controllable high-quality image generation from arbitrary text prompts. However, the generation quality and generalization ability of 3D diffusion models is hindered by the scarcity of high-quality and large-scale 3D datasets. In this paper, we present PI3D, a framework that fully leverages the pre-trained text-to-image diffusion models' ability to generate high-quality 3D shapes from text prompts in minutes. The core idea is to connect the 2D and 3D domains by representing a 3D shape as a set of Pseudo RGB Images. We fine-tune an existing text-to-image diffusion model to produce such pseudo-images using a small number of text-3D pairs. Surprisingly, we find that it can already generate meaningful and consistent 3D shapes given complex text descriptions. We further take the generated shapes as the starting point for a lightweight iterative refinement using score distillation sampling to achieve high-quality generation under a low budget. PI3D generates a single 3D shape from text in only 3 minutes and the quality is validated to outperform existing 3D generative models by a large margin., Comment: Accepted by CVPR 2024

Utilizing pre-trained 2D large-scale generative models, recent works are capable of generating high-quality novel views from a single in-the-wild image. However, due to the lack of information from multiple views, these works encounter difficulties in generating controllable novel views. In this paper, we present DreamComposer, a flexible and scalable framework that can enhance existing view-aware diffusion models by injecting multi-view conditions. Specifically, DreamComposer first uses a view-aware 3D lifting module to obtain 3D representations of an object from multiple views. Then, it renders the latent features of the target view from 3D representations with the multi-view feature fusion module. Finally the target view features extracted from multi-view inputs are injected into a pre-trained diffusion model. Experiments show that DreamComposer is compatible with state-of-the-art diffusion models for zero-shot novel view synthesis, further enhancing them to generate high-fidelity novel view images with multi-view conditions, ready for controllable 3D object reconstruction and various other applications., Comment: Project Page: https://yhyang-myron.github.io/DreamComposer/

The search of the new physics~(NP) beyond the Standard Model is one of the most important topics in current high energy physics. With the increasing luminosities at the colliders, the search for NP signals requires the analysis of more and more data, and the efficiency in data processing becomes particularly important. As a machine learning algorithm, support vector machine~(SVM) is expected to to be useful in the search of NP. Meanwhile, the quantum computing has the potential to offer huge advantages when dealing with large amounts of data, which suggests that quantum SVM~(QSVM) is a potential tool in future phenomenological studies of the NP. How to use SVM and QSVM to optimize event selection strategies to search for NP signals are studied in this paper. Taking the tri-photon process at a muon collider as an example, it can be shown that the event selection strategies optimized by the SVM and QSVM are effective in the search of the dimension-8 operators contributing to the anomalous quartic gauge couplings., Comment: 23 pages, 9 figures

Text-to-3D generation has made remarkable progress recently, particularly with methods based on Score Distillation Sampling (SDS) that leverages pre-trained 2D diffusion models. While the usage of classifier-free guidance is well acknowledged to be crucial for successful optimization, it is considered an auxiliary trick rather than the most essential component. In this paper, we re-evaluate the role of classifier-free guidance in score distillation and discover a surprising finding: the guidance alone is enough for effective text-to-3D generation tasks. We name this method Classifier Score Distillation (CSD), which can be interpreted as using an implicit classification model for generation. This new perspective reveals new insights for understanding existing techniques. We validate the effectiveness of CSD across a variety of text-to-3D tasks including shape generation, texture synthesis, and shape editing, achieving results superior to those of state-of-the-art methods. Our project page is https://xinyu-andy.github.io/Classifier-Score-Distillation, Comment: Our project page is https://xinyu-andy.github.io/Classifier-Score-Distillation

In this work, we introduce Wonder3D, a novel method for efficiently generating high-fidelity textured meshes from single-view images.Recent methods based on Score Distillation Sampling (SDS) have shown the potential to recover 3D geometry from 2D diffusion priors, but they typically suffer from time-consuming per-shape optimization and inconsistent geometry. In contrast, certain works directly produce 3D information via fast network inferences, but their results are often of low quality and lack geometric details. To holistically improve the quality, consistency, and efficiency of image-to-3D tasks, we propose a cross-domain diffusion model that generates multi-view normal maps and the corresponding color images. To ensure consistency, we employ a multi-view cross-domain attention mechanism that facilitates information exchange across views and modalities. Lastly, we introduce a geometry-aware normal fusion algorithm that extracts high-quality surfaces from the multi-view 2D representations. Our extensive evaluations demonstrate that our method achieves high-quality reconstruction results, robust generalization, and reasonably good efficiency compared to prior works., Comment: Project page: https://www.xxlong.site/Wonder3D/

The potential of the muon colliders open up new possibilities for the exploration of new physics beyond the Standard Model. It is worthwhile to investigate whether muon colliders are suitable for studying gluonic quartic gauge couplings~(gQGCs), which can be contributed by dimension-8 operators in the framework of the Standard Model effective field theory, and are intensively studied recently. In this paper, we study the sensitivity of the process $\mu^+\mu^-\to j j \nu\bar{\nu}$ to gQGCs. Our result indicate that the muon colliders with c.m. energies larger than $4\;{\rm TeV}$ can be more sensitive to gQGCs than the Large Hadron Collider., Comment: 20 pages, 5 figures

Achieving an immersive experience enabling users to explore virtual environments with six degrees of freedom (6DoF) is essential for various applications such as virtual reality (VR). Wide-baseline panoramas are commonly used in these applications to reduce network bandwidth and storage requirements. However, synthesizing novel views from these panoramas remains a key challenge. Although existing neural radiance field methods can produce photorealistic views under narrow-baseline and dense image captures, they tend to overfit the training views when dealing with \emph{wide-baseline} panoramas due to the difficulty in learning accurate geometry from sparse $360^{\circ}$ views. To address this problem, we propose PanoGRF, Generalizable Spherical Radiance Fields for Wide-baseline Panoramas, which construct spherical radiance fields incorporating $360^{\circ}$ scene priors. Unlike generalizable radiance fields trained on perspective images, PanoGRF avoids the information loss from panorama-to-perspective conversion and directly aggregates geometry and appearance features of 3D sample points from each panoramic view based on spherical projection. Moreover, as some regions of the panorama are only visible from one view while invisible from others under wide baseline settings, PanoGRF incorporates $360^{\circ}$ monocular depth priors into spherical depth estimation to improve the geometry features. Experimental results on multiple panoramic datasets demonstrate that PanoGRF significantly outperforms state-of-the-art generalizable view synthesis methods for wide-baseline panoramas (e.g., OmniSyn) and perspective images (e.g., IBRNet, NeuRay)., Comment: accepted to NeurIPS2023; Project Page: https://thucz.github.io/PanoGRF/

Automatic generation of fonts can be an important aid to typeface design. Many current approaches regard glyphs as pixelated images, which present artifacts when scaling and inevitable quality losses after vectorization. On the other hand, existing vector font synthesis methods either fail to represent the shape concisely or require vector supervision during training. To push the quality of vector font synthesis to the next level, we propose a novel dual-part representation for vector glyphs, where each glyph is modeled as a collection of closed "positive" and "negative" path pairs. The glyph contour is then obtained by boolean operations on these paths. We first learn such a representation only from glyph images and devise a subsequent contour refinement step to align the contour with an image representation to further enhance details. Our method, named DualVector, outperforms state-of-the-art methods in vector font synthesis both quantitatively and qualitatively. Our synthesized vector fonts can be easily converted to common digital font formats like TrueType Font for practical use. The code is released at https://github.com/thuliu-yt16/dualvector., Comment: CVPR 2023

We present a python-based program for phenomenological investigations in particle physics using machine learning algorithms, called \verb"MLAnalysis". The program is able to convert LHE and LHCO files generated by \verb"MadGraph5_aMC@NLO" into data sets for machine learning algorithms, which can analyze the information of the events. At present, it contains three machine learning (ML) algorithms: isolation forest (IF) algorithm, nested isolation forest (NIF) algorithm, kmeans anomaly detection (KMAD), and some basic functionality to analyze the kinematic features of a data set. Users can use this program to improve the efficiency of searching for new physics signals., Comment: 21 pages, 4 figures

With the emergence of neural radiance fields (NeRFs), view synthesis quality has reached an unprecedented level. Compared to traditional mesh-based assets, this volumetric representation is more powerful in expressing scene geometry but inevitably suffers from high rendering costs and can hardly be involved in further processes like editing, posing significant difficulties in combination with the existing graphics pipeline. In this paper, we present a hybrid volume-mesh representation, VMesh, which depicts an object with a textured mesh along with an auxiliary sparse volume. VMesh retains the advantages of mesh-based assets, such as efficient rendering, compact storage, and easy editing, while also incorporating the ability to represent subtle geometric structures provided by the volumetric counterpart. VMesh can be obtained from multi-view images of an object and renders at 2K 60FPS on common consumer devices with high fidelity, unleashing new opportunities for real-time immersive applications., Comment: Project page: https://bennyguo.github.io/vmesh/

3D single object tracking has been a crucial problem for decades with numerous applications such as autonomous driving. Despite its wide-ranging use, this task remains challenging due to the significant appearance variation caused by occlusion and size differences among tracked targets. To address these issues, we present MBPTrack, which adopts a Memory mechanism to utilize past information and formulates localization in a coarse-to-fine scheme using Box Priors given in the first frame. Specifically, past frames with targetness masks serve as an external memory, and a transformer-based module propagates tracked target cues from the memory to the current frame. To precisely localize objects of all sizes, MBPTrack first predicts the target center via Hough voting. By leveraging box priors given in the first frame, we adaptively sample reference points around the target center that roughly cover the target of different sizes. Then, we obtain dense feature maps by aggregating point features into the reference points, where localization can be performed more effectively. Extensive experiments demonstrate that MBPTrack achieves state-of-the-art performance on KITTI, nuScenes and Waymo Open Dataset, while running at 50 FPS on a single RTX3090 GPU.

The search for new physics beyond the Standard Model is one of the central problems of current high energy physics interest. As the luminosities of current and near-future colliders continue to increase, the search for new physics has increased the requirements for processing large amounts of data. Meanwhile, quantum computing which is rapidly evolving, has great potential to become a powerful tool to help search for new physics signals. Since the k-means algorithm is known to be able to be accelerated with the help of quantum computing, we investigate and propose an event selection strategy based on k-means algorithm to search for new physics signals. Taking the case of tri-photon processes at the muon colliders as an example, the event selection strategy is shown to be effective in helping to search for the signals of dimension-8 operators contributing to anomalous quartic gauge couplings. Compared with traditional event selection strategy, the expected constraints are generally tighter., Comment: 15 pages, 8 figures

3D single object tracking plays an essential role in many applications, such as autonomous driving. It remains a challenging problem due to the large appearance variation and the sparsity of points caused by occlusion and limited sensor capabilities. Therefore, contextual information across two consecutive frames is crucial for effective object tracking. However, points containing such useful information are often overlooked and cropped out in existing methods, leading to insufficient use of important contextual knowledge. To address this issue, we propose CXTrack, a novel transformer-based network for 3D object tracking, which exploits ConteXtual information to improve the tracking results. Specifically, we design a target-centric transformer network that directly takes point features from two consecutive frames and the previous bounding box as input to explore contextual information and implicitly propagate target cues. To achieve accurate localization for objects of all sizes, we propose a transformer-based localization head with a novel center embedding module to distinguish the target from distractors. Extensive experiments on three large-scale datasets, KITTI, nuScenes and Waymo Open Dataset, show that CXTrack achieves state-of-the-art tracking performance while running at 34 FPS.

Neural Radiance Fields (NeRF) achieve photo-realistic view synthesis with densely captured input images. However, the geometry of NeRF is extremely under-constrained given sparse views, resulting in significant degradation of novel view synthesis quality. Inspired by self-supervised depth estimation methods, we propose StructNeRF, a solution to novel view synthesis for indoor scenes with sparse inputs. StructNeRF leverages the structural hints naturally embedded in multi-view inputs to handle the unconstrained geometry issue in NeRF. Specifically, it tackles the texture and non-texture regions respectively: a patch-based multi-view consistent photometric loss is proposed to constrain the geometry of textured regions; for non-textured ones, we explicitly restrict them to be 3D consistent planes. Through the dense self-supervised depth constraints, our method improves both the geometry and the view synthesis performance of NeRF without any additional training on external data. Extensive experiments on several real-world datasets demonstrate that StructNeRF surpasses state-of-the-art methods for indoor scenes with sparse inputs both quantitatively and qualitatively.

It is well known that any $N$ orthogonal pure states can always be perfectly distinguished under local operation and classical communications (LOCC) if $(N-1)$ copies of the state are available [Phys. Rev. Lett. 85, 4972 (2000)]. It is important to reduce the number of quantum state copies that ensures the LOCC distinguishability in terms of resource saving and nonlocality strength characterization. Denote $f_r(N)$ the least number of copies needed to LOCC distinguish any $N$ orthogonal $r$-partite product states. This work will be devoted to the estimation of the upper bound of $f_r(N)$. In fact, we first relate this problem with Ramsey theory, a branch of combinatorics dedicated to studying the conditions under which orders must appear. Subsequently, we prove $f_2(N)\leq \lceil\frac{N}{6}\rceil+2$, which is better than $f_2(N)\leq \lceil\frac{N}{4}\rceil$ obtained in [Eur. Phys. J. Plus 136, 1172 (2021)] when $N>24$. We further exhibit that for arbitrary $\epsilon>0$, $f_r(N)\leq\lceil\epsilon N\rceil$ always holds for sufficiently large $N$., Comment: 13 pages

The search for magnetic monopoles has been a longstanding concern of the physics community for nearly a century. However, up to now, the existence of elementary magnetic monopoles remains an open question. The electroweak 't Hooft-Polyakov monopoles have been predicted with mass at the order of 10 TeV. This mass scale is unreachable at current colliders. Recently, the muon colliders have gained much attention in the community due to technological developments. The advantages of the muon beam encourage us to raise the high-energy option and consider the high-energy muon collider as a unique opportunity to search for magnetic monopoles. This letter discusses the production of magnetic monopoles via the annihilation process and proposes the search for magnetic monopoles at future high-energy muon colliders., Comment: 13 pages, 6 figures

Stochastic algebraic Riccati equations, also known as rational algebraic Riccati equations, arising in linear-quadratic optimal control for stochastic linear time-invariant systems, were considered to be not easy to solve. The-state-of-art numerical methods most rely on differentiability or continuity, such as Newton-type method, LMI method, or homotopy method. In this paper, we will build a novel theoretical framework and reveal the intrinsic algebraic structure appearing in this kind of algebraic Riccati equations. This structure guarantees that to solve them is almost as easy as to solve deterministic/classical ones, which will shed light on the theoretical analysis and numerical algorithm design for this topic., Comment: 17 pages

Point clouds captured by depth sensors are often contaminated by noises, obstructing further analysis and applications. In this paper, we emphasize the importance of point distribution uniformity to downstream tasks. We demonstrate that point clouds produced by existing gradient-based denoisers lack uniformity despite having achieved promising quantitative results. To this end, we propose GPCD++, a gradient-based denoiser with an ultra-lightweight network named UniNet to address uniformity. Compared with previous state-of-the-art methods, our approach not only generates competitive or even better denoising results, but also significantly improves uniformity which largely benefits applications such as surface reconstruction.

We investigate the steady-state and dynamical properties of a reciprocal many-body system consisting of self-propelled active particles with local alignment interactions that exists within a fan-shaped neighborhood of each particle. We find that the nonreciprocity can emerge in this reciprocal system once the spontaneous symmetry breaking is present, and the effective description of the system assumes a non-Hermitian structure that directly originates from the emergent nonreciprocity. This emergent nonreciprocity can impose strong influences on the properties the system. In particular, it can even drive a real-space condensation of active particles. Our findings pave the way for identifying a new class of physics in reciprocal systems that is driven by the emergent nonreciprocity., Comment: 6+1 pages, 3+1 figures

The muon collider provides a unique opportunity to study the vector boson scattering processes and dimension-8 operators contributing to anomalous quartic gauge couplings~(aQGCs). Because of the cleaner final state, it is easier to decode subprocess and certain operator couplings at a muon collider. We attempt to identify the anomalous $WWWW$ coupling in the exclusive $WW\to WW$ scattering in this paper. Since one aQGC can be induced by multiple dimension-8 operators, the study of one coupling can help to confine different operators. Meanwhile, singling out the $WW\to WW$ process can help to study the unitarity bounds. The vector boson scattering process corresponding to the anomalous $WWWW$ coupling is $\mu^+\mu^-\to \nu\nu\bar{\nu}\bar{\nu}\ell^+\ell^-$, with four (anti-)neutrinos in the final state, which brings troubles in phenomenological studies. In this paper, the machine learning method is used to tackle this problem. We find that, using the artificial neural network can extract the $W^+W^-\to W^+W^-$ contribution, and is helpful to reconstruct the center of mass energy of the subprocess which is important in the study of the Standard Model effective field theory. The sensitivities and the expected constraints on the dimension-8 operators at the muon collider with $\sqrt{s}=30$ TeV are presented. We demonstrate that the artificial neural networks exhibit great potential in the phenomenological study of processes with multiple neutrinos in the final state., Comment: 33 pages, 11 figures, 8 tables; References have been updated in the replacement

The muon collider has recently received a great deal of attention because of its ability to achieve both high energy and high luminosity. It plays as a gauge boson collider because the vector boson scattering (VBS) becomes the dominant production topology for Standard Model processes starting from a few TeV of collision energy. In this paper, we propose that the process of $\mu^+\mu^-$ annihilation into tri-photon is also very sensitive to the search of anomalous quartic gauge couplings (aQGCs). We investigate the projected constraints on the transverse operators contributing to aQGCs through $\mu^+\mu^-\to Z^\ast/\gamma^\ast\to \gamma\gamma\gamma$ at muon colliders. For the muon collider with $\sqrt{s}=3$ TeV and $\mathcal{L}=1\;{\rm ab}^{-1}$, the expected constraints are about two orders of magnitude stronger than those at the 13 TeV LHC., Comment: 19 pages, 6 figures,6 tables; References have been updated in the replacement

For performing regression tasks involved in various physics problems, enhancing the precision or equivalently reducing the uncertainty of regression results is undoubtedly one of the central goals. Here, somewhat surprisingly, we find that the unfavorable regression uncertainty in performing the regression tasks of inverse statistical problems actually contains hidden information concerning the phase transitions of the system under consideration. By utilizing this hidden information, we develop a new unsupervised machine learning approach for automated detection of phases of matter, dubbed learning from regression uncertainty. This is achieved by revealing an intrinsic connection between regression uncertainty and response properties of the system, thus making the outputs of this machine learning approach directly interpretable via conventional notions of physics. We demonstrate the approach by identifying the critical points of the ferromagnetic Ising model and the three-state clock model, and revealing the existence of the intermediate phase in the six-state and seven-state clock models. Comparing to the widely-used classification-based approaches developed so far, although successful, their recognized classes of patterns are essentially abstract, which hinders their straightforward relation to conventional notions of physics. These challenges persist even when one employs the state-of-the-art deep neural networks that excel at classification tasks. In contrast, with the core working horse being a neural network performing regression tasks, our new approach is not only practically more efficient, but also paves the way towards intriguing possibilities for unveiling new physics via machine learning in a physically interpretable manner., Comment: 11 pages, 7 figures

Nonequilibrium many-body transient dynamics play an important role in the adaptation of active matter systems environment changes. However, the generic universal behavior of such dynamics is usually elusive and left as open questions. Here, we investigate the transient dynamics of vortex-like states in a two-dimensional active matter system that consists of self-propelled particles with alignment interactions subjected to extrinsic environmental noise. We identify a universal power-law scaling for the average lifetime of vortex-like states with respect to the speed of the self-propelled particles. This universal scaling behavior manifests strong robustness against the noise, up to the level where influences from environmental fluctuations are large enough to directly randomize the moving directions of particles. Direct experimental observations can be readily performed by related experimental setups operated at a decently low noise level., Comment: 5 pages, 3 figures

Is the center position fully capable of representing a pixel? There is nothing wrong to represent pixels with their centers in a discrete image representation, but it makes more sense to consider each pixel as the aggregation of signals from a local area in an image super-resolution (SR) context. Despite the great capability of coordinate-based implicit representation in the field of arbitrary-scale image SR, this area's nature of pixels is not fully considered. To this end, we propose integrated positional encoding (IPE), extending traditional positional encoding by aggregating frequency information over the pixel area. We apply IPE to the state-of-the-art arbitrary-scale image super-resolution method: local implicit image function (LIIF), presenting IPE-LIIF. We show the effectiveness of IPE-LIIF by quantitative and qualitative evaluations, and further demonstrate the generalization ability of IPE to larger image scales and multiple implicit-based methods. Code will be released., Comment: 10 pages, 5 figures

We present NeRF-SR, a solution for high-resolution (HR) novel view synthesis with mostly low-resolution (LR) inputs. Our method is built upon Neural Radiance Fields (NeRF) that predicts per-point density and color with a multi-layer perceptron. While producing images at arbitrary scales, NeRF struggles with resolutions that go beyond observed images. Our key insight is that NeRF benefits from 3D consistency, which means an observed pixel absorbs information from nearby views. We first exploit it by a supersampling strategy that shoots multiple rays at each image pixel, which further enforces multi-view constraint at a sub-pixel level. Then, we show that NeRF-SR can further boost the performance of supersampling by a refinement network that leverages the estimated depth at hand to hallucinate details from related patches on only one HR reference image. Experiment results demonstrate that NeRF-SR generates high-quality results for novel view synthesis at HR on both synthetic and real-world datasets without any external information., Comment: Accepted to MM 2022. Project Page: https://cwchenwang.github.io/NeRF-SR

Neural Radiance Fields (NeRF) has achieved unprecedented view synthesis quality using coordinate-based neural scene representations. However, NeRF's view dependency can only handle simple reflections like highlights but cannot deal with complex reflections such as those from glass and mirrors. In these scenarios, NeRF models the virtual image as real geometries which leads to inaccurate depth estimation, and produces blurry renderings when the multi-view consistency is violated as the reflected objects may only be seen under some of the viewpoints. To overcome these issues, we introduce NeRFReN, which is built upon NeRF to model scenes with reflections. Specifically, we propose to split a scene into transmitted and reflected components, and model the two components with separate neural radiance fields. Considering that this decomposition is highly under-constrained, we exploit geometric priors and apply carefully-designed training strategies to achieve reasonable decomposition results. Experiments on various self-captured scenes show that our method achieves high-quality novel view synthesis and physically sound depth estimation results while enabling scene editing applications., Comment: Accepted to CVPR 2022. Project page: https://bennyguo.github.io/nerfren/

In this paper we derive a Toeplitz-structured closed form of the unique positive semi-definite stabilizing solution for the discrete-time algebraic Riccati equations, especially for the case that the state matrix is not stable. Based on the found form and fast Fourier transform, we propose a new algorithm for solving both discrete-time and continuous-time large-scale algebraic Riccati equations with low-rank structure. It works without unnecessary assumptions, complicated shift selection strategies, or matrix calculations of the cubic order with respect to the problem scale. Numerical examples are given to illustrate its features. Besides, we show that it is theoretically equivalent to several algorithms existing in the literature in the sense that they all produce the same sequence under the same parameter setting., Comment: 28 pages, 1 figure

Anomaly detection algorithms have been proved to be useful in the search of new physics beyond the Standard Model. However, a prerequisite for using an anomaly detection algorithm is that the signal to be sought is indeed anomalous. This does not always hold true, for example when interference between new physics and the Standard Model becomes important. In this case, the search of new physics is no longer an anomaly detection. To overcome this difficulty, we propose a nested anomaly detection algorithm, which appears to be useful in the study of neutral triple gauge couplings at the CEPC, the ILC and the FCC-ee. Our approach inherits the advantages of the anomaly detection algorithm been nested, while at the same time, it is no longer an anomaly detection algorithm. As a complement to anomaly detection algorithms, it can achieve better results on problems that are no longer anomaly detection., Comment: 12 pages, 6 figures