检索结果-南通市图书馆

Universal bound on sampling bosons in linear optics and its computational implications

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

National Science Review 2019年第4期6卷 719-729页

作者： man-hong yung Xun Gao Joonsuk Huh Shenzhen Institute for Quantum Science and Engineering and Department of Physics Southern University of Science and Technology Shenzhen Key Laboratory of Quantum Science and Engineering Southern University of Science and Technology Central Research Institute Huawei Technologies Center for Quantum Information Institute for Interdisciplinary Information SciencesTsinghua University Department of Chemistry Sungkyunkwan University

In linear optics, photons are scattered in a network through passive optical elements including beam splitters and phase shifters, leading to many intriguing applications in physics, such as Mach–Zehnder interferometry, the hong–Ou–mandel effect, and tests of fundamental quantum mechanics. Here we present the fundamental limit in the transition amplitudes of bosons, applicable to all physical linear optical networks. Apart from boson sampling, this transition bound results in many other interesting applications,including behaviors of Bose–Einstein condensates(BEC) in optical networks, counterparts of hong–Ou–mandel effects for multiple photons, and approximating permanents of matrices. In addition,this general bound implies the existence of a polynomial-time randomized algorithm for estimating the transition amplitudes of bosons, which represents a solution to an open problem raised by Aaronson and Hance(Quantum Inf Comput 2012; 14: 541–59). Consequently, this bound implies that computational decision problems encoded in linear optics, prepared and detected in the Fock basis, can be solved efficiently by classical computers within additive errors. Furthermore, our result also leads to a classical sampling algorithm that can be applied to calculate the many-body wave functions and the S-matrix of bosonic particles.

关键词： boson sampling quantum optics quantum supremacy linear optics computational complexity

Quantum speedup in adaptive boosting of binary classification

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Physics,Mechanics & Astronomy) 2021年第2期64卷 51-60页

作者： XiMing Wang YueChi Ma Min-Hsiu Hsieh man-hong yung School of Physics and Mathmatical Science Nanyang Technological UniversitySingaporeSingapore Department of Physics Southern University of Science and TechnologyShenzhen518055China Shenzhen Institute for Quantum Science and Engineering Southern University of Science and TechnologyShenzhen518055China Center for Quantum Information Institute for Interdisciplinary Information SciencesTsinghua UniversityBeijing100084China Center for Quantum Software and Information University of Technology SydneySydney2007Australia Guangdong Provincial Key Laboratory of Quantum Science and Engineering Southern University of Science and TechnologyShenzhen518055China

In classical machine learning,a set of weak classifiers can be adaptively combined for improving the overall performance,a technique called adaptive boosting(or AdaBoost).However,constructing a combined classifier for a large data set is typically resource *** we propose a quantum extension of AdaBoost,demonstrating a quantum algorithm that can output the optimal strong classifier with a quadratic speedup in the number of queries of the weak *** results also include a generalization of the standard AdaBoost to the cases where the output of each classifier may be *** prove that the query complexity of the non-deterministic classifiers is the same as those of deterministic classifiers,which may be of independent interest to the classical machine-learning ***,once the optimal classifier is determined by our quantum algorithm,no quantum resources are further *** fact may lead to applications on near term quantum devices.

关键词： AdaBoost quantum machine learning quantum algorithm

Low-depth optical neural networks

在线全文

学校读者我要写书评

暂无评论

Chip 2022年第1期1卷 8-13页

作者： Xiao-Ming Zhang man-hong yung Department of Physics Southern University of Science and TechnologyShen-zhen 518055China Department of Physics City University of Hong KongTat Chee AvenueKowloonHong Kong SARChina Shenzhen Institute for Quan-tum Science and Engineering Southern University of Science and TechnologyShenzhen 518055China Guangdong Provincial Key Laboratory of Quantum Science and Engineering Southern University of Science and TechnologyShen-zhen 518055China Shenzhen Key Laboratory of Quantum Science and En-gineering Southern University of Science and TechnologyShenzhen518055China

Optical neural network(ONNs)are emerging as attractive propos-als for machine-learning ***,the stability of ONNs decreases with the circuit depth,limiting the scalability of ONNs for practical *** we demonstrate how to compress the circuit depth to scale only logarithmically in terms of the dimension of the data,leading to an exponential gain in terms of noise *** low-depth(LD)-ONN is based on an architecture,called Optical Com-puTing Of dot-Product UnitS(OCTOPUS),which can also be applied individually as a linear perceptron for solving classification *** present both numerical and theoretical evidence showing that LD-ONN can exhibit a significant improvement on robustness,compared with previous ONN proposals based on singular-value decomposition.

关键词： optical neural networks photonic chip machine learning

Experimental study of Forrelation in nuclear spins

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science Bulletin 2017年第7期62卷 497-502页

