Výsledky vyhledávání

Report

Optimizing Multi-level Magic State Factories for Fault-Tolerant Quantum Architectures

Autor: Silva, Allyson, Scherer, Artur, Webb, Zak, Khalid, Abdullah, Kulchytskyy, Bohdan, Kramer, Mia, Nguyen, Kevin, Kong, Xiangzhou, Dagnew, Gebremedhin A., Wang, Yumeng, Nguyen, Huy Anh, Olfert, Katiemarie, Ronagh, Pooya

We propose a novel technique for optimizing a modular fault-tolerant quantum computing architecture, taking into account any desired space-time trade--offs between the number of physical qubits and the fault-tolerant execution time of a quantum algor

Externí odkaz: http://arxiv.org/abs/2411.04270

Zobrazit plný text záznamu

Report

Multi-qubit Lattice Surgery Scheduling

Autor: Silva, Allyson, Zhang, Xiangyi, Webb, Zak, Kramer, Mia, Yang, Chan Woo, Liu, Xiao, Lemieux, Jessica, Chen, Ka-Wai, Scherer, Artur, Ronagh, Pooya

Publikováno v: 19th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2024). LIPIcs, Volume 310, pp. 1:1-1:22, 2024

Fault-tolerant quantum computation using two-dimensional topological quantum error correcting codes can benefit from multi-qubit long-range operations. By using simple commutation rules, a quantum circuit can be transpiled into a sequence of solely n

Externí odkaz: http://arxiv.org/abs/2405.17688

Zobrazit plný text záznamu

Report

The Clifford group forms a unitary 3-design

Autor: Webb, Zak

Publikováno v: Quantum Information and Computation 16, 1379-1400 (2016

Unitary $k$-designs are finite ensembles of unitary matrices that approximate the Haar distribution over unitary matrices. Several ensembles are known to be 2-designs, including the uniform distribution over the Clifford group, but no family of ensem

Externí odkaz: http://arxiv.org/abs/1510.02769

Zobrazit plný text záznamu

Report

Complexity of the XY antiferromagnet at fixed magnetization

Autor: Childs, Andrew M., Gosset, David, Webb, Zak

Publikováno v: Quantum Information and Computation 16, 1-18 (2016)

We prove that approximating the ground energy of the antiferromagnetic XY model on a simple graph at fixed magnetization (given as part of the instance specification) is QMA-complete. To show this, we strengthen a previous result by establishing QMA-

Externí odkaz: http://arxiv.org/abs/1503.07083

Zobrazit plný text záznamu

Report

Momentum switches

Autor: Childs, Andrew M., Gosset, David, Nagaj, Daniel, Raha, Mouktik, Webb, Zak

Publikováno v: Quantum Information and Computation 15, 601-621 (2015)

Certain continuous-time quantum walks can be viewed as scattering processes. These processes can perform quantum computations, but it is challenging to design graphs with desired scattering behavior. In this paper, we study and construct momentum swi

Externí odkaz: http://arxiv.org/abs/1406.4510

Zobrazit plný text záznamu

Report

The Bose-Hubbard model is QMA-complete

Autor: Childs, Andrew M., Gosset, David, Webb, Zak

Publikováno v: Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), pp. 308-319 (2014)

The Bose-Hubbard model is a system of interacting bosons that live on the vertices of a graph. The particles can move between adjacent vertices and experience a repulsive on-site interaction. The Hamiltonian is determined by a choice of graph that sp

Externí odkaz: http://arxiv.org/abs/1311.3297

Zobrazit plný text záznamu

Report

Universal computation by multi-particle quantum walk

Autor: Childs, Andrew M., Gosset, David, Webb, Zak

Publikováno v: Science 339, 791-794 (2013)

A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we consider a

Externí odkaz: http://arxiv.org/abs/1205.3782

Zobrazit plný text záznamu