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

Low-overhead pieceable fault-tolerant construction of logical controlled-phase circuit for degenerate quantum code*

学校读者我要写书评

暂无评论

Low-overhead pieceable fault-tolerant construction of logica...

IEEE International Conference on Artificial Intelligence and computer Applications (ICAICA)

作者： Chen Lin Guowu Yang Jinzhao Wu Big Data Research Center School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu P.R. China Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis Guangxi University for Nationalities Nanning

ISBN: (数字)9781728170053

ISBN: (纸本)9781728170060

We propose a non-transversal but pieceable fault-tolerant conversion circuit that is used to convert encoded information between five-qubit code and seven-qubit CSS code. Since a syndrome extraction circuit requiring fewer ancillary qubit resources would facilitate the realization of large-scale quantum computations, we further adapt a flag-assisted fault-tolerant syndrome measurement scheme to reduce the cost of ancillary preparation. Numerical simulations are also performed to further analyze the performance of our conversion method.

关键词： Fault tolerance Fault tolerant systems Quantum computing Logic gates Circuit faults Error analysis Error correction codes

An integrated transcriptomic cell atlas of human neural organoids (vol 635, pg 690, 2024)

学校读者我要写书评

暂无评论

NATURE 2025年第8045期637卷 E21-E21页

作者： He, Zhisong Dony, Leander Fleck, Jonas Simon Szalata, Artur Li, Katelyn X. Sliskovic, Irena Lin, Hsiu-Chuan Santel, Malgorzata Atamian, Alexander Quadrato, Giorgia Sun, Jieran Pasca, Sergiu P. Camp, J. Gray Theis, Fabian J. Treutlein, Barbara Department of Biosystems Science and Engineering ETH Zürich Basel Switzerland Institute of Computational Biology Computational Health Center Helmholtz Munich Neuherberg Germany Department Genes and Environment Max Planck Institute of Psychiatry Munich Germany International Max Planck Research School for Translational Psychiatry (IMPRS-TP) Munich Germany TUM School of Life Sciences Weihenstephan Technical University of Munich Freising Germany School of Computation Information and Technology Technical University of Munich Munich Germany Department of Physiology and Pharmacology Karolinska Institutet Stockholm Sweden Institute of Human Biology (IHB) Roche Pharma Research and Early Development Roche Innovation Center Basel Basel Switzerland Biozentrum University of Basel Basel Switzerland Department of Stem Cell Biology and Regenerative Medicine Keck School of Medicine University of Southern California Los Angeles CA USA Eli and Edythe Broad CIRM Center for Regenerative Medicine and Stem Cell Research at USC Keck School of Medicine University of Southern California Los Angeles CA USA Department of Psychiatry and Behavioral Sciences Stanford University Stanford CA USA Stanford Brain Organogenesis Program Wu Tsai Neurosciences Institute and Bio-X Stanford CA USA Neural Stem Cell Institute Albany NY USA UK Dementia Research Institute at the University of Edinburgh Edinburgh Bioquarter Edinburgh UK Centre for Discovery Brain Sciences School of Biomedical Sciences College of Medicine and Veterinary Medicine The University of Edinburgh Edinburgh UK Human Technopole Milan Italy Department of Oncology and Hemato-Oncology University of Milan Milan Italy

Variational Quantum Algorithms for Semidefinite Programming

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Patel, Dhrumil Coles, Patrick J. Wilde, Mark M. Department of Computer Science Cornell University IthacaNY14850 United States Theoretical Division Los Alamos National Laboratory Los AlamosNM87545 United States Hearne Institute for Theoretical Physics Department of Physics and Astronomy Center for Computation and Technology Louisiana State University Baton RougeLA70803 United States School of Electrical and Computer Engineering Cornell University IthacaNY14850 United States

A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N " M, where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings. © 2021, CC BY.

关键词： Combinatorial optimization

Estimating distinguishability measures on quantum computers

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Rethinasamy, Soorya Agarwal, Rochisha Sharma, Kunal Wilde, Mark M. Hearne Institute for Theoretical Physics Department of Physics and Astronomy Center for Computation and Technology Louisiana State University Baton RougeLA70803 United States School of Applied and Engineering Physics Cornell University IthacaNY14850 United States Department of Physics Indian Institute of Technology Roorkee Uttarakhand Roorkee India School of Electrical and Computer Engineering Cornell University IthacaNY14850 United States Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States IBM Quantum IBM T.J. Watson Research Center Yorktown HeightsNY10598 United States

The performance of a quantum information processing protocol is ultimately judged by distinguishability measures that quantify how distinguishable the actual result of the protocol is from the ideal case. The most prominent distinguishability measures are those based on the fidelity and trace distance, due to their physical interpretations. In this paper, we propose and review several algorithms for estimating distinguishability measures based on trace distance and fidelity. The algorithms can be used for distinguishing quantum states, channels, and strategies (the last also known in the literature as "quantum combs"). The fidelity-based algorithms offer novel physical interpretations of these distinguishability measures in terms of the maximum probability with which a single prover (or competing provers) can convince a verifier to accept the outcome of an associated computation. We simulate many of these algorithms by using a variational approach with parameterized quantum circuits. We find that the simulations converge well in both the noiseless and noisy scenarios, for all examples considered. Furthermore, the noisy simulations exhibit a parameter noise resilience. Finally, we establish a strong relationship between various quantum computational complexity classes and distance estimation problems. Copyright © 2021, The Authors. All rights reserved.

