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

arXiv 2021年

作者： Bouland, Adam Fefferman, Bill Landau, Zeph Liu, Yunchao Simons Institute for the Theory of Computing Department of EECS UC Berkeley. Department of Computer Science University of Chicago Department of EECS UC Berkeley

Noise is the defining feature of the NISQ era, but it remains unclear if noisy quantum devices are capable of quantum speedups. quantum supremacy experiments have been a major step forward, but gaps remain between the theory behind these experiments and their actual implementations. In this work we initiate the study of the complexity of quantum random circuit sampling experiments with realistic amounts of noise. Actual quantum supremacy experiments have high levels of uncorrected noise and exponentially decaying fidelities. It is natural to ask if there is any signal of exponential complexity in these highly noisy devices. Surprisingly, we show that it remains hard to compute the output probabilities of noisy random quantum circuits without error correction. More formally, so long as the noise rate of the device is below the error detection threshold, we show it is #P-hard to compute the output probabilities of random circuits with a constant rate of noise per gate. This hardness persists even though these probabilities are exponentially close to uniform. Therefore the small deviations away from uniformity are hard to compute, formalizing an important intuition behind Google's supremacy claim. Interestingly these hardness results also have implications for the complexity of experiments in a low-noise setting. The issue here is that prior hardness results for computing output probabilities of random circuits are not robust enough to imprecision to connect with the Stockmeyer argument for hardness of sampling from circuits with constant fidelity. We exponentially improve the robustness of prior results to imprecision, both in the cases of Random Circuit Sampling and BosonSampling. In the latter case we bring the proven hardness within a constant factor in the exponent of the robustness required for hardness of sampling for the first time. We then show that our results are in tension with one another - the high-noise result implies the low-noise result is essentially

关键词： Hardness

来源：评论

学校读者我要写书评

暂无评论

Modeling Neural Networks Training Process with Markov Decision Process 2

Modeling Neural Networks Training Process with Markov Decisi...

引用

2nd International Conference on Artificial Intelligence and computer Engineering, ICAICE 2021

作者： Bai, Yantao Liu, Wanwei Mao, Xinjun Liang, Zhen National University of Defense Technology Key Laboratory of Software Engineering for Complex Systems Changsha China College of Computer Science National University of Defense Technology Changsha China Institute for Quantum Information National University of Defense Technology State Key Laboratory of High Performance Computing Changsha China

ISBN: (纸本)9781665421867

With the development of computer technology, statistics-based machine learning method has made great break-throughs, and also improved the development of artificial intelligence. Nevertheless, as a very influential model, neural networks are still treated as 'black boxes'. The results of neural networks are extremely sensitive to the training samples, which lead to great challenges to the controllability of the algorithm. With the wide application of machine learning, demand for interpretability and controllability of neural networks algorithms is increasing. As a result, various scholars have tried to explain and verify neural networks algorithms based on formal methods in recent years. In this paper, a method (called MNNTP) is presented to model the training process of neural networks by using a Markov decision process (MDP). Through MNNTP, the neural networks are abstracted into the form of MDP, which makes notable contributions for verifying some mathematical properties of the neural networks. © 2021 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Heralded Optical Entanglement Generation via the Graph Picture of Linear quantum Networks

arXiv

引用

arXiv 2023年

作者： Chin, Seungbeom Karczewski, Marcin Kim, Yong-Su International Centre for Theory of Quantum Technologies University of Gdańsk Gdańsk80-308 Poland Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of Institute of Spintronics and Quantum Information Faculty of Physics Adam Mickiewicz University Poland Seoul02792 Korea Republic of Division of Nano & Information Technology KIST School Korea University of Science and Technology Seoul02792 Korea Republic of

Non-destructive heralded entanglement with photons is a valuable resource for quantum information processing. However, they generally entail ancillary particles and modes that amplify the circuit intricacy. To address this challenge, a recent work (arXiv:2211.04042 (2022)) introduced a graph approach for creating multipartite entanglements with boson subtractions. Nonetheless, it remains an essential intermediate step toward practical heralded schemes: the proposition of heralded subtraction operators in bosonic linear quantum networks. This research establishes comprehensive translation rules from subtraction operators to linear optical operators, which provides a seamless path to design heralded schemes with single photons. Our method begets enhanced or previously unreported schemes for the N-partite GHZ state with 2N photons, N-partite W state with 2N + 1 photons and superposition of N = 3 GHZ and W states with 9 photons. Our streamlined approach can straightforwardly design heralded schemes for multipartite entangled states by assembling the operators according to the guidence of sculpting bigraphs, hence significantly simplifies the quantum circuit design process. © 2023, CC BY-NC-ND.

关键词： Photons

来源：评论

学校读者我要写书评

暂无评论

Precise and scalable evaluation on the robustness metric of neural networks as classifiers

Precise and scalable evaluation on the robustness metric of ...

引用

作者： Yangyi Hu Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and TechnologyNational University of Defense Technology College of Computer Science National University of Defense Technology

