BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Gemini Center on Quantum Computing - ECPv5.15.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Gemini Center on Quantum Computing
X-ORIGINAL-URL:https://www.quantumcomputing.no
X-WR-CALDESC:Events for Gemini Center on Quantum Computing
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Oslo
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20221030T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20220520T130000
DTEND;TZID=Europe/Oslo:20220520T140000
DTSTAMP:20220528T194647
CREATED:20220516T110954Z
LAST-MODIFIED:20220520T101656Z
UID:769-1653051600-1653055200@www.quantumcomputing.no
SUMMARY:Entanglement-assisted quantum communication
DESCRIPTION:Speaker: Paula Belzig\, University of Copenhagen \nTitle: Entanglement-assisted quantum communication \nAbstract: The process of communicating information between two devices\, a sender and a receiver\, is modelled by a noisy channel which maps an encoded message to a potentially corrupted output signal. Then\, the capacity of a given channel quantifies the optimal asymptotic rate of sending information over the channel such that the original message can always be recovered. In 1948\, Shannon derived a formula for the classical capacity of a classical channel which links this rate to the mutual information between the input and output probability distributions. Here\, I will introduce these concepts from classical information theory and discuss their extensions to the formalism of quantum theory. A particular focus will be placed on communication in the presence of quantum entanglement between the sender and the receiver\, and on communication under the additional assumption of faulty quantum devices. \nLocation: Niels Henrik Ables hus\, room 819 \nJoin Zoom Meeting: https://uio.zoom.us/j/69600702462
URL:https://www.quantumcomputing.no/event/entanglement-assisted-quantum-communication/
LOCATION:NHA\, Niels Henrik Abels hus\, Moltke Moes vei 35\, Oslo\, 0851\, Norway
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20220502T113000
DTEND;TZID=Europe/Oslo:20220502T120000
DTSTAMP:20220528T194647
CREATED:20220207T082003Z
LAST-MODIFIED:20220502T112823Z
UID:712-1651491000-1651492800@www.quantumcomputing.no
SUMMARY:Zoom-talk: Quantum groups and quantum information theory
DESCRIPTION:Speaker: Sergiy Neshveyev\, University of Oslo \nTitle: Quantum groups and quantum information theory \nAbstract: Quantum groups were invented around 40 years ago\, although in some form they existed since the 1930s. I’ll give a brief history of the subject and of its origins in mathematical physics\, and then discuss some of its recent applications to quantum information theory. \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/quantum-groups-and-quantum-information-theory/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/06/sergeyn.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20220406T100000
DTEND;TZID=Europe/Oslo:20220406T160000
DTSTAMP:20220528T194647
CREATED:20220302T103013Z
LAST-MODIFIED:20220406T183144Z
UID:732-1649239200-1649260800@www.quantumcomputing.no
SUMMARY:Annual Gathering 2022
DESCRIPTION:Annual gathering for all Gemini-center members.
URL:https://www.quantumcomputing.no/event/annual-gathering-2022/
LOCATION:SINTEF\, Forskningsveien 1\, Oslo\, 0373\, Norway
ATTACH;FMTTYPE=image/png:https://www.quantumcomputing.no/wp-content/uploads/2022/03/communication.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20220404T113000
DTEND;TZID=Europe/Oslo:20220404T120000
DTSTAMP:20220528T194647
CREATED:20220222T115933Z
LAST-MODIFIED:20220406T180936Z
UID:728-1649071800-1649073600@www.quantumcomputing.no
SUMMARY:Zoom-talk: Quantum Variational Algorithms: The Good\, the Bad and the Ugly
DESCRIPTION:Speaker: Jakub Mareček\, Czech Technical University in Prague \nTitle: Quantum Variational Algorithms: The Good\, the Bad and the Ugly \nAbstract: There is an increasing interest in quantum algorithms for problems of integer programming and combinatorial optimization. Classical solvers for such problems employ relaxations\, which replace binary variables with continuous ones\, for instance in the form of higher-dimensional matrix-valued problems (semidefinite programming). Under the Unique Games Conjecture\, these relaxations often provide the best performance ratios available classically in polynomial time. Here\, we discuss how to warm-start quantum optimization with an initial state corresponding to the solution of a relaxation of a combinatorial optimization problem and how to analyze properties of the associated quantum algorithms. In particular\, this allows the quantum algorithm to inherit the performance guarantees of the classical algorithm. We illustrate this in the context of portfolio optimization\, where our results indicate that warm-starting the Quantum Approximate Optimization Algorithm (QAOA) is particularly beneficial at low depth. Likewise\, Recursive QAOA for MAXCUT problems shows a systematic increase in the size of the obtained cut for fully connected graphs with random weights\, when Goemans-Williamson randomized rounding is utilized in a warm start. It is straightforward to apply the same ideas to other randomized-rounding schemes and optimization problems. \nThis talk is based on joint work with Daniel Egger and Stefan Woerner at IBM Research. \nJoin Zoom Meeting: https://zoom.us/j/92762737127 \n
URL:https://www.quantumcomputing.no/event/quantum-variational-algorithms-the-good-the-bad-and-the-ugly/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2022/02/ProfilePhoto-e1649057934777.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20220307T113000
DTEND;TZID=Europe/Oslo:20220307T120000
DTSTAMP:20220528T194647
CREATED:20220207T075354Z
LAST-MODIFIED:20220307T122618Z
UID:711-1646652600-1646654400@www.quantumcomputing.no
SUMMARY:Zoom-talk: Synchronization in two-level quantum systems
DESCRIPTION:Speaker: Joakim Bergli\, University of Oslo \nTitle: Synchronization in two-level quantum systems \nAbstract: Recently\, it was shown that dissipative quantum systems with three or more levels are able to synchronize to an external signal. Some researchers have stated that this is not possible for two-level systems\, as those systems lack a stable limit cycle in unperturbed dynamics. We show how a quantum two-level system can be understood as containing a valid limit cycle as the starting point of synchronization and that it can synchronize its dynamics to an external weak signal. This is demonstrated by analytically solving the Lindblad equation of a two-level system coupled to an environment\, determining the steady state. This is a mixed state with contributions from many pure states\, each of which provides a valid limit cycle. We show that this is sufficient to phase lock the dynamics to a weak external signal\, hence clarifying synchronization in two-level systems. \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/synchronization-in-two-level-quantum-systems/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/06/jbergli.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20220202T113000
DTEND;TZID=Europe/Oslo:20220202T120000
DTSTAMP:20220528T194647
CREATED:20211209T134856Z
LAST-MODIFIED:20220202T123341Z
UID:597-1643801400-1643803200@www.quantumcomputing.no
SUMMARY:Zoom-talk: Learning to measure - A new adaptive approach to extract information in quantum algorithms for near-term quantum computers
DESCRIPTION:Speaker: Matteo A. C. Rossi\, postdoctoral researcher in the PICO group at Aalto University and CTO and co-founder of Algorithmiq \nTitle: Learning to measure: A new adaptive approach to extract information in quantum algorithms for near-term quantum computers \nAbstract: Many prominent quantum computing algorithms with applications in fields such as chemistry and materials science require a large number of measurements\, which represents an important roadblock for future real-world use cases. In this talk I present a novel approach to tackle this problem through an adaptive measurement scheme\, introduced in our recent paper PRX Quantum 2\, 040342 (2021). We employ a generalised class of quantum measurements that can be iteratively adapted to minimize the number of times the target quantum state should be prepared and observed. We show its advantage by improving the efficiency of the variational quantum eigensolver in calculating ground-state energies of molecular Hamiltonians with extensive numerical simulations. As the algorithm proceeds\, it reuses previous measurement outcomes to adjust its own settings and increase the accuracy of subsequent runs. We make the most out of every sample by combining all data produced while fine-tuning the measurement into a single\, highly accurate estimate of the energy. Furthermore\, all the measurement data contain complete information about the state: once collected\, they can be reused to calculate any other property of the system without additional costs.\n \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/zoom-talk-learning-to-measure/
ATTACH;FMTTYPE=image/png:https://www.quantumcomputing.no/wp-content/uploads/2022/01/mr.png
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20220124
DTEND;VALUE=DATE:20220125
DTSTAMP:20220528T194647
CREATED:20211203T141903Z
LAST-MODIFIED:20220106T205212Z
UID:582-1642982400-1643068799@www.quantumcomputing.no
SUMMARY:Cancelled: Annual Gathering
DESCRIPTION:Postponed until the covid situation allows physical meetings.
URL:https://www.quantumcomputing.no/event/annual-gathering/
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20211201T113000
DTEND;TZID=Europe/Oslo:20211201T120000
DTSTAMP:20220528T194647
CREATED:20210929T130642Z
LAST-MODIFIED:20211123T101450Z
UID:537-1638358200-1638360000@www.quantumcomputing.no
SUMMARY:Zoom-talk: Applied Quantum Machine Learning Research at Fraunhofer ITW
DESCRIPTION:Speaker: Dr. Raoul Heese\, Fraunhofer Institute for Industrial Mathematics ITWM \nTitle: Applied Quantum Machine Learning Research at Fraunhofer ITW \nAbstract: In this talk\, I will give a brief overview of several research topics on quantum machine learning that are currently being studied at the Fraunhofer Society in Germany. Our work is driven by real-world problems from industrially relevant applications\, with the goal of demonstrating successful quantum computations on NISQ devices. \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/zoom-talk-applied-quantum-machine-learning-research-at-fraunhofer-itw/
ATTACH;FMTTYPE=image/png:https://www.quantumcomputing.no/wp-content/uploads/2021/09/rh.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20211103T113000
DTEND;TZID=Europe/Oslo:20211103T120000
DTSTAMP:20220528T194647
CREATED:20210901T111230Z
LAST-MODIFIED:20220202T120940Z
UID:516-1635939000-1635940800@www.quantumcomputing.no
SUMMARY:Zoom-talk: Multireference quantum chemistry on NISQ devices
DESCRIPTION:Speaker: Simen Kvaal\, Department of Chemistry\, University of Oslo\nTitle: Multireference quantum chemistry on NISQ devices \nAbstract: One of the foremost contenders for useful applications of NISQ devices is quantum chemistry calculations\, i.e.\, solutions of the molecular Schrödinger equation (SE) for a many-electron system. I will outline what quantum chemistry is\, and the traditional approach to the numerical solution of the SE on the quantum computer: the unitary coupled-cluster (UCC) method. I will then outline the multireference problem — perhaps the greatest challenge for traditional quantum chemistry methods. I will outline an idea for its resolution on a quantum computer via a novel MR-UCC formalism. \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/zoom-talk-multireference-quantum-chemistry-on-nisq-devices/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/06/skvaal.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20211006T113000
DTEND;TZID=Europe/Oslo:20211006T120000
DTSTAMP:20220528T194647
CREATED:20210901T110839Z
LAST-MODIFIED:20211008T174322Z
UID:513-1633519800-1633521600@www.quantumcomputing.no
SUMMARY:Zoom-talk: Fault-tolerant Coding for Quantum Communication
DESCRIPTION:Speaker: Alexander Müller-Hermes\, Department of Mathematics\, University of Oslo \nTitle: Fault-tolerant Coding for Quantum Communication \nAbstract: Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error it is usually assumed that these circuits can be implemented using noise-free gates. While this assumption is satisfied for classical machines in many scenarios\, it is not expected to be satisfied in the near term future for quantum machines where decoherence leads to faults in the quantum gates. As a result\, fundamental questions regarding the practical relevance of quantum channel coding remain open. In this talk I will explain how to combine techniques from fault-tolerant quantum computing with techniques from quantum Shannon theory to prove threshold theorems for the classical and quantum capacity: For every quantum channel T and every ε > 0 there exists a threshold p(ε\,T) for the gate error probability below which rates larger than C − ε are fault-tolerantly achievable with vanishing overall communication error\, where C denotes the usual capacity. \nJoint work with Matthias Christandl. The talk is based on: https://arxiv.org/pdf/2009.07161.pdf \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/zoom-talk-fault-tolerant-coding-for-quantum-communication/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/09/amh.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20210901T113000
DTEND;TZID=Europe/Oslo:20210901T120000
DTSTAMP:20220528T194647
CREATED:20210525T085139Z
LAST-MODIFIED:20211008T174259Z
UID:360-1630495800-1630497600@www.quantumcomputing.no
SUMMARY:Zoom-talk: Solid-state spin qubits
DESCRIPTION:Speaker: Jeroen Danon\, Department of Physics\, Faculty of Natural Sciences\, NTNU\nTitle: Solid-state spin qubits \nAbstract: In this talk I will present a (personal) view on the development of the solid-state quantum-dot-based spin qubit over the past two decades. I will discuss the main remaining challenges for creating reliable and scalable spin qubits\, and I will end my talk by highlighting some of the recent work from my group aimed at overcoming these challenges. \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/zoom-talk-solid-state-spin-qubits/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/06/jd-e1641806697381.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20210811T113000
DTEND;TZID=Europe/Oslo:20210811T120000
DTSTAMP:20220528T194647
CREATED:20210623T121935Z
LAST-MODIFIED:20211008T174232Z
UID:468-1628681400-1628683200@www.quantumcomputing.no
SUMMARY:Zoom-talk: Quantum reservoir computing for machine learning
DESCRIPTION:Speaker: Alexander Stasik\, Department of Mathematics and Cybernetics\, SINTEF\nTitle: Quantum reservoir computing for machine learning \nAbstract: Reservoir computing and extreme learning machines are alternative approaches in machine learning. They use a random non-linear system to transform the input and only learn a linear mapping from the system output to the learning targets. This drastically simplifies the learning process\, compared to e.g.\, neural networks\, where the entire non-linear system needs to be learned. In this talk\, I will talk about recent work on quantum reservoir computing. Quantum reservoir computing used random quantum circuits as non-linear systems\, thus does not require fine-tuning of the circuit. It is also suited for NISQ devices and can be used to understand the power of a quantum enhanced feature space. \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/zoom-talk-quantum-reservoir-computing-for-machine-learning/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/06/as.jpeg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20210602T113000
DTEND;TZID=Europe/Oslo:20210602T120000
DTSTAMP:20220528T194647
CREATED:20210421T091157Z
LAST-MODIFIED:20211008T174204Z
UID:243-1622633400-1622635200@www.quantumcomputing.no
SUMMARY:Zoom-talk: Quantum computing applications in quantum chemistry
DESCRIPTION:Speaker: Ida-Marie Høyvik\, Department of Chemistry\, Faculty of Natural Sciences\, NTNU\nTitle: Quantum computing applications in quantum chemistry \nTime: June 2\, 2021 11:30 AM Oslo \nAbstract: The talk will provide an overview of how quantum computing has been used in quantum chemistry with focus on static molecular properties. Further\, I will give a brief introduction to my research in electronic-structure theory\, focusing on topics which could be relevant for implementation on near-term quantum computers. \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/zoom-talk-quantum-computing-applications-in-quantum-chemistry/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/06/imh.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20210505T113000
DTEND;TZID=Europe/Oslo:20210505T120000
DTSTAMP:20220528T194647
CREATED:20210408T130544Z
LAST-MODIFIED:20211008T174125Z
UID:237-1620214200-1620216000@www.quantumcomputing.no
SUMMARY:Zoom-Talk: Automated\, Systematic\, and Optimized Testing of Quantum Programs
DESCRIPTION:Speaker: Shaukat Ali\, Simula Research Lab\nTitle: Automated\, Systematic\, and Optimized Testing of Quantum Programs \nTime: May 5\, 2021 11:30 AM Oslo \nAbstract: Quantum programs implement quantum algorithms solving complex computational problems. Testing such programs is challenging due to the inherent characteristics of Quantum Computing (QC)\, such as the probabilistic nature and computations in superposition. However\, automated and systematic testing is needed to ensure the correct behavior of quantum programs. This talk will present some preliminary works on testing quantum programs. In particular\, this talk will provide an assessment of input and output coverage criteria on testing quantum programs\, the application of genetic algorithms for optimized testing of quantum programs\, and the use of mutation analysis to assess the quality of test cases. Finally\, the talk will also present future research directions in quantum software engineering. \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/zoom-talk-automated-systematic-and-optimized-testing-of-quantum-programs/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/10/sa-e1641806551921.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20210407T113000
DTEND;TZID=Europe/Oslo:20210407T120000
DTSTAMP:20220528T194647
CREATED:20211008T172632Z
LAST-MODIFIED:20211008T172721Z
UID:550-1617795000-1617796800@www.quantumcomputing.no
SUMMARY:Zoom-Talk: Architecting (Quantum) Computer Systems
DESCRIPTION:Speaker: Magnus Jahre\, Norwegian University of Science and Technology\nTitle: Architecting (Quantum) Computer Systems \nTime: Apr 7\, 2021 11:30 AM Oslo \nAbstract: Quantum computers are desirable as they offer exceptional performance on suitable applications but are yet unlikely to match the generality of classical computers. From this perspective\, quantum computing fits into an on-going shift in classical computer research – namely the transition from a one-size-fits-all general-purpose paradigm towards one of widespread specialization where generality is sacrificed to improve efficiency by catering to the characteristics of important application domains. Future computers will hence likely become increasingly heterogeneous. In this talk\, I will explore the technology trends that led to this shift as well as discuss some of the numerous challenges facing heterogeneous computer systems. \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/zoom-talk-architecting-quantum-computer-systems/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/06/mj.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20210303T113000
DTEND;TZID=Europe/Oslo:20210303T120000
DTSTAMP:20220528T194647
CREATED:20211008T171911Z
LAST-MODIFIED:20211008T172156Z
UID:546-1614771000-1614772800@www.quantumcomputing.no
SUMMARY:Zoom-Talk: From Quantum Computing to Quantum Machine Learning
DESCRIPTION:Speaker: Morten Hjorth-Jensen\, Michigan State University and University of Oslo\nTitle: From Quantum Computing to Quantum Machine Learning \nTime: Mar 3\, 2021 11:30 AM Oslo \nAbstract: In this presentation I will give a brief survey of our ongoing and planned activity in quantum computing and how it can mesh with planned activities at the Gemini center and other activities in Norway. The se activities span from traditional many-body methods applied to the design and experimental realization of quantum gates and circuits\, via quantum mechanical many-body methods tailored to existing quantum computers\, to the exciting field of quantum machine learning. \nJoin Zoom Meeting: https://zoom.us/j/92762737127 \n
URL:https://www.quantumcomputing.no/event/zoom-talk-from-quantum-computing-to-quantum-machine-learning/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/06/mhj.jpg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Oslo:20210120T123000
DTEND;TZID=Europe/Oslo:20210120T130000
DTSTAMP:20220528T194647
CREATED:20211008T174023Z
LAST-MODIFIED:20211008T174023Z
UID:553-1611145800-1611147600@www.quantumcomputing.no
SUMMARY:NISQ devices: Error mitigation techniques and combinatorial optimization problems
DESCRIPTION:Speaker: Franz Georg Fuchs\, Research Scientist\, SINTEF\nTitle: NISQ devices: Error mitigation techniques and combinatorial optimization problems \nTime: Jan 20\, 2021 12:30 AM Oslo \nAbstract: This talk has two parts. In the first\, will give an overview of error mitigation techniques and how these can be used to improve expectation values of observables on real quantum devices. In the second part I present how to use a quantum computer to solve the weighted MAX k-CUT problem. The problem consists of finding a k-partition of a given weighted undirected graph G(V\,E) such that the sum of the weights of the crossing edges is maximized. The problem is of particular interest as it has a multitude of practical applications. We present a formulation of the weighted MAX k-CUT suitable for running the quantum approximate optimization algorithm (QAOA) on noisy intermediate scale quantum (NISQ)-devices to get approximate solutions. \nThe talk is based on https://link.springer.com/article/10.1140/epjp/s13360-020-00360-5 and https://link.springer.com/article/10.1007/s42979-020-00437-z. \nJoin Zoom Meeting: https://zoom.us/j/92762737127
URL:https://www.quantumcomputing.no/event/nisq-devices-error-mitigation-techniques-and-combinatorial-optimization-problems/
ATTACH;FMTTYPE=image/jpeg:https://www.quantumcomputing.no/wp-content/uploads/2021/06/fgf-e1641806674195.jpg
END:VEVENT
END:VCALENDAR