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

arXiv 2020年

作者： Hashim, Akel Naik, Ravi K. Morvan, Alexis Ville, Jean-Loup Mitchell, Bradley Kreikebaum, John Mark Davis, Marc Smith, Ethan Iancu, Costin O'Brien, Kevin P. Hincks, Ian Wallman, Joel J. Emerson, Joseph Siddiqi, Irfan Quantum Nanoelectronics Laboratory Department of Physics University of California at Berkeley BerkeleyCA94720 United States Graduate Group in Applied Science and Technology University of California at Berkeley BerkeleyCA94720 United States Computational Research Division Lawrence Berkeley National Lab BerkeleyCA94720 United States Materials Sciences Division Lawrence Berkeley National Lab BerkeleyCA94720 United States Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA United States Quantum Benchmark Inc. KitchenerONN2H 5G5 Canada Institute for Quantum Computing and Department of Applied Mathematics University of Waterloo WaterlooONN2L 3G1 Canada

The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic miscalibrations, drift, and crosstalk in the control of qubits can lead to a coherent form of error which has no classical analog. Coherent errors severely limit the performance of quantum algorithms in an unpredictable manner, and mitigating their impact is necessary for realizing reliable quantum computations. Moreover, the average error rates measured by randomized benchmarking and related protocols are not sensitive to the full impact of coherent errors, and therefore do not reliably predict the global performance of quantum algorithms, leaving us unprepared to validate the accuracy of future large-scale quantum computations. Randomized compiling is a protocol designed to overcome these performance limitations by converting coherent errors into stochastic noise, dramatically reducing unpredictable errors in quantum algorithms and enabling accurate predictions of algorithmic performance from error rates measured via cycle benchmarking. In this work, we demonstrate significant performance gains under randomized compiling for the four-qubit quantum Fourier transform algorithm and for random circuits of variable depth on a superconducting quantum processor. Additionally, we accurately predict algorithm performance using experimentally-measured error rates. Our results demonstrate that randomized compiling can be utilized to leverage and predict the capabilities of modern-day noisy quantum processors, paving the way forward for scalable quantum computing. Copyright © 2020, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Variational regularization of inverse problems for manifold-valued data

arXiv

引用

arXiv 2018年

作者： Storath, Martin Weinmann, Andreas Image Analysis and Learning Group Interdisciplinary Center for Scientific Computing Universität Heidelberg Germany Department of Mathematics and Natural Sciences Hochschule Darmstadt Institute of Computational Biology Helmholtz Zentrum München Germany

In this paper, we consider the variational regularization of manifold-valued data in the inverse problems setting. In particular, we consider TV and TGV regularization for manifoldvalued data with indirect measurement operators. We provide results on the well-posedness and present algorithms for a numerical realization of these models in the manifold setup. Further, we provide experimental results for synthetic and real data to show the potential of the proposed schemes for *** Codes 94A08, 68U10, 90C90, 53B99, 65K10 Copyright © 2018, The Authors. All rights reserved.

关键词： Differential equations

来源：评论

学校读者我要写书评

暂无评论

Quantum Simulation for High-Energy Physics

引用

PRX Quantum 2023年第2期4卷 027001-027001页

