Increasing error tolerance in quantum computers with dynamic bias arrangement
暂无分享,去创建一个
[1] F. Grosshans,et al. Linear optical logical Bell state measurements with optimal loss-tolerance threshold , 2023, 2302.07908.
[2] S. Puri,et al. High threshold codes for neutral atom qubits with biased erasure errors , 2023, 2302.03063.
[3] S. Puri,et al. Tailored cluster states with high threshold under biased noise , 2022, npj Quantum Information.
[4] S. Puri,et al. Tailoring fusion-based error correction for high thresholds to biased fusion failures , 2022, 2301.00019.
[5] S. Paesani,et al. Optimising graph codes for measurement-based loss tolerance , 2022, 2212.04834.
[6] Hyunseok Jeong,et al. All-Photonic Architecture for Scalable Quantum Computing with Greenberger-Horne-Zeilinger States , 2021, PRX Quantum.
[7] F. Brandão,et al. Engineering fast bias-preserving gates on stabilized cat qubits , 2021, Physical Review Research.
[8] Gleb Kalachev,et al. Quantum LDPC Codes With Almost Linear Minimum Distance , 2020, IEEE Transactions on Information Theory.
[9] Hyunseok Jeong,et al. Loss-tolerant linear optical quantum computing under nonideal fusions using multiphoton qubits , 2022 .
[10] Naomi H. Nickerson,et al. Switch networks for photonic fusion-based quantum computing , 2021, 2109.13760.
[11] Isaac H. Kim,et al. Interleaving: Modular architectures for fault-tolerant photonic quantum computing , 2021, 2103.08612.
[12] Benjamin J. Brown,et al. The XZZX surface code , 2020, Nature Communications.
[13] Nicolas Delfosse,et al. Almost-linear time decoding algorithm for topological codes , 2017, Quantum.
[14] Mazyar Mirrahimi,et al. Exponential suppression of bit-flips in a qubit encoded in an oscillator , 2019, Nature Physics.
[15] S. Girvin,et al. Bias-preserving gates with stabilized cat qubits , 2019, Science Advances.
[16] S. Girvin,et al. The Kerr-Cat Qubit: Stabilization, Readout, and Gates , 2019, 1907.12131.
[17] Stephen D Bartlett,et al. Ultrahigh Error Threshold for Surface Codes with Biased Noise. , 2017, Physical review letters.
[18] Terry Rudolph,et al. Why I am optimistic about the silicon-photonic route to quantum computing , 2016, 1607.08535.
[19] Sean D Barrett,et al. Fault tolerant quantum computation with very high threshold for loss errors. , 2010, Physical review letters.
[20] Vladimir Kolmogorov,et al. Blossom V: a new implementation of a minimum cost perfect matching algorithm , 2009, Math. Program. Comput..
[21] J. Spencer,et al. Explosive Percolation in Random Networks , 2009, Science.
[22] Gilles Zémor,et al. Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength , 2009, IEEE Transactions on Information Theory.
[23] John Preskill,et al. Fault-tolerant computing with biased-noise superconducting qubits: a case study , 2008, 0806.0383.
[24] John Preskill,et al. Fault-tolerant quantum computation against biased noise , 2007, 0710.1301.
[25] H. Bombin,et al. Topological quantum distillation. , 2006, Physical review letters.
[26] J. Tillich,et al. Constructions and performance of classes of quantum LDPC codes , 2005, quant-ph/0502086.
[27] T. Rudolph,et al. Resource-efficient linear optical quantum computation. , 2004, Physical review letters.
[28] J. Eisert,et al. Multiparty entanglement in graph states , 2003, quant-ph/0307130.
[29] J. Preskill,et al. Topological quantum memory , 2001, quant-ph/0110143.
[30] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.
[31] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[32] Michael J. Fischer,et al. An improved equivalence algorithm , 1964, CACM.