检索结果-内蒙古大学图书馆

Feedback-Driven Quantum Reservoir computing for Time-Series Analysis

PRX Quantum 2024年第4期5卷 040325-040325页

作者： Kaito Kobayashi Keisuke Fujii Naoki Yamamoto Department of Applied Physics The University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113-8656 Japan Graduate School of Engineering Science Osaka University 1-3 Machikaneyama Toyonaka Osaka 560-8531 Japan Center for Quantum Information and Quantum Biology Osaka University 1-2 Machikaneyama Toyonaka 560-0043 Japan RIKEN Center for Quantum Computing (RQC) Hirosawa 2-1 Wako Saitama 351-0198 Japan Department of Applied Physics and Physico-Informatics Keio University Hiyoshi 3-14-1 Kohoku-ku Yokohama 223-8522 Japan Quantum Computing Center Keio University Hiyoshi 3-14-1 Kohoku-ku Yokohama 223-8522 Japan

Quantum reservoir computing (QRC) is a highly promising computational paradigm that leverages quantum systems as a computational resource for nonlinear information processing. While its application to time-series analysis is eagerly anticipated, prevailing approaches suffer from the collapse of the quantum state upon measurement, resulting in the erasure of temporal input memories. Neither repeated initializations nor weak measurements offer a fundamental solution, as the former escalates the time complexity while the latter restricts the information extraction from the Hilbert space. To address this issue, we propose the feedback-driven QRC framework. This methodology employs projective measurements on all qubits for unrestricted access to the quantum state, with the measurement outcomes subsequently fed back into the reservoir to restore the memory of prior inputs. We demonstrate that our QRC successfully acquires the fading-memory property through the feedback connections, a critical aspect in time-series processing. Notably, analysis of measurement trajectories reveals three distinct phases depending on the feedback strength, with the memory performance maximized at the edge of chaos. We also evaluate the predictive capabilities of our QRC, demonstrating its suitability for forecasting signals originating from quantum spin systems.

关键词： Artificial intelligence Quantum algorithms Quantum circuits Quantum computation Quantum computing models Quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Local Periodicity-Based Beat Tracking for Expressive Classical Piano Music

arXiv

引用

arXiv 2023年

作者： Chiu, Ching-Yu Müller, Meinard Davies, Matthew E.P. Su, Alvin Wen-Yu Yang, Yi-Hsuan The Graduate Program of Multimedia Systems and Intelligent Computing National Cheng Kung University Academia Sinica Taiwan The International Audio Laboratories Erlangen Germany The Department of Informatics Engineering Centre for Informatics and Systems of the University of Coimbra University of Coimbra Portugal The Department of Computer Science and Information Engineering National Cheng Kung University Taiwan Yating Music Team Taiwan AI Labs Taiwan Research Center for IT Innovation Academia Sinica Taiwan

To model the periodicity of beats, state-of-the-art beat tracking systems use "post-processing trackers" (PPTs) that rely on several empirically determined global assumptions for tempo transition, which work well for music with a steady tempo. For expressive classical music, however, these assumptions can be too rigid. With two large datasets of Western classical piano music, namely the Aligned Scores and Performances (ASAP) dataset and a dataset of Chopin's Mazurkas (Maz-5), we report on experiments showing the failure of existing PPTs to cope with local tempo changes, thus calling for new methods. In this paper, we propose a new local periodicity-based PPT, called predominant local pulse-based dynamic programming (PLPDP) tracking, that allows for more flexible tempo transitions. Specifically, the new PPT incorporates a method called "predominant local pulses" (PLP) in combination with a dynamic programming (DP) component to jointly consider the locally detected periodicity and beat activation strength at each time instant. Accordingly, PLPDP accounts for the local periodicity, rather than relying on a global tempo assumption. Compared to existing PPTs, PLPDP particularly enhances the recall values at the cost of a lower precision, resulting in an overall improvement of F1-score for beat tracking in ASAP (from 0.473 to 0.493) and Maz-5 (from 0.595 to 0.838). © 2023, CC BY.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Strong Converse for Privacy Amplification against Quantum Side Information

arXiv

引用

arXiv 2022年

作者： Shen, Yu-Chen Gao, Li Cheng, Hao-Chung Department of Electrical Engineering Graduate Institute of Communication Engineering National Taiwan University Taipei106 Taiwan Department of Mathematics National Taiwan University Taiwan Center for Quantum Science and Engineering National Taiwan University Taiwan Quantum Computing Center New Taipei City236 Taiwan Department of Mathematics University of Houston HoustonTX77204 United States