作者： Christian W. Bauer Zohreh Davoudi A. Baha Balantekin Tanmoy Bhattacharya Marcela Carena Wibe A. de Jong Patrick Draper Aida El-Khadra Nate Gemelke Masanori Hanada Dmitri Kharzeev Henry Lamm Ying-Ying Li Junyu Liu Mikhail Lukin Yannick Meurice Christopher Monroe Benjamin Nachman Guido Pagano John Preskill Enrico Rinaldi Alessandro Roggero David I. Santiago Martin J. Savage Irfan Siddiqi George Siopsis David Van Zanten Nathan Wiebe Yukari Yamauchi Kübra Yeter-Aydeniz Silvia Zorzetti Physics Division Lawrence Berkeley National Laboratory Berkeley California 94720 USA Department of Physics Maryland Center for Fundamental Physics and the NSF Institute for Robust Quantum Simulation University of Maryland College Park Maryland 20742 USA Department of Physics University of Wisconsin Madison Wisconsin 53706 USA T-2 Los Alamos National Laboratory Los Alamos New Mexico 87545 USA Fermi National Accelerator Laboratory Batavia Illinois 60510 USA Enrico Fermi Institute University of Chicago Chicago Illinois 60637 USA Kavli Institute for Cosmological Physics University of Chicago Chicago Illinois 60637 USA Department of Physics University of Chicago Chicago Illinois 60637 USA Department of Physics and Illinois Center for the Advanced Study of the Universe and Illinois Quantum Information Science and Technology Center University of Illinois Urbana Illinois 61801 USA QuEra Computing Inc Boston Massachusetts 02135 USA Department of Mathematics University of Surrey Guildford Surrey GU2 7XH United Kingdom Center for Nuclear Theory Department of Physics and Astronomy Stony Brook University New York 11794-3800 USA Department of Physics Brookhaven National Laboratory Upton New York 11973 USA Peng Huanwu Center for Fundamental Theory Hefei Anhui 230026 China Interdisciplinary Center for Theoretical Study University of Science and Technology of China Hefei Anhui 230026 China Pritzker School of Molecular Engineering Chicago Quantum Exchange and Kadanoff Center for Theoretical Physics University of Chicago Illinois 60637 USA qBraid Co. Harper Court 5235 Chicago Illinois 60615 USA Department of Physics Harvard University Cambridge Massachusetts 02138 USA Department of Physics and Astronomy University of Iowa Iowa City Iowa 52242 USA Duke Quantum Center Duke University Durham North Carolina 27701 USA Department of Electrical and Computer Engineering Duke University Durham North Carolina 27708 USA Department of Physics Duke University

It is for the first time that quantum simulation for high-energy physics (HEP) is studied in the U.S. decadal particle-physics community planning, and in fact until recently, this was not considered a mainstream topic in the community. This fact speaks of a remarkable rate of growth of this subfield over the past few years, stimulated by the impressive advancements in quantum information sciences (QIS) and associated technologies over the past decade, and the significant investment in this area by the government and private sectors in the U.S. and other countries. High-energy physicists have quickly identified problems of importance to our understanding of nature at the most fundamental level, from tiniest distances to cosmological extents, that are intractable with classical computers but may benefit from quantum advantage. They have initiated, and continue to carry out, a vigorous program in theory, algorithm, and hardware co-design for simulations of relevance to the HEP mission. This Roadmap is an attempt to bring this exciting and yet challenging area of research to the spotlight, and to elaborate on what the promises, requirements, challenges, and potential solutions are over the next decade and beyond.

关键词： Quantum simulation

来源：评论

学校读者我要写书评

暂无评论

A reduction method for Riccati-based control of the Fokker-Planck equation

引用

IFAC-PapersOnLine 2017年第1期50卷 1631-1636页

作者： Breiten T. Kunisch K. Pfeiffer L. Institute for Mathematics and Scientific Computing Karl-Franzens-Universität Heinrichstrasse 36 Graz A8010 Austria Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy of Sciences Altenbergerstrasse 69 Linz A4040 Austria

A control strategy which allows to speed up the convergence of a bilinear system governed by the Fokker-Planck equation to its stationary distribution is developed. After linearization of the state equation, a linear feedback control is computed by solving the Riccati equation associated with the linearized problem. A reduction method for approximating this feedback is proposed. From a numerical point of view, this method avoids the resolution of a high-dimensional Riccati equation. Numerical results are provided for a double-well potential and the efficiency of the reduction method is demonstrated. © 2017

关键词： bilinear systems control of partial differential equations Fokker-Planck equation Output feedback control Riccati equation

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to: A convergent adaptive finite element method for elliptic Dirichlet boundary control problems

引用

IMA Journal of Numerical Analysis 2020年第1期40卷 800-800页

作者： Gong, Wei Liu, Wenbin Tan, Zhiyu Yan, Ningning National Center for Mathematics and Interdisciplinary Sciences Chinese Academy of Sciences Beijing China The State Key Laboratory of Scientific and Engineering Computing Chinese Academy of Sciences Beijing China Institute of Computational Mathematics Chinese Academy of Sciences Beijing China Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China Kent Business School University of Kent Kent UK Department of Mathematics Hong Kong Baptist University Kowloon Tong Hong Kong SAR NCMIS Chinese Academy of Sciences Beijing China LSEC Chinese Academy of Sciences Beijing China Institute of Systems Science Chinese Academy of Sciences Beijing China