关键词： Quantum optics

Anatomical organization of temporally correlated neural calcium activity in the hippocampal CA1 region

学校读者我要写书评

暂无评论

iscience 2023年第5期26卷 106703页

作者： Chen, Lujia Lin, Xiaoxiao Ye, Qiao Nenadic, Zoran Holmes, Todd C. Nitz, Douglas A. Xu, Xiangmin Department of Anatomy and Neurobiology School of Medicine University of California Irvine Irvine 92697-1275 CA United States Department of Physiology and Biophysics School of Medicine University of California Irvine Irvine 92697- 4560 CA United States Department of Cognitive Science University of California La Jolla San Diego La Jolla 92093 CA United States Department of Biomedical Engineering University of California Irvine Irvine 92697-2715 CA United States Department of Microbiology and Molecular Genetics University of California Irvine Irvine 92697-4025 CA United States Department of Computer Science University of California Irvine Irvine 92697-3435 CA United States The Center for Neural Circuit Mapping University of California Irvine Irvine 92697 CA United States

Hippocampal CA1 neuronal ensembles generate sequential patterns of firing activity that contribute to episodic memory formation and spatial cognition. Here we used in vivo calcium imaging to record neural ensemble activities in mouse hippocampal CA1 and identified CA1 excitatory neuron sub-populations whose members are active across the same second-long period of time. We identified groups of hippocampal neurons sharing temporally correlated neural calcium activity during behavioral exploration and found that they also organized as clusters in anatomical space. Such clusters vary in membership and activity dynamics with respect to movement in different environments, but also appear during immobility in the dark suggesting an internal dynamic. The strong covariance between dynamics and anatomical location within the CA1 sub-region reveals a previously unrecognized form of topographic representation in hippocampus that may guide generation of hippocampal sequences across time and therefore organize the content of episodic memory. © 2023 The Author(s)

关键词： Cellular neuroscience Molecular neuroscience Neuroscience

Fuzzy c-means clustering for persistence diagrams

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Davies, Thomas Aspinall, Jack Wilder, Bryan Tran-Thanh, Long Electronics and Computer Science University of Southampton United Kingdom Department of Materials University of Oxford United Kingdom Center for Research on Computation and Society John A. Paulson School of Engineering and Applied Sciences Harvard University United States Department of Computer Science University of Warwick United Kingdom

Persistence diagrams concisely represent the topology of a point cloud whilst having strong theoretical guarantees, but the question of how to best integrate this information into machine learning workflows remains open. In this paper we extend the ubiquitous Fuzzy c-Means (FCM) clustering algorithm to the space of persistence diagrams, enabling unsupervised learning that automatically captures the topological structure of data without the topological prior knowledge or additional processing of persistence diagrams that many other techniques require. We give theoretical convergence guarantees that correspond to the Euclidean case, and empirically demonstrate the capability of our algorithm to capture topological information via the fuzzy RAND index. We end with experiments on two datasets that utilise both the topological and fuzzy nature of our algorithm: pre-trained model selection in machine learning and lattices structures from materials science. As pre-trained models can perform well on multiple tasks, selecting the best model is a naturally fuzzy problem;we show that fuzzy clustering persistence diagrams allows for model selection using the topology of decision boundaries. In materials science, we classify transformed lattice structure datasets for the first time, whilst the probabilistic membership values let us rank candidate lattices in a scenario where further investigation requires expensive laboratory time and expertise. © 2020, CC BY.

关键词： Graphic methods

Generalized unscented transformation for forecasting non-Gaussian processes

学校读者我要写书评

暂无评论

Physical Review E 2025年第5期111卷 054135-054135页

作者： Donald Ebeigbe Tyrus Berry Andrew J. Whalen Michael M. Norton Dan Simon Timothy D. Sauer Steven J. Schiff Department of Electrical Engineering Pennsylvania State University University Park Pennsylvania USA Department of Mathematical Sciences George Mason University Fairfax Virginia USA Department of Neurosurgery School of Medicine Yale University New Haven Connecticut USA Department of Neurosurgery Massachusetts General Hospital Harvard Medical School Boston Massachusetts USA Center for Neural Engineering Department of Engineering Science and Mechanics Pennsylvania State University University Park Pennsylvania USA Department of Electrical Engineering and Computer Science Cleveland State University Cleveland Ohio USA Department of Epidemiology of Microbial Diseases Yale University New Haven Connecticut USA

The observations of linear and nonlinear physical processes are subject to random errors, which can be represented by a wide variety of probability distributions. In contrast, most estimation and inference techniques rely on a Gaussian assumption, which may limit our ability to make model-based predictions. There is a need for data assimilation methods that can capture and leverage the higher moments of these physical processes for state estimation and forecasting. In this paper, we develop the generalized unscented transform (GenUT), which uses a minimal number of sample points to accurately capture elements of the higher moments of most probability distributions. Constraints can be analytically enforced on the sample points while guaranteeing at least second-order accuracy. The GenUT is widely applicable to non-Gaussian distributions, which can substantially improve the assimilation of observations of nonlinear physics, such as the modeling of infectious diseases.

