Conferences  >  Informatics  >  Information Theory, Foundations of Computer Science  >  United States

Association for Computing Machinery (ACM)

The 35th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA ’23) is sponsored by the ACM Special Interest Groups on Algorithms and Computation Theory (SIGACT) and Computer Architecture (SIGARCH) and organized in cooperation with the European Association for Theoretical Computer Science.  The conference will run from June 17th to June 19th, 2023. Workshops and tutorials will be on June 16th. SPAA 2023 will be held as part of ACM FCRC in Orlando, Florida.

University of New Mexico, Albuquerque

The twelfth International Conference, AQC 2023, will bring together researchers from different communities to explore this computational paradigm and related topics. The goal of the conference is to promote a dialogue on the open theoretical questions and experimental challenges that must be addressed to realize practically useful adiabatic quantum computing and quantum annealing in existing and near-term hardware.

Quantum Mechanics and Quantum Information Theory,    Quantum Information Theory and Quantum Computing

Institute for Pure and Applied Mathematics (IPAM), UCLA

The recent development of quantum algorithms has significantly pushed forward the frontier of using quantum computers for performing a wide range of scientific computing problems. This includes solving numerical linear algebra tasks for very large matrices, such as solving linear systems, eigenvalue decomposition, singular value decomposition, matrix function evaluation etc, as well as solving certain high dimensional linear and nonlinear differential equations, such as heat equations and wave equations. This workshop aims to bring together leading experts across different disciplines, including experts in solving related tasks using classical computers that can potentially inspire the development of new quantum algorithms; discuss recent progress made in the development of quantum algorithms for linear algebra and differential equations and the advances in classical algorithms; foster the discussion and pave the path towards identifying and overcoming challenging problems in science and engineering and for various industrial and technological applications.

Part of the Long Program Mathematical and Computational Challenges in Quantum Computing

Quantum Mechanics and Quantum Information Theory,    Quantum Information Theory and Quantum Computing

Institute for Pure and Applied Mathematics (IPAM), UCLA

What will quantum computers be useful for once we have them? Machine learning and optimization would be important applications if quantum computers were useful for them, but the level of quantum benefit is unknown. One aim of the workshop is to bring together experts in classical and quantum machine learning to discuss the role of mathematical proof as well as experimentation in understanding these topics. A second aim is to explore how classical machine learning techniques can help us build better quantum computers.

Part of the Long Program Mathematical and Computational Challenges in Quantum Computing

Quantum Mechanics and Quantum Information Theory,    Quantum Information Theory and Quantum Computing

Institute for Pure and Applied Mathematics (IPAM), UCLA

The ability to create and manipulate complex quantum states offers the potential for dramatic increases in computational power, measurement sensitivity, and information security. Understanding the dynamics of such entangled many-body states raises a number of mathematical and physical questions, as such states often lie beyond standard approximate descriptions used in different areas of physics. This workshop is devoted to the related problems of how quantum and classical computers can be used to attack important problems in many-body quantum mechanics across application domains. While the faithful representation of full many-particle Hilbert spaces on a classical computer is exponentially costly, efficient approximate representations for specific purposes have been discovered, such as tensor networks. Studying the dynamics of quantum computers in the current NISQ area leads naturally to questions of robustness and control.

Part of the Long Program Mathematical and Computational Challenges in Quantum Computing

Quantum Mechanics and Quantum Information Theory,    Quantum Information Theory and Quantum Computing

The ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) is an internationally renowned forum for researchers, practitioners, and educators to present and discuss the most recent innovations, trends, experiences, and challenges in the field of software engineering. ESEC/FSE brings together experts from academia and industry to exchange the latest research results and trends as well as their practical application in all areas of software engineering.

Institute for Pure and Applied Mathematics (IPAM), UCLA

The goal of finding better quantum error correcting codes gains motivation not just in fault tolerant quantum computing, but also for attacking major open questions in quantum complexity theory. This workshop will bring together leading researchers working on both the areas, with the aim of making progress on questions such as the quantum PCP conjecture, better quantum LDPC codes, quantum local testability and tests for quantumness.

Part of the Long Program Mathematical and Computational Challenges in Quantum Computing