相关论文: Quantum Hardcore Functions by Complexity-Theoretic…
We explore the possibility of accelerating the formal verification of classical programs with a quantum computer. A common source of security flaws stems from the existence of common programming errors like use after free, null-pointer…
Shor's quantum factoring algorithm and a few other efficient quantum algorithms break many classical crypto-systems. In response, people proposed post-quantum cryptography based on computational problems that are believed hard even for…
Shor's factoring algorithm (SFA), by its ability to efficiently factor large numbers, has the potential to undermine contemporary encryption. At its heart is a process called order finding, which quantum mechanics lets us perform…
A Quantum Computer is a new type of computer which can solve problems such as factoring and database search very efficiently. The usefulness of a quantum computer is limited by the effect of two different types of errors, decoherence and…
The Quantum Computer Condition (QCC) provides a rigorous and completely general framework for carrying out analyses of questions pertaining to fault-tolerance in quantum computers. In this paper we apply the QCC to the problem of…
We outline a quantum convolutional coding technique for protecting a stream of classical bits and qubits. Our goal is to provide a framework for designing codes that approach the ``grandfather'' capacity of an entanglement-assisted quantum…
Quantum computers are becoming more mainstream. As more programmers are starting to look at writing quantum programs, they need to test and debug their code. In this paper, we discuss various use-cases for quantum computers, either…
Quantum Error Correction (QEC) is an essential field of research towards the realization of large-scale quantum computers. On the theoretical side, a lot of effort is put into designing error-correcting codes that protect quantum data from…
Recent work of Bravyi et al. and follow-up work by Bene Watts et al. demonstrates a quantum advantage for shallow circuits: constant-depth quantum circuits can perform a task which constant-depth classical (i.e., AC$^0$) circuits cannot.…
We present two algorithms, one quantum and one classical, for estimating partition functions of quantum spin Hamiltonians. The former is a DQC1 (Deterministic quantum computation with one clean qubit) algorithm, and the first such for…
Due to recent technological advances, actual quantum devices are being constructed and used to perform computations. As a result, many classical problems are being restated so as to be solved on quantum computers. Some examples include…
Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…
Quantum Error-Correcting Codes (QECCs) play a crucial role in enhancing the robustness of quantum computing and communication systems against errors. Within the realm of QECCs, stabilizer codes, and specifically graph codes, stand out for…
Quantum error correction promises a viable path to fault-tolerant computations, enabling exponential error suppression when the device's error rates remain below the protocol's threshold. This threshold, however, strongly depends on the…
A significant obstacle for practical quantum computation is the loss of physical qubits in quantum computers, a decoherence mechanism most notably in optical systems. Here we experimentally demonstrate, both in the quantum circuit model and…
We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…
We consider a version of the nearest-codeword problem on finite fields $\mathbb{F}_q$ using the Manhattan distance, an analog of the Hamming metric for non-binary alphabets. Similarly to other lattice related problems, this problem is…
Quantum error correction protocols will play a central role in the realisation of quantum computing; the choice of error correction code will influence the full quantum computing stack, from the layout of qubits at the physical level to…
A quantum error correcting code is a subspace $\mathcal{C}$ such that allowed errors acting on any state in $\mathcal{C}$ can be corrected. A quantum code for which state recovery is only required up to a logical rotation within…