We establish a one-shot strong converse bound for privacy amplification against quantum side information using trace distance as a security criterion. This strong converse bound implies that in the independent and identical scenario, the trace distance exponentially converges to one in every finite blocklength when the rate of the extracted randomness exceeds the quantum conditional entropy. The established one-shot bound has an application to bounding the information leakage of classical-quantum wiretap channel coding and private communication over quantum channels. That is, the trace distance between Alice and Eavesdropper’s joint state and its decoupled state vanishes as the rate of randomness used in hashing exceeds the quantum mutual information. On the other hand, the trace distance converges to one when the rate is below the quantum mutual information, resulting in an exponential strong converse. Our result also leads to an exponential strong converse for entropy accumulation, which complements a recent result by Dupuis [arXiv:2105.05342]. Lastly, our result and its applications apply to the moderate deviation regime. Namely, we characterize the asymptotic behaviors of the trace distances when the associated rates approach the fundamental thresholds with speeds slower than O(1/√n). © 2022, CC0.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Programming Variational Quantum Circuits with Quantum-Train Agent

Programming Variational Quantum Circuits with Quantum-Train ...

引用

Quantum Communications, Networking, and computing (QCNC), International Conference on

作者： Chen-Yu Liu Samuel Yen-Chi Chen Kuan-Cheng Chen Wei-Jia Huang Yen-Jui Chang Graduate Institute of Applied Physics National Taiwan University Taipei Taiwan Hon Hai (Foxconn) Research Institute Taipei Taiwan Wells Fargo New York NY USA Department of Electrical and Electronic Engineering Imperial College London London UK Centre for Quantum Engineering Science and Technology (QuEST) Imperial College London London UK Quantum Information Center Chung Yuan Christian University Taoyuan City Taiwan Master Program in Intelligent Computing and Big Data Chung Yuan Christian University Taoyuan City Taiwan

ISBN: (数字)9798331531591

ISBN: (纸本)9798331531607

This study introduces the Quantum-Train Quantum Fast Weight Programmer (QT-QFWP) framework, enabling efficient and scalable programming of variational quantum circuits (VQCs) through quantum-driven parameter updates for the classical slow programmer controlling the fast programmer VQC. By optimizing quantum and classical parameter management, QT-QFWP significantly reduces parameters (by 70–90%) compared to Quantum Long Short-Term Memory (QLSTM) and Quantum Fast Weight Programmer (QFWP) while maintaining accuracy. Benchmarking on time-series tasks—including Damped Simple Harmonic Motion (SHM), NARMA5, and Simulated Gravitational Waves (GW)—demonstrates superior efficiency and predictive accuracy. QT-QFWP is particularly advantageous for near-term quantum systems, addressing qubit and gate fidelity constraints, enhancing VQC deployment in time-sensitive applications, and expanding quantum computing’s role in machine learning.

关键词： Quantum system Accuracy Computational modeling Qubit Neural networks Programming Predictive models Quantum circuit Physics Long short term memory

来源：评论

学校读者我要写书评

暂无评论

Quantum error correction with an Ising machine under circuit-level noise

引用

Physical Review Research 2023年第4期5卷 043261-043261页

作者： Jun Fujisaki Kazunori Maruyama Hirotaka Oshima Shintaro Sato Tatsuya Sakashita Yusaku Takeuchi Keisuke Fujii Quantum Laboratory Fujitsu Research Fujitsu Limited 4-1-1 Kawasaki Kanagawa 211-8588 Japan Fujitsu Quantum Computing Joint Research Division Center for Quantum Information and Quantum Biology Osaka University 1-2 Machikaneyama Toyonaka Osaka 565-8531 Japan Center for Quantum Information and Quantum Biology Osaka University 560-0043 Japan Graduate School of Engineering Science Osaka University 1-3 Machikaneyama Toyonaka Osaka 560-8531 Japan RIKEN Center for Quantum Computing (RQC) Wako Saitama 351-0198 Japan

Efficient decoding to estimate error locations from outcomes of syndrome measurements is the prerequisite for quantum error correction. Decoding in the presence of circuit-level noise including measurement errors should be considered in case of actual quantum computing devices. In this paper, we develop a decoder for circuit-level noise that solves the error estimation problems as Ising-type optimization problems. We confirm that the threshold theorem in the surface code under circuit-level noise is reproduced with an error threshold of approximately 0.4%. We also demonstrate the advantage of the decoder through which the Y error detection rate can be improved compared with other matching-based decoders. Our results reveal that a lower logical error rate can be obtained using our algorithm compared with that of the minimum-weight perfect matching algorithm.

