Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

QC Paulinesia

Robert R. Tucci

Published Jul 27, 2004• 11 citations
OpenAlex

Abstract

My goal in producing this document was to create a collection of qubit circuit identities that are used in Quantum Computing. Mathematicians and Physicists may consider it as being analogous to a Table of Integrals or a Mathematical Handbook such as Gradshteyn-Ryzhik or Abramowitz-Stegun. Computer Programmers may think of it as a scrapbook of code snippets that are elegant, instructive, well documented, and useful. Electronics experts may view it as a compendium of circuits for performing a large assortment of tasks. The vast majority of the circuit identities collected in this work were not discovered for the first time by me, and I take no credit for discovering them. In producing this document, I am acting as a collector, not as a discoverer.

Related papers

QC Paulinesia

Robert R. Tucci

My goal in producing this document was to create a collection of qubit circuit identities that are used in Quantum Computing. Mathematicians and Physicists may consider it as being analogous to a Table of Integrals or a Mathematical Handbook such as Gradshteyn-Ryzhik or Abramowitz-Stegun. Computer Programmers may think of it as a scrapbook of code snippets that are elegant, instructive, well documented, and useful. Electronics experts may view it as a compendium of circuits for performing a large assortment of tasks. The vast majority of the circuit identities collected in this work were not discovered for the first time by me, and I take no credit for discovering them. In producing this document, I am acting as a collector, not as a discoverer.

arXiv:quant-ph/0407215•Jul 27, 2004•0 citations

Coherent Optical Spectroscopy of a Single Semiconductor Quantum Dot.

Xiaodong Xu

6 years ago when I joined the group, Elaine gave me a lab tour. I saw Jun and Yanwen sitting in the dark and taking data. At that time there was a big chiller in the time domain lab and making huge noise. Frankly, I was a bit scared since I had never been in a real lab before graduate school. I was wondering whether I could do well in such a lab as an experimental physicist. Now it is 6 years later and I am so happy to say that I made it. During the entire graduate school, there are so many people I would like to thank. The first and the most important person I would like to thank is my advisor Professor Duncan Steel. I am so lucky to have Duncan as my advisor. He is such a smart scientist with great personality. His working ethics and conscientious attitudes inspired me a lot in research. He always tries to create the best education and research support for me. One of the greatest things is that he tried to develop my weakness, exploit my strength, and carefully shape me to be a good physicist. Duncan is also an advisor with a great sense of humor and it is so much fun to work with him. I would like to thank Professor Paul Berman. His lectures of quantum optics is

•Jan 1, 2008•3 citations

A Pedagogical Suggestion on Quantum Computer Circuits

Helio V. Fagundes

•Oct 25, 2012•0 citations

Ask me anything

Scott Aaronson

To remind you, this book is based on a course I taught in 2006. On the last day of class, I followed the great tradition pioneered by Richard Feynman, in which the last class should be one where you can ask the teacher anything. Feynman's rule was that you could ask about anything except politics, religion, or the final exam. In my case, there was no final exam, and I didn't even make politics or religion off-limits. This chapter collects some of the questions people asked me, together with my responses. Student: Do you often think about using computer science to limit or give us a hint about physical theories? Do you think that we'll be able to discover physical theories which give more powerful models than quantum computation? Scott: Is BQP the end of the road, or is there more to be found? That's a fantastic question, and I wish more people would think about it. I’m being a bit of a politician here and not answering directly, because obviously the answer is “I don't know.” I guess the whole idea with science is that if we don't know the answer, we don't try to sprout one out of our butt or something. We try to base our answers on something. So, everything we know is consistent with the idea that quantum computing is the end of the road. Greg Kuperberg had an analogy I really liked. He said that there are people who keep saying that we've gone from classical to quantum mechanics so what other surprises are in store? But maybe that's like first assuming the Earth is flat, and then on discovering that it's round, saying who knows, maybe it has the topology of a Klein bottle. There's a surprise in a given direction, but once you've assimilated it, there may not be any further surprise in that same direction.

