Jason Gavriel

Jason Gavriel

Auto-generated profile, based on publicly available information

Jason Gavriel

University of Technology Sydney

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 July 2023 in Physical Review Research
Verified
Journal Article
Open access
PDF file
JGJason Gavriel
Jason Gavriel
DHDaniel Herr
Daniel Herr
ASAlexis Shaw
Alexis Shaw
MBMichael J. Bremner
Michael J. Bremner
APAlexandru Paler
Alexandru Paler
SDSimon J. Devitt
Simon J. Devitt
Fault-tolerant, error-corrected quantum computation is commonly acknowledged to be crucial to the realization of large-scale quantum algorithms that could lead to extremely impactful scientific or commercial results. Achieving a universal set of quantum gate operations in a fault-tolerant, error-corrected framework suffers from a conservation of unpleasantness. In general, no matter what error-correction technique is employed, there is always one element of a universal gate set that carries a significant resource overhead—either in physical qubits, computational time, or both. Specifically, this is due to the application of non-Clifford gates. A common method for realizing these gates for stabilizer codes such as the surface code is a combination of three protocols: state injection, distillation, and gate teleportation. These protocols contribute to the resource overhead compared with logical operations such as a CNOT gate and contribute to the qubit resources for any error-corrected quantum algorithm. In this paper, we introduce a very simple protocol to potentially reduce this overhead for non-Clifford gates: transversal injection. Transversal injection modifies the initial physical states of all data qubits in a stabilizer code before standard encoding and results in the direct preparation of a large class of single qubit states, including resource states for non-Clifford logic gates. Preliminary results hint at high-quality fidelities at larger distances and motivate further research on this technique.

27 January 2025 in Physical Review A
Verified
Journal Article
Closed access
SESamuel J. Elman
Samuel J. Elman
JGJason Gavriel
Jason Gavriel
RMRyan L. Mann
Ryan L. Mann

17 September 2023
Verified
Conference Paper
Open access
JGJason Gavriel
Jason Gavriel
DHDaniel Herr
Daniel Herr
ASAlexis Shaw
Alexis Shaw
MBMichael J. Bremner
Michael J. Bremner
APAlexandru Paler
Alexandru Paler
SDSimon J. Devitt
Simon J. Devitt
The development of quantum computing systems for large scale algorithms requires targeted error rates un-achievable through hardware advancements alone. Quantum Error Correction (QEC) allows us to use systems with a large number of physical qubits to form a fault tolerant system with a lower number of logical qubits and a favourable logical error rate. While some gates can be easily implemented in a QEC code transversally, there is no code that has a universal set of transversal gates. Transversal Injection is a new method of preparing logical non-Pauli eigenstates that can be used as resource states for quantum computation. State preparation can be done directly in the surface code and has the potential to prepare higher fidelity injected states. Compared to other techniques, transversal injection can reduce the resource burden for state distillation protocols. In this paper, the authors present the theory behind this new technique as well as an algorithm for calculating the resulting logical states prepared in the surface code

9 December 2022 in arXiv
Verified
Preprint
Open access
PDF file
MVMadhav Krishnan Vijayan
Madhav Krishnan Vijayan
APAlexandru Paler
Alexandru Paler
JGJason Gavriel
Jason Gavriel
CMCasey R. Myers
Casey R. Myers
PRPeter P. Rohde
Peter P. Rohde
SDSimon J. Devitt
Simon J. Devitt
We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages, such as Cirq and Q#. The computation can then be implemented using a series of non-Pauli measurements on this graph state. By compiling the graph state directly instead of starting with a standard lattice cluster state and preparing it over the course of the computation, we are able to better understand the resource costs involved and eliminate wasteful Pauli measurements on the actual quantum device. Access to this algorithm-specific graph state also allows for optimisation over locally equivalent graph states to implement the same quantum circuit. The compiler presented here finds ready application in measurement based quantum computing, NISQ devices and logical level compilation for fault tolereant implementations.