来源：评论

学校读者我要写书评

暂无评论

A monotone scheme for sparsity optimization in lp with p Є (0,1]

引用

IFAC-PapersOnLine 2017年第1期50卷 494-499页

作者： Ghilli D. Kunisch K. Institute of Mathematics and Scientific Computing Karl-Franzens-Universitaät Heinrichstrasse 36 Graz A8010 Austria Johann Radon Institute for Computational and Applied Mathematics(RICAM) Austrian Academy of Sciences Altenbergerstrasse 69 Linz A4040 Austria

Nonsmooth nonconvex optimization problems are considered in infinite dimensional sequence spaces lp with p Є (0,1]. Our starting points are necessary optimality conditions in the form of a complementary system and a monotonically convergent algorithm for a regularized version of the original problem. We propose an algorithm for solving the necessary optimality condition based on a combination of the monotone scheme and an active-set strategy. Numerical results for different test cases are provided, e.g. for optimal control problems and microscopy image reconstruction. © 2017

关键词： active-set method image reconstruction monotone algorithm nonsmooth nonconvex optimization optimal control problems sparsity optimization

来源：评论

学校读者我要写书评

暂无评论

AbdomenCT-1K: Is abdominal organ segmentation a solved problem?

arXiv

引用

arXiv 2020年

作者： Ma, Jun Zhang, Yao Gu, Song Zhu, Cheng Ge, Cheng Zhang, Yichi An, Xingle Wang, Congcong Wang, Qiyuan Liu, Xin Cao, Shucheng Zhang, Qi Liu, Shangqing Wang, Yunpeng Li, Yuhui He, Jian Yang, Xiaoping Department of Mathematics Nanjing University of Science and Technology China Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences China AI Lab Lenovo Research School of Automation Nanjing University of Information Science and Technology China Shenzhen Haichuang Medical CO. LTD. China Institute of Bioinformatics and Medical Engineering Jiangsu University of Technology China School of Biological Science and Medical Engineering Beihang University China Beijing Infervision Technology CO. LTD. China School of Computer Science and Engineering Tianjin University of Technology China Department of Computer Science Norwegian University of Science and Technology Norway School of Electronic Science and Engineering Nanjing University China Suzhou LungCare Medical Technology Co. Ltd China Bioengineering Biological and Environmental Science and Engineering Division King Abdullah University of Science and Technology Saudi Arabia Department of Computer and Information Science Faculty of Science and Technology University of Macau China School of Biomedical Engineering Southern Medical University China Institutes of Biomedical Sciences Fudan University China Computational Biology University of Southern California United States Department of Radiology Nanjing Drum Tower Hospital The Affiliated Hospital Nanjing University Medical School China Department of Mathematics Nanjing University China

With the unprecedented developments in deep learning, automatic segmentation of main abdominal organs seems to be a solved problem as state-of-the-art (SOTA) methods have achieved comparable results with inter-rater variability on many benchmark datasets. However, most of the existing abdominal datasets only contain single-center, single-phase, single-vendor, or single-disease cases, and it is unclear whether the excellent performance can generalize on diverse datasets. This paper presents a large and diverse abdominal CT organ segmentation dataset, termed AbdomenCT-1K, with more than 1000 (1K) CT scans from 12 medical centers, including multi-phase, multi-vendor, and multi-disease cases. Furthermore, we conduct a large-scale study for liver, kidney, spleen, and pancreas segmentation and reveal the unsolved segmentation problems of the SOTA methods, such as the limited generalization ability on distinct medical centers, phases, and unseen diseases. To advance the unsolved problems, we further build four organ segmentation benchmarks for fully supervised, semi-supervised, weakly supervised, and continual learning, which are currently challenging and active research topics. Accordingly, we develop a simple and effective method for each benchmark, which can be used as out-of-the-box methods and strong baselines. We believe the AbdomenCT-1K dataset will promote future in-depth research towards clinical applicable abdominal organ segmentation methods. © 2020, CC BY-NC-SA.

