Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Guerreschi, Gian Giacomo"'
Databases are an essential component of modern computing infrastructures and allow efficient access to data stored persistently. Their structure depends on the type and relationships of the stored data elements and on the access pattern. Extending th
Externí odkaz:
http://arxiv.org/abs/2405.14947
Autor:
Schmitz, Albert T., Ibrahim, Mohannad, Sawaya, Nicolas P. D., Guerreschi, Gian Giacomo, Paykin, Jennifer, Wu, Xin-Chuan, Matsuura, A. Y.
The Pauli-based Circuit Optimization, Analysis and Synthesis Toolchain (PCOAST) was recently introduced as a framework for optimizing quantum circuits. It converts a quantum circuit to a Pauli-based graph representation and provides a set of optimiza
Externí odkaz:
http://arxiv.org/abs/2305.09843
Autor:
Khalate, Pradnya, Wu, Xin-Chuan, Premaratne, Shavindra, Hogaboam, Justin, Holmes, Adam, Schmitz, Albert, Guerreschi, Gian Giacomo, Zou, Xiang, Matsuura, A. Y.
Variational algorithms are a representative class of quantum computing workloads that combine quantum and classical computing. This paper presents an LLVM-based C++ compiler toolchain to efficiently execute variational hybrid quantum-classical algori
Externí odkaz:
http://arxiv.org/abs/2202.11142
Quantum Error Correction (QEC) is essential for fault-tolerant quantum copmutation, and its implementation is a very sophisticated process involving both quantum and classical hardware. Formulating and verifying the decomposition of logical operation
Externí odkaz:
http://arxiv.org/abs/2111.13728
In this paper, we formally describe the three challenges of mapping surface code on superconducting devices, and present a comprehensive synthesis framework to overcome these challenges. The proposed framework consists of three optimizations. First,
Externí odkaz:
http://arxiv.org/abs/2111.13729
Autor:
Guerreschi, Gian Giacomo
Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several approximate me
Externí odkaz:
http://arxiv.org/abs/2101.07813
Autor:
Guerreschi, Gian Giacomo
Publikováno v:
Quantum 6, 706 (2022)
Classical simulators play a major role in the development and benchmark of quantum algorithms and practically any software framework for quantum computation provides the option of running the algorithms on simulators. However, the development of quan
Externí odkaz:
http://arxiv.org/abs/2010.09746
Quantum computing is currently moving from an academic idea to a practical reality. Quantum computing in the cloud is already available and allows users from all over the world to develop and execute real quantum algorithms. However, companies which
Externí odkaz:
http://arxiv.org/abs/2007.01000
Publikováno v:
Quantum Sci. Technol. 7, 045014 (2022)
The Quantum Approximate Optimization Algorithm (QAOA) is a hybrid quantum-classical algorithm to solve binary-variable optimization problems. Due to the short circuit depth and its expected robustness to systematic errors, it is one of the promising
Externí odkaz:
http://arxiv.org/abs/2006.04831
Autor:
Kyaw, Thi Ha, Menke, Tim, Sim, Sukin, Anand, Abhinav, Sawaya, Nicolas P. D., Oliver, William D., Guerreschi, Gian Giacomo, Aspuru-Guzik, Alán
Publikováno v:
Phys. Rev. Applied 16, 044042 (2021)
With the increasing size of quantum processors, sub-modules that constitute the processor hardware will become too large to accurately simulate on a classical computer. Therefore, one would soon have to fabricate and test each new design primitive an
Externí odkaz:
http://arxiv.org/abs/2006.03070