关键词： Quantum error correction

来源：评论

学校读者我要写书评

暂无评论

Error Exponent and Strong Converse for Quantum Soft Covering

arXiv

引用

arXiv 2022年

作者： Cheng, Hao-Chung Gao, Li Department of Electrical Engineering Graduate Institute of Communication Engineering National Taiwan University Taipei106 Taiwan Department of Mathematics National Taiwan University Taiwan Center for Quantum Science and Engineering National Taiwan University Taiwan Quantum Computing Center New Taipei City236 Taiwan Department of Mathematics University of Houston HoustonTX77204 United States

How well can we approximate a quantum channel output state using a random codebook with a certain size? In this work, we study the quantum soft covering problem. Namely, we use a random codebook with codewords independently sampled from a prior distribution and send it through a classical-quantum channel to approximate the target state. When using a random independent and identically distributed codebook with a rate above the quantum mutual information, we show that the expected trace distance between the codebook-induced state and the target state decays with exponent given by the sandwiched Rényi information. On the other hand, when the rate of the codebook size is below the quantum mutual information, the trace distance converges to one exponentially fast. We obtain similar results when using a random constant composition codebook, whereas the sandwiched Augustin information expresses the error exponent. In addition to the above large deviation analysis, our results also hold in the moderate deviation regime. That is, we show that even when the rate of the codebook size approaches the quantum mutual information moderately quickly, the trace distance still vanishes asymptotically. © 2022, CC0.

关键词： Communication channels (information theory)

来源：评论

学校读者我要写书评

暂无评论

Optimal Second-Order Rates for Quantum Soft Covering and Privacy Amplification

arXiv

引用

arXiv 2022年

We study quantum soft covering and privacy amplification against quantum side information. The former task aims to approximate a quantum state by sampling from a prior distribution and querying a quantum channel. The latter task aims to extract uniform and independent randomness against quantum adversaries. For both tasks, we use trace distance to measure the closeness between the processed state and the ideal target state. We show that the minimal amount of samples for achieving an Ε-covering is given by the (1 − Ε)-hypothesis testing information (with additional logarithmic additive terms), while the maximal extractable randomness for an Ε-secret extractor is characterized by the conditional (1 − Ε)-hypothesis testing entropy. When performing independent and identical repetitions of the tasks, our one-shot characterizations lead to tight asymptotic expansions of the above-mentioned operational quantities. We establish their second-order rates given by the quantum mutual information variance and the quantum conditional information variance, respectively. Moreover, our results extend to the moderate deviation regime, which are the optimal asymptotic rates when the trace distances vanish at sub-exponential speed. Our proof technique is direct analysis of trace distance without smoothing. © 2022, CC0.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

A Stochastic Flight Problem Simulation to Minimize Cost of Refuelling

引用

Computers, Materials & Continua 2021年第10期69卷 849-871页

作者： Said Ali Hassan Khalid Alnowibet Miral H.Khodeir Prachi Agrawal Adel F.Alrasheedi Ali Wagdy Mohamed Department of Operations Research and Decision Support Faculty of Computers and Artificial IntelligenceCairo UniversityGiza12613Egypt Department of Statistics and Operations Research College of ScienceKing Saud UniversityRiyadh11451Kingdom of Saudi Arabia Department of Mathematics and Scientific Computing National Institute of Technology HamirpurHimachal Pradesh177005India Department of Operations Research Faculty of Graduate Studies for Statistical ResearchCairo UniversityGiza12613Egypt Wireless Intelligent Networks Center(WINC) School of Engineering and Applied SciencesNile UniversityGizaEgypt