Cambridge University Press eBooks•Mar 14, 2013•5 citations

An efficient quantum circuit analyser on qubits and qudits

T. Loke, Jingbo B. Wang

arXiv:1201.3538•Computer Physics Communications•Jun 25, 2011•6 citations

Construction of QC-LDPC Codes with Low Error Floor by Efficient Systematic Search and Elimination of Trapping Sets

Bashirreza Karimi

In this thesis, we propose a systematic design of binary protograph-based quasi-cyclic (QC) low-density parity-check (LDPC) codes with low error floor.We first characterize the trapping sets of such codes and demonstrate, using edge coloring techniques, that the QC structure of the code eliminates some of the trapping set structures that can exist in a code with the same degree distribution and girth but lacking the QC structure.Based on this characterization, our design aims at eliminating a targeted collection of trapping sets.Considering the parent/child relationship between the structures of the collection, we search for and eliminate those trapping sets that are in the collection but are not a child of any other trapping set in the collection.An efficient layered algorithm is designed for the search of these targeted trapping sets.Compared to the existing codes in the literature, the designed codes are superior in the sense that they are free of the same collection of trapping sets while having a smaller block length, or a larger collection of trapping sets while having the same block length.In addition, the efficiency of the search algorithm makes it possible to design codes with larger degrees which are free of trapping sets within larger ranges compared to the state-of-the-art.Moreover, we design finite-length binary irregular protograph-based QC-LDPC codes with good waterfall performance and low error floor.To achieve a low error floor, we eliminate a targeted set of dominant elementary trapping sets (ETS) L in the Tanner graph of the code.This is a more challenging task since the variety of problematic structures is much larger than that of regular codes.For a given rate and girth, the codes are designed to be free of the largest set of problematic ETSs for a given block length, or to have the shortest block length while a given set of ETSs is avoided.The design is based on a search algorithm that identifies whether any instance of any structure within L exists in the Tanner graph of the constructed code or not.The search algorithm performs this task with minimal complexity, making it feasible to construct practical codes by running the search algorithm a large numberiiiFirst, I would like to thank my supervisor, Professor Amir H. Banihashemi for leading and encouraging me during my research.His guidance helped me in all the time of research and writing of this thesis.Thanks must also go to my committee members for their helpful suggestions and discussions.I can not express my appreciation to my wonderful wife, Arefeh who devoted her never ending love to me and was my partner towards success.I also appreciate the love and support of my family,