It is well known that the minimum adversarial distortion associated with a specific sample x reflects the local robustness of neural ***,it is intractable to solve the optimization problem related to the minimum adversarial distortion for general neural network cause it is *** have studied the lower bound or upper bound of the minimum adversarial distortion to give a robustness metrics for neural networks,such as CLEVER score and CW *** this paper,we provide a formal robustness guarantee to transform the robustness analysis into two sub-problems:（1）,compute out the maximum of the objective function g_t（r~t）;（2）,generate a sequence {r_n~t} *** r_n~t is the minimum adversarial distortion for targeted *** on this transformation,we propose an efficient and effective algorithm to directly estimate the instance-specific minimum adversarial distortion on the norm of the input manipulation required to change the classifier *** results on two data-sets,MNIST and CIFAR,show that our measure of robustness is between the lower bound given by CLEVER and the upper bound by CW,indicating our approach gives a precise measure of the robustness of neural *** addition,the powerful mathematical technique Extreme Value Estimation enables our algorithm computationally feasible for large neural *** the best of our knowledge,our algorithm is the first attack-independent approach to directly evaluate the minimum adversarial distortion as a robustness metric for neural network.

关键词： minimum adversarial distortion robustness metric instance-specific attack-independent

来源：评论

学校读者我要写书评

暂无评论

Error-Mitigated quantum Metrology via Virtual Purification

引用

Physical Review Letters 2022年第25期129卷 250503-250503页

作者： Kaoru Yamamoto Suguru Endo Hideaki Hakoshima Yuichiro Matsuzaki Yuuki Tokunaga NTT Computer and Data Science Laboratories NTT Corporation Musashino 180-8585 Japan JST PRESTO 4-1-8 Honcho Kawaguchi Saitama 332-0012 Japan Research Center for Emerging Computing Technologies National Institute of Advanced Industrial Science and Technology (AIST) Central2 1-1-1 Umezono Tsukuba Ibaraki 305-8568 Japan Center for Quantum Information and Quantum Biology Osaka University 1-2 Machikaneyama Toyonaka 560-0043 Japan NEC-AIST Quantum Technology Cooperative Research Laboratory National Institute of Advanced Industrial Science and Technology (AIST) Tsukuba Ibaraki 305-8568 Japan

quantum metrology with entangled resources aims to achieve sensitivity beyond the standard quantum limit by harnessing quantum effects even in the presence of environmental noise. So far, sensitivity has been mainly discussed from the viewpoint of reducing statistical errors under the assumption of perfect knowledge of a noise model. However, we cannot always obtain complete information about a noise model due to coherence time fluctuations, which are frequently observed in experiments. Such unknown fluctuating noise leads to systematic errors and nullifies the quantum advantages. Here, we propose an error-mitigated quantum metrology that can filter out unknown fluctuating noise with the aid of purification-based quantum error mitigation. We demonstrate that our protocol mitigates systematic errors and recovers superclassical scaling in a practical situation with time-inhomogeneous bias-inducing noise. Our result is the first demonstration to reveal the usefulness of purification-based error mitigation for unknown fluctuating noise, thus paving the way not only for practical quantum metrology but also for quantum computation affected by such noise.

关键词： quantum algorithms quantum metrology quantum sensing quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Explicitly represent the boundary of ReLU NN as a classifier and measure its robustness

Explicitly represent the boundary of ReLU NN as a classifier...

引用

Adversarial examples pose a great threat to the application of neural network as a classifier in areas with high security ***,the adversarial property of neural network is closely related to the ***,works barely give a rigorous description of *** paper for the first time studies the boundary of ReLU NN,which separates the sample space into distinct cells,each of which belongs to the same *** the demonstration,we discuss the algebraic property of border points upon the separating boundary and the topological difference between border points and odd *** derive Theorem Ⅲ.7 to give a rigorous,comprehensive and concise description on the boundary of ReLU ***,an algorithm,based on the description,is proposed to give a standard and exact metric for the local robustness of ReLU *** metric gives the local adversarial property of NN and reflects some aspects of its security performance,*** nimimum distortion needed to craft an adversarial *** the best of our knowledge,this is the first work proposed to give a rigorous and example-specific metric for the local robustness of ReLU NN.

关键词： Index Terms-adversarial examples boundary odd points local robustness metric

来源：评论

学校读者我要写书评

暂无评论

Synthesizing efficient circuits for Hamiltonian simulation

arXiv

引用

arXiv 2022年

作者： Mukhopadhyay, Priyanka Wiebe, Nathan Zhang, Hong Tao Institute for Quantum Computing University of Waterloo Canada Department of Combinatorics and Optimization University of Waterloo Canada Department of Computer Science University of Toronto Canada Pacific Northwest National Laboratory United States Department of Mathematics University of Toronto Canada