Commercial airline companies are continuously seeking to implement strategies for minimizing costs of fuel for their flight routes as acquiring jet fuel represents a significant part of operating and managing expenses for airline activities.A nonlinear mixed binary mathematical programming model for the airline fuel task is presented to minimize the total cost of refueling in an entire flight route *** model is enhanced to include possible discounts in fuel prices,which are performed by adding dummy variables and some restrictive constraints,or by fitting a suitable distribution function that relates prices to purchased *** obtained fuel plan explains exactly the amounts of fuel in gallons to be purchased from each airport considering tankering strategy while minimizing the pertinent cost of the whole flight *** relation between the amount of extra burnt fuel taken through tinkering strategy and the total flight time is also considered.A case study is introduced for a certain flight rotation in domestic US air transport *** mathematical model including stepped discounted fuel prices is *** problem has a stochastic nature as the total flight time is a random variable,the stochastic nature of the problem is realistic and more appropriate than the deterministic *** stochastic style of the problem is simulated by introducing a suitable probability distribution for the flight time duration and generating enough number of runs to mimic the probabilistic real *** similar real application problems are modelled as nonlinear mixed binary ones that are difficult to handle by exact ***,metaheuristic approaches are widely used in treating such different optimization *** this paper,a gaining sharing knowledge-based procedure is used to handle the mathematical *** algorithm basically based on the process of gaining and sharing knowledge throughout the human *** generated simulation runs of

关键词： Stochastic flight problem cost of refuelling ferrying strategy tankering discounted prices simulation procedure nonlinear mixed binary model metaheuristic algorithm gaining-sharing knowledge-based algorithm

来源：评论

学校读者我要写书评

暂无评论

The Database and Benchmark For the Source Speaker Tracing Challenge 2024

The Database and Benchmark For the Source Speaker Tracing Ch...

引用

IEEE Spoken Language Technology Workshop

作者： Ze Li Yuke Lin Tian Yao Hongbin Suo Pengyuan Zhang Yanzhen Ren Zexin Cai Hiromitsu Nishizaki Ming Li School of Computer Science Wuhan University Wuhan China Suzhou Municipal Key Laboratory of Multimodal Intelligent Systems Duke Kunshan University Kunshan China AI Center OPPO Beijing China Key Laboratory of Speech Acoustics and Content Understanding Institute of Acoustics CAS China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Center for Language and Speech Processing Johns Hopkins University USA Integrated Graduate School of Medicine Engineering and Agricultural Sciences University of Yamanashi 4-4-37 Takeda Kofu Yamanashi Japan

ISBN: (数字)9798350392258

ISBN: (纸本)9798350392265

Voice conversion (VC) systems can transform audio to mimic another speaker’s voice, thereby attacking speaker verification (SV) systems. However, ongoing studies on source speaker verification (SSV) are hindered by limited data availability and methodological constraints. This paper presents the Source Speaker Tracking Challenge (SSTC) on STL 2024, which aims to fill the gap in the database and benchmark for the SSV task. In this study, we generate a large-scale converted speech database with 16 common VC methods and train a batch of baseline systems based on the MFA-Conformer architecture. In addition, we introduced a related task called conversion method recognition, with the aim of assisting the SSV task. We expect SSTC to be a platform for advancing the development of the SSV task and provide further insights into the performance and limitations of current SV systems against VC attacks. Further details about SSTC can be found here 1 . 1 https://***/

关键词： Databases Conferences Transforms Contrastive learning Benchmark testing Multitasking Calibration

来源：评论

学校读者我要写书评

暂无评论

Decoupling speaker-independent emotions for voice conversion via source-filter networks

arXiv

引用

arXiv 2021年

作者： Luo, Zhaojie Lin, Shoufeng Liu, Rui Baba, Jun Yoshikawa, Yuichiro Hiroshi, Ishiguro Graduate School of Engineer Science Osaka University Japan School of Electrical Engineering Computing and Mathematical Sciences Curtin University Singapore Singapore CyberAgent Inc. Tokyo Japan

Emotional voice conversion (VC) aims to convert a neutral voice to an emotional (e.g. happy) one while retaining the linguistic information and speaker identity. We note that the decoupling of emotional features from other speech information (such as speaker, content, etc.) is the key to achieving remarkable performance. Some recent attempts about speech representation decoupling on the neutral speech can not work well on the emotional speech, due to the more complex acoustic properties involved in the latter. To address this problem, here we propose a novel Source-Filter based Emotional VC model (SFEVC) to achieve proper filtering speaker-independent emotion features from both the timbre and pitch features. Our SFEVC model consists of multi-channel encoders, emotion separate encoders and decoder. Note that all encoder modules adopt a designed information bottlenecks auto-encoder. Additionally, to further improve the conversion quality for various emotions, a novel two-stage training strategy based on the 2D Valence-Arousal (VA) space was proposed. Experimental results show that the proposed SFEVC along with two-stage training strategy outperforms all baselines and achieves the state-of-the-art performance in speaker-independent emotional VC with nonparallel data. Copyright © 2021, The Authors. All rights reserved.

关键词： Acoustic properties

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：