作者： Hang Li Xun Gao Tao Xin man-hong yung Guilu Long State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics Tsinghua University Beijing 100084 China Collaborative Innovation Centre of Quantum Matter Beijing 100084 China Centre for Quantum Information Institute for Interdisciplinary Information Sciences Tsinghua University Beijing 100084 China Institute for Quantum Science and Engineering and Department of Physics Southern University of Science and Technology Shenzhen 518055 China

Correlation functions are often employed to quantify the relationships among interdependent variables or sets of ***,a new class of correlation functions,called FORRELATION,has been introduced by Aaronson and Ambainis for studying the query complexity of quantum *** was found that there exists a quantum query algorithm solving 2-fold FORRELATION problems with an exponential quantum speedup over all possible classical means,which represents essentially the largest possible separation between quantum and classical query *** we report an experimental study probing the2-fold and 3-fold FORRELATIONS encoded in nuclear *** major experimental challenge is to control the spin fluctuation to within a threshold value,which is achieved by developing a set of optimized GRAPE pulse ***,our small-scale implementation indicates that the quantum query algorithm is capable of determining the values of FORRELATIONS within an acceptable accuracy required for demonstrating quantum supremacy,given the current technology and in the presence of experimental noise.

关键词： Forrelation Query complexity Nuclear magnetic resonance Gradient ascent pulse engineering

Entirety of Quantum Uncertainty and Its Experimental Verification

在线全文

学校读者我要写书评

暂无评论

Chinese Physics Letters 2021年第7期38卷 11-16页

作者： Jie Xie Li Zhou Aonan Zhang Huichao Xu man-hong yung Ping Xu Nengkun Yu Lijian Zhang National Laboratory of Solid State Microstructures College of Engineering and Applied Sciences and School of PhysicsNanjing UniversityNanjing 210093China Collaborative Innovation Center of Advanced Microstructures Nanjing UniversityNanjing 210093China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China Shenzhen Institute for Quantum Science and Engineering and Department of Physics Southern University of Science and TechnologyShenzhen 518055China Shenzhen Key Laboratory of Quantum Science and Engineering Southern University of Science and TechnologyShenzhen 518055China Institute for Quantum Information&State Key Laboratory of High Performance Computing College of ComputerNational University of Defense TechnologyChangsha 410073China Centre for Quantum Software and Information School of SoftwareFaculty of Engineering and Information TechnologyUniversity of Technology SydneyNSWAustralia

As a foundation of quantum physics,uncertainty relations describe ultimate limit for the measurement uncertainty of incompatible ***,uncertainty relations are formulated by mathematical bounds for a specific *** we present a method for geometrically characterizing uncertainty relations as an entire area of variances of the observables,ranging over all possible input *** find that for the pair of position and momentum operators,Heisenberg's uncertainty principle points exactly to the attainable area of the variances of position and ***,for finite-dimensional systems,we prove that the corresponding area is necessarily semialgebraic;in other words,this set can be represented via finite polynomial equations and inequalities,or any finite union of such *** particular,we give the analytical characterization of the areas of variances of(a)a pair of one-qubit observables and(b)a pair of projective observables for arbitrary dimension,and give the first experimental observation of such areas in a photonic system.

关键词： observable union operators

Simulation of molecular spectroscopy with circuit quantum electrodynamics

在线全文

学校读者我要写书评

暂无评论

Science Bulletin 2018年第5期63卷 293-299页

作者： Ling Hu Yue-Chi Ma Yuan Xu Wei-Ting Wang Yu-Wei Ma Ke Liu Hai-Yan Wang Yi-Pu Song man-hong yung Lu-Yan Sun Center for Quantum Information Institute for Interdisciplinary Information Sciences Tsinghua University Beijing 100084 China institute for Quantum-Science and Engineering and Department of Physics South University of Science and Technology of China Shenzhen 518055 China Shenzhen Key Laboratory of Quantum Science and Engineering Shenzhen 518055 China

Spectroscopy is a crucial laboratory technique for understanding quantum systems through their interactions with the electromagnetic ***,spectroscopy is capable of revealing the physical structure of molecules,leading to the development of the maser—the forerunner of the ***,real-world applications of molecular spectroscopy are mostly confined to equilibrium states,due to computational and technological constraints;a potential breakthrough can be achieved by utilizing the emerging technology of quantum *** we experimentally demonstrate through a toy model,a superconducting quantum simulator capable of generating molecular spectra for both equilibrium and non-equilibrium states,reliably producing the vibronic structure of diatomic ***,our quantum simulator is applicable not only to molecules with a wide range of electronic-vibronic coupling strength,characterized by the Huang-Rhys parameter,but also to molecular spectra not readily accessible under normal laboratory *** results point to a new direction for predicting and understanding molecular spectroscopy,exploiting the power of quantum simulation.