关键词： Gaussian distribution

Exact solution for the quantum and private capacities of bosonic dephasing channels

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Lami, Ludovico Wilde, Mark M. Institut für Theoretische Physik und IQST Universität Ulm Albert-Einstein-Allee 11 UlmD-89069 Germany QuSoft Science Park 123 Amsterdam1098 XG Netherlands Korteweg–de Vries Institute for Mathematics University of Amsterdam Science Park 105-107 Amsterdam1098 XG Netherlands Institute for Theoretical Physics University of Amsterdam Science Park 904 Amsterdam1098 XH Netherlands Hearne Institute for Theoretical Physics Department of Physics and Astronomy Center for Computation and Technology Louisiana State University Baton RougeLA70803 United States School of Electrical and Computer Engineering Cornell University IthacaNY14850 United States

The capacities of noisy quantum channels capture the ultimate rates of information transmission across quantum communication lines, and the quantum capacity plays a key role in determining the overhead of fault-tolerant quantum computation platforms. In the case of bosonic systems, central to many applications, no closed formulas for these capacities were known for bosonic dephasing channels, a key class of non-Gaussian channels modelling, e.g., noise affecting superconducting circuits or fiber-optic communication channels. Here we provide the first exact calculation of the quantum, private, two-way assisted quantum, and secret-key agreement capacities of all bosonic dephasing channels. We prove that that they are equal to the relative entropy of the distribution underlying the channel to the uniform distribution. Our result solves a problem that has been open for over a decade, having been posed originally by [Jiang & Chen, Quantum and Nonlinear Optics 244, 2010]. Copyright © 2022, The Authors. All rights reserved.

关键词： Quantum communication

Digital Twins of Business Processes: A Research Manifesto

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Fornari, Fabrizio Compagnucci, Ivan De Donato, Massimo Callisto Bertrand, Yannis Beyel, Harry H. Carrión, Emilio Franceschetti, Marco Groher, Wolfgang Grüger, Joscha Kilic, Emre Koschmider, Agnes Leotta, Francesco Li, Chiao-Yun Lugaresi, Giovanni Malburg, Lukas Mangler, Juergen Mecella, Massimo Pastor, Oscar Riss, Uwe Seiger, Ronny Serral, Estefania Torres, Victoria Valderas, Pedro University of Camerino School of Science and Technology Computer Science Department Via Madonna delle Carceri 7 Camerino62032 Italy Gran Sasso Science Institute Computer Science Department Viale Francesco Crispi 7 L’Aquila67100 Italy University of St.Gallen Institute of Computer Science Rosenbergstrasse 30 St.Gallen9000 Switzerland University of Bayreuth Business Informatics and Process Analytics Wittelsbacherring 8 Bayreuth95444 Germany Fraunhofer Institute for Applied Information Technology Schloss Birlinghoven Sankt Augustin53757 Germany RWTH Aachen University Ahornstraße 55 Aachen52074 Germany Mercadona Tech Mercadona Plaza de Amèrica 2 Valencia46004 Spain PROS Research Center - VRAIN Institute Universitat Politècnica de València Camino de Vera Valencia46022 Spain TU Dortmund University Leonhard-Euler-Str. 5 Dortmund44227 Germany KU Leuven Warmoesberg 26 Brussels1000 Belgium Sapienza Università di Roma DIAG via Ariosto 25 Rome00185 Italy KU Leuven Faculty of Engineering Technology Celestijnenlaan 300 Leuven3001 Belgium Branch Trier University Behringstraße 21 Trier54296 Germany Artificial Intelligence and Intelligent Information Systems Trier University Universitätsring 15 Trier54296 Germany OST Eastern Switzerland University of Applied Sciences Rosenbergstrasse 59 St. Gallen9001 Switzerland TUM School of Computation Information and Technology Boltzmannstraße 3 Garching bei München85748 Germany

Modern organizations necessitate continuous business processes improvement to maintain efficiency, adaptability, and competitiveness. In the last few years, the Internet of Things, via the deployment of sensors and actuators, has heavily been adopted in organizational and industrial settings to monitor and automatize physical processes influencing and enhancing how people and organizations work. Such advancements are now pushed forward by the rise of the Digital Twin paradigm applied to organizational processes. Advanced ways of managing and maintaining business processes come within reach as there is a Digital Twin of a business process - a virtual replica with real-time capabilities of a real process occurring in an organization. Combining business process models with real-time data and simulation capabilities promises to provide a new way to guide day-to-day organization activities. However, integrating Digital Twins and business processes is a non-trivial task, presenting numerous challenges and ambiguities. This manifesto paper aims to contribute to the current state of the art by clarifying the relationship between business processes and Digital Twins, identifying ongoing research and open challenges, thereby shedding light on and driving future exploration of this innovative interplay. © 2024, CC BY-NC-ND.

关键词： Virtual corporation