Share This Author
Entanglement increases the error-correcting ability of quantum error-correcting codes
This work shows how to optimize the minimum distance of an entanglement-assisted quantum error-correcting (EAQEC) code, obtained by adding ebits to a regular quantum stabilizer code, over different encoding operators.
On statistically-secure quantum homomorphic encryption
This work provides a limitation for the first question that an ITS quantum FHE necessarily incurs exponential overhead and proposes a QHE scheme for the instantaneous quantum polynomial-time (IQP) circuits.
Duality in Entanglement-Assisted Quantum Error Correction
A table of upper and lower bounds on the minimum distance of any maximal-entanglement EAQEC code with length up to 15 channel qubits is established.
Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
The Singleton bound and Hamming bound are more general than the previous bounds for entanglement-assisted quantum stabilizer codes, and the first linear programming bound is shown to improve the linear programming bounds on the minimum distance of quantum codes of small length.
Entanglement-assisted quantum error-correcting codes with imperfect ebits
It is shown that any (nondegenerate) standard stabilizer code can be transformed into an EAQEC code that can correct errors on the qubits of both sender and receiver, and hence the decoding techniques of standard stabilizers codes can be applied.
Dualities and identities for entanglement-assisted quantum codes
The dual of an entanglement-assisted quantum error-correcting (EAQEC) code is the code resulting from exchanging the original code’s information qubits with its ebits, and an explicit, general quantum shift-register circuit is given that encodes both classes of codes.
QuRE: The Quantum Resource Estimator toolbox
- Martin Suchara, J. Kubiatowicz, Arvin I. Faruque, F. Chong, C. Lai, G. Paz
- PhysicsIEEE 31st International Conference on Computer…
- 1 October 2013
The tradeoff between concatenated and surface error correction coding techniques is investigated, demonstrating the existence of a crossover point for the Ground State Estimation Algorithm.
On the need for large Quantum depth
The results show that relative to oracles, doubling the quantum circuit depth indeed gives the hybrid model more power, and this cannot be traded by classical computation.
Estimating the Resources for Quantum Computation with the QuRE Toolbox
- Martin Suchara, Arvin I. Faruque, C. Lai, G. Paz, F. Chong, J. Kubiatowicz
- Computer Science, Physics
- 31 May 2013
This work, which provides these resource estimates for a cross product of seven quantum algorithms, six physical machine descriptions, several quantum control protocols, and four error-correcting codes, represents the most comprehensive resource estimation effort in the field of quantum computation to date.
Performance and error analysis of Knill's postselection scheme in a two-dimensional architecture
This work shows how to use Knill's postselection scheme in a practical two-dimensional quantum architecture that was designed with the goal to optimize the error correction properties, while satisfying important architectural constraints.