•Jan 1, 2021•2 citations
My goal in producing this document was to create a collection of qubit circuit identities that are used in Quantum Computing. Mathematicians and Physicists may consider it as being analogous to a Table of Integrals or a Mathematical Handbook such as Gradshteyn-Ryzhik or Abramowitz-Stegun. Computer Programmers may think of it as a scrapbook of code snippets that are elegant, instructive, well documented, and useful. Electronics experts may view it as a compendium of circuits for performing a large assortment of tasks. The vast majority of the circuit identities collected in this work were not discovered for the first time by me, and I take no credit for discovering them. In producing this document, I am acting as a collector, not as a discoverer.
My goal in producing this document was to create a collection of qubit circuit identities that are used in Quantum Computing. Mathematicians and Physicists may consider it as being analogous to a Table of Integrals or a Mathematical Handbook such as Gradshteyn-Ryzhik or Abramowitz-Stegun. Computer Programmers may think of it as a scrapbook of code snippets that are elegant, instructive, well documented, and useful. Electronics experts may view it as a compendium of circuits for performing a large assortment of tasks. The vast majority of the circuit identities collected in this work were not discovered for the first time by me, and I take no credit for discovering them. In producing this document, I am acting as a collector, not as a discoverer.
6 years ago when I joined the group, Elaine gave me a lab tour. I saw Jun and Yanwen sitting in the dark and taking data. At that time there was a big chiller in the time domain lab and making huge noise. Frankly, I was a bit scared since I had never been in a real lab before graduate school. I was wondering whether I could do well in such a lab as an experimental physicist. Now it is 6 years later and I am so happy to say that I made it. During the entire graduate school, there are so many people I would like to thank. The first and the most important person I would like to thank is my advisor Professor Duncan Steel. I am so lucky to have Duncan as my advisor. He is such a smart scientist with great personality. His working ethics and conscientious attitudes inspired me a lot in research. He always tries to create the best education and research support for me. One of the greatest things is that he tried to develop my weakness, exploit my strength, and carefully shape me to be a good physicist. Duncan is also an advisor with a great sense of humor and it is so much fun to work with him. I would like to thank Professor Paul Berman. His lectures of quantum optics is
To remind you, this book is based on a course I taught in 2006. On the last day of class, I followed the great tradition pioneered by Richard Feynman, in which the last class should be one where you can ask the teacher anything. Feynman's rule was that you could ask about anything except politics, religion, or the final exam. In my case, there was no final exam, and I didn't even make politics or religion off-limits. This chapter collects some of the questions people asked me, together with my responses. Student: Do you often think about using computer science to limit or give us a hint about physical theories? Do you think that we'll be able to discover physical theories which give more powerful models than quantum computation? Scott: Is BQP the end of the road, or is there more to be found? That's a fantastic question, and I wish more people would think about it. I’m being a bit of a politician here and not answering directly, because obviously the answer is “I don't know.” I guess the whole idea with science is that if we don't know the answer, we don't try to sprout one out of our butt or something. We try to base our answers on something. So, everything we know is consistent with the idea that quantum computing is the end of the road. Greg Kuperberg had an analogy I really liked. He said that there are people who keep saying that we've gone from classical to quantum mechanics so what other surprises are in store? But maybe that's like first assuming the Earth is flat, and then on discovering that it's round, saying who knows, maybe it has the topology of a Klein bottle. There's a surprise in a given direction, but once you've assimilated it, there may not be any further surprise in that same direction.
In this thesis, we propose a systematic design of binary protograph-based quasi-cyclic (QC) low-density parity-check (LDPC) codes with low error floor.We first characterize the trapping sets of such codes and demonstrate, using edge coloring techniques, that the QC structure of the code eliminates some of the trapping set structures that can exist in a code with the same degree distribution and girth but lacking the QC structure.Based on this characterization, our design aims at eliminating a targeted collection of trapping sets.Considering the parent/child relationship between the structures of the collection, we search for and eliminate those trapping sets that are in the collection but are not a child of any other trapping set in the collection.An efficient layered algorithm is designed for the search of these targeted trapping sets.Compared to the existing codes in the literature, the designed codes are superior in the sense that they are free of the same collection of trapping sets while having a smaller block length, or a larger collection of trapping sets while having the same block length.In addition, the efficiency of the search algorithm makes it possible to design codes with larger degrees which are free of trapping sets within larger ranges compared to the state-of-the-art.Moreover, we design finite-length binary irregular protograph-based QC-LDPC codes with good waterfall performance and low error floor.To achieve a low error floor, we eliminate a targeted set of dominant elementary trapping sets (ETS) L in the Tanner graph of the code.This is a more challenging task since the variety of problematic structures is much larger than that of regular codes.For a given rate and girth, the codes are designed to be free of the largest set of problematic ETSs for a given block length, or to have the shortest block length while a given set of ETSs is avoided.The design is based on a search algorithm that identifies whether any instance of any structure within L exists in the Tanner graph of the constructed code or not.The search algorithm performs this task with minimal complexity, making it feasible to construct practical codes by running the search algorithm a large numberiiiFirst, I would like to thank my supervisor, Professor Amir H. Banihashemi for leading and encouraging me during my research.His guidance helped me in all the time of research and writing of this thesis.Thanks must also go to my committee members for their helpful suggestions and discussions.I can not express my appreciation to my wonderful wife, Arefeh who devoted her never ending love to me and was my partner towards success.I also appreciate the love and support of my family,