Search

We demonstrate resonant excitation of a plasma wave by a train of short laser pulses guided in a pre-formed plasma channel, for parameters relevant to a plasma-modulated plasma accelerator (P-MoPA). We show experimentally that a train of $N \approx 10$ short pulses, of total energy $\sim 1$ J, can be guided through $110$ mm long plasma channels with on-axis densities in the range $10^{17} - 10^{18}$ cm$^{-3}$. The spectrum of the transmitted train is found to be strongly red-shifted when the plasma period is tuned to the intra-train pulse spacing. Numerical simulations are found to be in excellent agreement with the measurements and indicate that the resonantly excited plasma waves have an amplitude in the range $3$ - $10$ GV m$^{-1}$, corresponding to an accelerator stage energy gain of order $1$ GeV., Comment: 13 pages, 14 figures (including Supplemental Material)

Quantum state preparation is vital in quantum computing and information processing. The ability to accurately and reliably prepare specific quantum states is essential for various applications. One of the promising applications of quantum computers is quantum simulation. This requires preparing a quantum state representing the system we are trying to simulate. This research introduces a novel simulation algorithm, the multi-Split-Steps Quantum Walk (multi-SSQW), designed to learn and load complicated probability distributions using parameterized quantum circuits (PQC) with a variational solver on classical simulators. The multi-SSQW algorithm is a modified version of the split-steps quantum walk, enhanced to incorporate a multi-agent decision-making process, rendering it suitable for modeling financial markets. The study provides theoretical descriptions and empirical investigations of the multi-SSQW algorithm to demonstrate its promising capabilities in probability distribution simulation and financial market modeling. Harnessing the advantages of quantum computation, the multi-SSQW models complex financial distributions and scenarios with high accuracy, providing valuable insights and mechanisms for financial analysis and decision-making. The multi-SSQW's key benefits include its modeling flexibility, stable convergence, and instantaneous computation. These advantages underscore its rapid modeling and prediction potential in dynamic financial markets., Comment: 13 pages, 13 figures. arXiv admin note: text overlap with arXiv:2302.12500

In recent years, there has been an emerging trend of combining two innovations in computer science and physics to achieve better computation capability. Exploring the potential of quantum computation to achieve highly efficient performance in various tasks is a vital development in engineering and a valuable question in sciences, as it has a significant potential to provide exponential speedups for technologically complex problems that are specifically advantageous to quantum computers. However, one key issue in unleashing this potential is constructing an efficient approach to load classical data into quantum states that can be executed by quantum computers or quantum simulators on classical hardware. Therefore, the split-step quantum walks (SSQW) algorithm was proposed to address this limitation. We facilitate SSQW to design parameterized quantum circuits (PQC) that can generate probability distributions and optimize the parameters to achieve the desired distribution using a variational solver. A practical example of implementing SSQW using Qiskit has been released as open-source software. Showing its potential as a promising method for generating desired probability amplitude distributions highlights the potential application of SSQW in option pricing through quantum simulation., Comment: 11 pages, 7 figures

In this study, we show that quantum walk can describe a Majorana fermion when the coin operator constrained by Lorentz covariance and the initial state satisfies the Majorana condition. The time evolution of a Majorana fermion is demonstrated with the numerical simulations and experimentally runs on a real quantum device provided by IBM Quantum System. To reduce errors due to approximation, we proposed a new efficient way to achieve second order accuracy in the near-term quantum computer without increase the complexity of quantum gate circuitry compared with the first order approximation. We show that rest Majorana fermion (expectation value of momentum is zero) can be well defined and its behavior depends more sensitively on the accuracy of the approximation than a Dirac particle due to the stringent constraints of Majorana condition., Comment: 16 pages, 7 figures

Recently, image enhancement and restoration have become important applications on mobile devices, such as super-resolution and image deblurring. However, most state-of-the-art networks present extremely high computational complexity. This makes them difficult to be deployed on mobile devices with acceptable latency. Moreover, when deploying to different mobile devices, there is a large latency variation due to the difference and limitation of deep learning accelerators on mobile devices. In this paper, we conduct a search of portable network architectures for better quality-latency trade-off across mobile devices. We further present the effectiveness of widely used network optimizations for image deblurring task. This paper provides comprehensive experiments and comparisons to uncover the in-depth analysis for both latency and image quality. Through all the above works, we demonstrate the successful deployment of image deblurring application on mobile devices with the acceleration of deep learning accelerators. To the best of our knowledge, this is the first paper that addresses all the deployment issues of image deblurring task across mobile devices. This paper provides practical deployment-guidelines, and is adopted by the championship-winning team in NTIRE 2020 Image Deblurring Challenge on Smartphone Track., Comment: CVPR 2020 Workshop on New Trends in Image Restoration and Enhancement (NTIRE)

Convolutional neural network (CNN) delivers impressive achievements in computer vision and machine learning field. However, CNN incurs high computational complexity, especially for vision quality applications because of large image resolution. In this paper, we propose an iterative architecture-aware pruning algorithm with adaptive magnitude threshold while cooperating with quality-metric measurement simultaneously. We show the performance improvement applied on vision quality applications and provide comprehensive analysis with flexible pruning configuration. With the proposed method, the Multiply-Accumulate (MAC) of state-of-the-art low-light imaging (SID) and super-resolution (EDSR) are reduced by 58% and 37% without quality drop, respectively. The memory bandwidth (BW) requirements of convolutional layer can be also reduced by 20% to 40%., Comment: Accepted to be Published in the 26th IEEE International Conference on Image Processing (ICIP 2019). Updated to contain the IEEE copyright notice