关键词： Computerized tomography

来源：评论

学校读者我要写书评

暂无评论

Multilevel monte carlo simulations of composite structures with uncertain manufacturing defects

arXiv

引用

arXiv 2019年

作者： Dodwell, T.J. Kynaston, S. Butler, R. Haftka, R.T. Kim, Nam H. Scheichl, R. College of Engineering Mathematics and Physical Sciences University of Exeter United Kingdom Alan Turing Institute LondonNW1 2DB United Kingdom Department of Mathematical Sciences University of Bath Bath United Kingdom Department of Mechanical Engineering University of Bath BathBA2 7AY United Kingdom Department of Mechanical and Aerospace Engineering University of Florida FL United States Interdisciplinary Center for Scientific Computing University of Heidelberg Germany

By adopting a Multilevel Monte Carlo (MLMC) framework, we show that only a handful of costly fine scale computations are needed to accurately estimate statistics of the failure of a composite structure, as opposed to the thousands typically needed in classical Monte Carlo analyses. We introduce the MLMC method, compare its theoretical complexity with classical Monte Carlo, and give a simple-to-implement algorithm which includes a simple extension called MLMC with selective refinement to efficiently calculated structural failure probabilities. To demonstrate the huge computational gains we present two benchmark problems in composites: (1) the effects of fibre waviness on the compressive strength of a composite material, (2) uncertain buckling performance of a composite panel with uncertain ply orientations. For our most challenging test case, estimating a rare (∼ 1/150) probability of buckling failure of a composite panel, we see a speed-up factor > 1000. Our approach distributed over 1024 processors reduces the computation time from 218 days to just 4.5 hours. This level of speed up makes stochastic simulations that would otherwise be unthinkable now possible. Copyright © 2019, The Authors. All rights reserved.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

A decoupling two-grid method for the time-dependent poisson-nernst-planck equations

arXiv

引用

arXiv 2018年

作者： Shen, Ruigang Shu, Shi Yang, Ying Lu, Benzhuo School of Mathematics and Computational Science Xiangtan University Xiangtan Hunan411105 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan Hunan411105 China School of Mathematics and Computational Science Guangxi Colleges Universities Key Laboratory of Data Analysis and Computation Guangxi Key Laboratory of Cryptography and information Security Guilin University of Electronic Technology Guilin Guangxi541004 China Institute of Computational Mathematics and Scientific/Engineering Computing National Center for Mathematics and Interdisciplinary Sciences Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

We study a two-grid strategy for decoupling the time-dependent Poisson-Nernst-Planck equations describing the mass concentration of ions and the electrostatic potential. The computational system is decoupled to smaller systems by using coarse space solutions at each time level, which can speed up the solution process compared with the finite element method combined with the Gummel iteration. We derive the optimal error estimates in L2 norm for both semi- and fully discrete finite element approximations. Based on the a priori error estimates, the error estimates in H1 norm are presented for the two-grid algorithm. The theoretical results indicate this decoupling method can retain the same accuracy as the finite element method. Numerical experiments including the Poisson-Nernst-Planck equations for an ion channel show the efficiency and effectiveness of the decoupling two-grid method. Copyright © 2018, The Authors. All rights reserved.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

Two-scale sparse finite element approximations

引用

Science China mathematics 2016年第4期59卷 789-808页

作者： LIU Fang ZHU JinWei School of Statistics and Mathematics Central University of Finance and Economics The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and ScientificEngineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of Sciences

To reduce computational cost,we study some two-scale finite element approximations on sparse grids for elliptic partial differential equations of second order in a general *** any tensor product domain ?R^d with d = 2,3,we construct the two-scale finite element approximations for both boundary value and eigenvalue problems by using a Boolean sum of some existing finite element approximations on a coarse grid and some univariate fine grids and hence they are cheaper *** applications,we obtain some new efficient finite element discretizations for the two classes of problem:The new two-scale finite element approximation on a sparse grid not only has the less degrees of freedom but also achieves a good accuracy of approximation.

关键词： combination discretization eigenvalue finite element postprocessing two-scale

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：