Current Search:  Department of Computer Science (x)

Search results

  • CSV Spreadsheet
(1 - 2 of 2)
Systematically generated two-qubit anyon braids
Title
Systematically Generated Two-qubit Anyon Braids.
Creator
Carnahan, Caitlin, Zeuch, Daniel, Bonesteel, N. E.
Abstract/Description
Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with off-diagonal matrix elements that can be made arbitrarily small in a particular natural basis through a simple and efficient iterative procedure. This procedure does not require brute force search, the Solovay-Kitaev method, or any other numerical technique, but...
Show moreFibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with off-diagonal matrix elements that can be made arbitrarily small in a particular natural basis through a simple and efficient iterative procedure. This procedure does not require brute force search, the Solovay-Kitaev method, or any other numerical technique, but the phases of the resulting diagonal matrix elements cannot be directly controlled. We show that despite this lack of control the resulting braids can be used to systematically construct entangling gates for two qubits encoded by Fibonacci anyons.
Show less
Date Issued
2016-05-20
Identifier
FSU_libsubv1_wos_000376243800001, 10.1103/PhysRevA.93.052328
Format
Citation
Trueerase
Title
Trueerase: Leveraging An Auxiliary Data Path For Per-file Secure Deletion.
Creator
Diesburg, Sarah, Meyers, Christopher, Stanovich, Mark, Wang, An-I. Andy, Kuenning, Geoff
Abstract/Description
One important aspect of privacy is the ability to securely delete sensitive data from electronic storage in such a way that it cannot be recovered; we call this action secure deletion. Short of physically destroying the entire storage medium, existing software secure-deletion solutions tend to be piecemeal at best - they may only work for one type of storage or file system, may force the user to delete all files instead of selected ones, may require the added complexities of encryption and...
Show moreOne important aspect of privacy is the ability to securely delete sensitive data from electronic storage in such a way that it cannot be recovered; we call this action secure deletion. Short of physically destroying the entire storage medium, existing software secure-deletion solutions tend to be piecemeal at best - they may only work for one type of storage or file system, may force the user to delete all files instead of selected ones, may require the added complexities of encryption and key storage, may require extensive changes and additions to the computer's operating system or storage firmware, and may not handle system crashes gracefully. We present TrueErase, a holistic secure-deletion framework for individual systems that contain sensitive data. Through design, implementation, verification, and evaluation on both a hard drive and NAND flash, TrueErase shows that it is possible to construct a per-file, secure-deletion framework that can accommodate different storage media and legacy file systems, require limited changes to legacy systems, and handle common crash scenarios. TrueErase can serve as a building block by cryptographic systems that securely delete information by erasing encryption keys. The overhead is dependent on spatial locality, number of sensitive files, and workload (computational-or I/O-bound).
Show less
Date Issued
2016-08
Identifier
FSU_libsubv1_wos_000382760500001, 10.1145/2854882
Format
Citation