We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to 4. In fact, the total number of gates reduce in many cases. We show that it is possible to implement an exponentiated sum of commuting Paulis with at most m (controlled)-rotation gates, where m is the number of distinct non-zero eigenvalues (ignoring sign). Thus we can collect mutually commuting Hamiltonian terms into groups that satisfy one of several symmetries identified in this work which allow an inexpensive simulation of the entire group of terms. We further show that the cost can in some cases be reduced by partially allocating Hamiltonian terms to several groups and provide a polynomial time classical algorithm that can greedily allocate the terms to appropriate groupings. We further specifically discuss these optimizations for the case of fermionic dynamics and provide extensive numerical simulations for qDRIFT of our grouping strategy to 6 and 4-qubit Heisenberg models, LiH, H2 and observe a factor of 1.8-3.2 reduction in the number of non-Clifford gates. This suggests Trotter-based simulation of chemistry in second quantization may be even more practical than previously believed. © 2022, CC BY.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

quantum computing Society of the Philippines: An NGO Perspective on Promoting quantum Information, science, and Technology in the Philippines

Quantum Computing Society of the Philippines: An NGO Perspec...

引用

quantum computing and Engineering (QCE), IEEE International Conference on

作者： Dylan Josh Domingo Lopez Elmer Peramo Jabez Mendoza Ayson Angela Nicole S. Masongsong Lance Dominic C. Raquel Bobby O. Corpus Department of Computer Technology De La Salle University Manila Philippines Department of Science and Technology Advanced Science and Technology Institute Quezon City Philippines Electronics Engineering Department Don Honorio Ventura State University Pampanga Philippines STEM Department De La Salle University Integrated School Manila Philippines Department of Physics University of San Carlos Cebu City Philippines Quantum Computing Society of the Philippines Manila Philippines

ISBN: (数字)9798331541378

ISBN: (纸本)9798331541385

The development of quantum Information science and Technology (QIST) as an emerging technology among developed and developing countries has caught the attention of governments, industries, and educational institutions. However, not all countries have equal starting points in promoting QIST amongst different sectors. Several players in various countries promote QIST as a discipline and education. Although significant developments in quantum technology are focused in Western countries, great innovation can also be seen in Eastern countries, specifically Asia. The Philippines is one of several developing countries in Asia that is in the process of adopting QIST in multiple sectors. In this paper, the quantum computing Society of the Philippines (QCSP) is introduced as one of the arms of the country for promoting QIST to the public. Further in this paper, the initial impact of QIST promotion on various communities across the Philippines through multiple activities and educational efforts is explained. Several critical success stories for different audiences were described, wherein initial acceptance of QIST was evident through hackathons and lecture series. Events held show improvement in interest and proficiency in the foundations of QIST.

关键词： Industries Technological innovation quantum computing Program processors Asia Government Education Developing countries quantum information science Hackathon

来源：评论

学校读者我要写书评

暂无评论

Streaming quantum state purification

arXiv

引用

arXiv 2023年

作者： Childs, Andrew M. Fu, Honghao Leung, Debbie Li, Zhi Ozols, Maris Vyas, Vedang Institute for Quantum Computing University of Waterloo WaterlooONN2L 3G1 Canada Department of Computer Science Institute for Advanced Computer Studies Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States Massachusetts Institute of Technology 77 Massachusetts Ave. CambridgeMA02139 United States Perimeter Institute for Theoretical Physics 31 Caroline St. N. WaterlooONN2L 2Y5 Canada QuSoft University of Amsterdam Science Park 123 Amsterdam1098 XG Netherlands Concordia Institute of Information Systems Engineering Concordia University 1455 Blvd. De Maisonneuve Ouest MontrealQCH3G 1M8 Canada

quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has primarily been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. Treating the initial error parameter and the dimension as constants, we show that our procedure has sample complexity asymptotically optimal in the final error parameter. Our protocol has a simple recursive structure that can be applied when the states are provided one at a time in a streaming fashion, requiring only a small quantum memory to implement. © 2023, CC BY.

关键词： quantum communication

来源：评论

学校读者我要写书评

暂无评论

Spinfoam on a Lefschetz thimble: Markov chain Monte Carlo computation of a Lorentzian spinfoam propagator

引用

Physical Review D 2021年第8期103卷 084026-084026页

作者： Muxin Han Zichang Huang Hongguang Liu Dongxue Qu Yidun Wan State Key Laboratory of Surface Physics Fudan University Shanghai 200433 China Department of Physics Center for Field Theory and Particle Physics Institute for Nanoelectronic devices and Quantum computing Fudan University Shanghai 200433 China and Department of Physics and Institute for Quantum Science and Engineering Southern University of Science and Technology Shenzhen 518055 China

We compute numerically the Lorentzian Engle-Pereira-Rovelli-Livine spinfoam propagator on a 4-simplex, by adapting the Lefschetz thimble and Markov chain Monte-Carlo methods to oscillatory spinfoam integrals. Our method can compute any spinfoam observables at relatively large spins. We obtain the numerical results of the propagators at different spins and demonstrate their consistency with the expected spinfoam semiclassical behavior in the large spin limit. Our results exhibit significant quantum corrections at smaller spins. Our method is reliable and thus can be employed to discover the semiclassical and quantum behaviors of the spinfoam model.

关键词： Loop quantum gravity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：