关键词： Molecular spectroscopy Circuit quantum electrodynamics Correlation function Huang-Rhys parameter

Speedup in classical simulation of Gaussian boson sampling

在线全文

学校读者我要写书评

暂无评论

Science Bulletin 2020年第10期65卷 832-841,M0004页

作者： Bujiao Wu Bin Cheng Fei Jia Jialin Zhang man-hong yung Xiaoming Sun Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China Institute for Quantum Science and Engineering Department of PhysicsSouthern University of Science and TechnologyShenzhen 518055China Shenzhen Key Laboratory of Quantum Science and Engineering Southern University of Science and TechnologyShenzhen 518055China Central Research Institute Huawei TechnologiesShenzhen 518129China CAS Center of Excellence in Topological Quantum Computation Beijing 100190China

Gaussian boson sampling is an alternative model for demonstrating quantum computational supremacy,where squeezed states are injected into every input mode, instead of applying single photons as in the case of standard boson sampling. Here by analyzing numerically the computational costs, we establish a lower bound for achieving quantum computational supremacy for a class of Gaussian bosonsampling problems. Specifically, we propose a more efficient method for calculating the transition probabilities, leading to a significant reduction of the simulation costs. Particularly, our numerical results indicate that one can simulate up to 18 photons for Gaussian boson sampling at the output subspace on a normal laptop, 20 photons on a commercial workstation with 256 cores, and about 30 photons for supercomputers. These numbers are significantly smaller than those in standard boson sampling, suggesting that Gaussian boson sampling could be experimentally-friendly for demonstrating quantum computational supremacy.

关键词： Gaussian boson sampling Classical simulation Hafnian Probability distribution Marginal distribution Quantum optics

QRLSchedule: A Novel DRL-based Scheduling Framework for Automatic Maintenance of Qubit Control Parameters

在线全文

学校读者我要写书评

暂无评论

QRLSchedule: A Novel DRL-based Scheduling Framework for Auto...

Experimental cryptographic verification for near-term quantum cloud computing

第43届中国控制会议

作者： Weiqi Ruan Kai Luo Jiangyu Cui man-hong yung Southern University of Science and Technology University of Science and Technology of China

Quantum computing is a disruptive computing paradigm with potential applications in cybersecurity, artificial intelligence, and drug discovery. However, the experimental performance of quantum algorithm is severely limited by the stability and control precision of the quantum chip. This work aims to develop an efficient scheduling framework for maintaining parameters of quantum chip and control pulse automatically. We introduce a novel reinforcement learning framework called QRLSchedule formulating the scheduling for maintenance of parameters as a learning problem and propose the Machine-First-Operation-Second(MFOS) method to reduce the agent's inference time in Reinforcement Learning. The results of numerical simulations show an average improvement of 86.74% in makespan over Constrained Programming(CP) based scheduling method, demonstrating the effectiveness of the method.

关键词： Quantum Computing Reinforcement Learning Machine Learning Optimization Job Shop Scheduling

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Science Bulletin 2021年第1期66卷 23-28,M0003页

作者： Xi Chen Bin Cheng Zhaokai Li Xinfang Nie Nengkun Yu man-hong yung Xinhua Peng Hefei National Laboratory for Physical Sciences at the Microscale and Department of Modern Physics University of Science and Technology of China(USTC)Hefei 230026China CAS Key Laboratory of Microscale Magnetic Resonance USTCHefei 230026China Synergetic Innovation Center of Quantum Information and Quantum Physics USTCHefei 230026China Department of Physics Southern University of Science and TechnologyShenzhen 518055China Shenzhen Institute for Quantum Science and Engineering Southern University of Science and TechnologyShenzhen 518055China Guangdong Provincial Key Laboratory of Quantum Science and Engineering Southern University of Science and TechnologyShenzhen 518055China Shenzhen Key Laboratory of Quantum Science and Engineering Southern University of Science and TechnologyShenzhen 518055China Centre for Quantum Software and Information School of SoftwareFaculty of Engineering and Information TechnologyUniversity of Technology SydneyNSW 2007Australia

An important task for quantum cloud computing is to make sure that there is a real quantum computer running,instead of classical *** we explore the applicability of a cryptographic verification scheme for verifying quantum cloud *** provided a theoretical extension and implemented the scheme on a 5-qubit NMR quantum processor in the laboratory and a 5-qubit and 16-qubit processors of the IBM quantum *** found that the experimental results of the NMR processor can be verified by the scheme with about 1.4%error,after noise compensation by standard ***,the fidelity of the IBM quantum cloud is currently too low to pass the test(about 42%error).This verification scheme shall become practical when servers claim to offer quantum-computing resources that can achieve quantum supremacy.

关键词： Quantum computation NMR quantum computing Verification Quantum cloud computing