ORCID Profile
0000-0002-5901-1391
Current Organisation
University of Technology Sydney
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Quantum Physics | Quantum Information, Computation and Communication |
Expanding Knowledge in the Physical Sciences | Expanding Knowledge in Engineering | Expanding Knowledge in Technology
Publisher: American Physical Society (APS)
Date: 13-11-2019
Publisher: IEEE
Date: 08-2011
Publisher: IEEE
Date: 02-2008
Publisher: OSA
Date: 2014
Publisher: Association for Computing Machinery (ACM)
Date: 20-09-2016
DOI: 10.1145/2983545
Abstract: Programming a quantum computer is a task as baffling as quantum mechanics itself. But it now looks like a simple 3-D puzzle may hold the solution.
Publisher: IEEE
Date: 03-2008
Publisher: American Physical Society (APS)
Date: 24-10-2016
Publisher: IOP Publishing
Date: 08-11-2006
Publisher: Springer Science and Business Media LLC
Date: 08-2007
Publisher: Springer Science and Business Media LLC
Date: 05-06-2013
DOI: 10.1038/SREP01939
Publisher: Springer Science and Business Media LLC
Date: 11-09-2017
DOI: 10.1038/S41534-017-0035-1
Abstract: The traditional method for computation in either the surface code or in the Raussendorf model is the creation of holes or “defects” within the encoded lattice of qubits that are manipulated via topological braiding to enact logic gates. However, this is not the only way to achieve universal, fault-tolerant computation. In this work, we focus on the lattice surgery representation, which realizes transversal logic operations without destroying the intrinsic 2D nearest-neighbor properties of the braid-based surface code and achieves universality without defects and braid-based logic. For both techniques there are open questions regarding the compilation and resource optimization of quantum circuits. Optimization in braid-based logic is proving to be difficult and the classical complexity associated with this problem has yet to be determined. In the context of lattice-surgery-based logic, we can introduce an optimality condition, which corresponds to a circuit with the lowest resource requirements in terms of physical qubits and computational time, and prove that the complexity of optimizing a quantum circuit in the lattice surgery model is NP-hard.
Publisher: American Physical Society (APS)
Date: 26-04-2016
Publisher: SPIE
Date: 26-09-2013
DOI: 10.1117/12.2023814
Publisher: OSA
Date: 2014
Publisher: IOP Publishing
Date: 20-06-2013
DOI: 10.1088/0034-4885/76/7/076001
Abstract: Quantum error correction (QEC) and fault-tolerant quantum computation represent one of the most vital theoretical aspects of quantum information processing. It was well known from the early developments of this exciting field that the fragility of coherent quantum systems would be a catastrophic obstacle to the development of large-scale quantum computers. The introduction of quantum error correction in 1995 showed that active techniques could be employed to mitigate this fatal problem. However, quantum error correction and fault-tolerant computation is now a much larger field and many new codes, techniques, and methodologies have been developed to implement error correction for large-scale quantum algorithms. In response, we have attempted to summarize the basic aspects of quantum error correction and fault-tolerance, not as a detailed guide, but rather as a basic introduction. The development in this area has been so pronounced that many in the field of quantum information, specifically researchers who are new to quantum information or people focused on the many other important issues in quantum computation, have found it difficult to keep up with the general formalisms and methodologies employed in this area. Rather than introducing these concepts from a rigorous mathematical and computer science framework, we instead examine error correction and fault-tolerance largely through detailed ex les, which are more relevant to experimentalists today and in the near future.
Publisher: Cambridge University Press
Date: 30-09-2021
Publisher: AIP Publishing
Date: 28-01-2021
DOI: 10.1063/5.0029735
Abstract: In this Tutorial, we introduce basic conceptual elements to understand and build a gate-based superconducting quantum computing system.
Publisher: SPIE
Date: 23-02-2005
DOI: 10.1117/12.583421
Publisher: IOP Publishing
Date: 23-02-2017
Publisher: IOP Publishing
Date: 12-2012
DOI: 10.1088/1367-2630/14/12/123011
Abstract: In recent years, surface codes have become a leading method for quantum error correction in theoretical large-scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural two-dimensional nearest-neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect-based codes. Planar codes require fewer qubits to implement (for the same strength of error correction), but are restricted to encoding a single qubit of information. Interactions between encoded qubits are achieved via transversal operations, thus destroying the inherent 2DNN nature of the code. In this paper we introduce a new technique enabling the coupling of two planar codes without transversal operations, maintaining the 2DNN of the encoded computer. Our lattice surgery technique comprises splitting and merging planar code surfaces, and enables us to perform universal quantum computation (including magic state injection) while removing the need for braided logic in a strictly 2DNN design, and hence reduces the overall qubit resources for logic operations. Those resources are further reduced by the use of a rotated lattice for the planar encoding. We show how lattice surgery allows us to distribute encoded GHZ states in a more direct (and overhead friendly) manner, and how a demonstration of an encoded CNOT between two distance-3 logical states is possible with 53 physical qubits, half of that required in any other known construction in 2D.
Publisher: IOP Publishing
Date: 03-2008
Publisher: Springer Science and Business Media LLC
Date: 03-10-2013
DOI: 10.1038/NCOMMS3524
Abstract: Quantum information processing and its associated technologies have reached a pivotal stage in their development, with many experiments having established the basic building blocks. Moving forward, the challenge is to scale up to larger machines capable of performing computational tasks not possible today. This raises questions that need to be urgently addressed, such as what resources these machines will consume and how large will they be. Here we estimate the resources required to execute Shor's factoring algorithm on an atom-optics quantum computer architecture. We determine the runtime and size of the computer as a function of the problem size and physical error rate. Our results suggest that once the physical error rate is low enough to allow quantum error correction, optimization to reduce resources and increase performance will come mostly from integrating algorithms and circuits within the error correction environment, rather than from improving the physical hardware.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2019
Publisher: Springer International Publishing
Date: 2015
Publisher: American Physical Society (APS)
Date: 10-07-2023
Publisher: The Royal Society
Date: 26-06-2017
Abstract: Quantum information systems are expected to exhibit superiority compared with their classical counterparts. This superiority arises from the quantum coherences present in these quantum systems, which are obviously absent in classical ones. To exploit such quantum coherences, it is essential to control the phase information in the quantum state. The phase is analogue in nature, rather than binary. This makes quantum information technology fundamentally different from our classical digital information technology. In this paper, we analyse error sources and illustrate how these errors must be managed for the system to achieve the required fidelity and a quantum superiority. This article is part of the themed issue ‘Quantum technology for the 21st century’.
Publisher: American Physical Society (APS)
Date: 16-03-2006
Publisher: IEEE
Date: 08-11-2021
Publisher: Elsevier BV
Date: 2018
Publisher: IOP Publishing
Date: 06-06-2018
Publisher: OSA
Date: 2012
Publisher: SPIE
Date: 23-02-2005
DOI: 10.1117/12.583191
Publisher: Springer Science and Business Media LLC
Date: 02-08-2016
DOI: 10.1038/SREP30600
Abstract: Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step towards this goal, focusing on generating correct and simple arrangements of topological structures that correspond to a given quantum circuit and largely neglecting their efficiency. We detail the many challenges that will need to be tackled in the pursuit of efficiency. The software source code can be consulted at lexandrupaler/tqec .
Publisher: ACM
Date: 07-06-2015
Publisher: IOP Publishing
Date: 29-10-2007
Publisher: American Physical Society (APS)
Date: 29-09-2016
Publisher: American Physical Society (APS)
Date: 15-05-2014
Publisher: Springer Science and Business Media LLC
Date: 11-04-2014
DOI: 10.1038/SREP04657
Abstract: Topological quantum computation is a promising technique to achieve large-scale, error-corrected computation. Quantum hardware is used to create a large, 3-dimensional lattice of entangled qubits while performing computation requires strategic measurement in accordance with a topological circuit specification. The specification is a geometric structure that defines encoded information and fault-tolerant operations. The compilation of a topological circuit is one important aspect of programming a quantum computer, another is the mapping of the topological circuit into the operations performed by the hardware. Each qubit has to be controlled and measurement results are needed to propagate encoded quantum information from input to output. In this work, we introduce an algorithm for mapping an topological circuit to the operations needed by the physical hardware. We determine the control commands for each qubit in the computer and the relevant measurements that are needed to track information as it moves through the circuit.
Publisher: American Physical Society (APS)
Date: 14-12-2009
Publisher: American Physical Society (APS)
Date: 26-06-2008
Publisher: IOP Publishing
Date: 06-09-2011
Publisher: Springer Science and Business Media LLC
Date: 21-06-2018
DOI: 10.1038/S41534-018-0076-0
Abstract: A recent proposal has shown that it is possible to perform linear-optics quantum computation using a ballistic generation of the lattice. Yet, due to the probabilistic generation of its cluster state, it is not possible to use the fault-tolerant Raussendorf lattice, which requires a lower failure rate during the entanglement-generation process. Previous work in this area showed proof-of-principle linear-optics quantum computation, while this paper presents an approach to it which is more practical, satisfying several key constraints. We develop a classical measurement scheme that purifies a large faulty lattice to a smaller lattice with entanglement faults below threshold. A single application of this method can reduce the entanglement error rate to 7% for an input failure rate of 25%. Thus, we can show that it is possible to achieve fault tolerance for ballistic methods.
Publisher: OSA
Date: 2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2016
DOI: 10.1109/MC.2016.291
Publisher: IEEE
Date: 24-05-2021
Publisher: American Physical Society (APS)
Date: 02-08-2018
Publisher: American Physical Society (APS)
Date: 24-05-2006
Publisher: Springer International Publishing
Date: 2014
Publisher: American Physical Society (APS)
Date: 16-11-2007
Publisher: Springer International Publishing
Date: 2014
Publisher: IEEE
Date: 25-04-2021
Publisher: American Physical Society (APS)
Date: 09-11-2006
Publisher: IEEE
Date: 06-2013
Publisher: National Institute of Informatics (NII)
Date: 03-2011
Publisher: Cambridge University Press (CUP)
Date: 24-10-2023
DOI: 10.1017/QUT.2022.7
Abstract: Quantum computing advantage emerges not from brute force power, but from subtle differences in information processing that can occur for key bottleneck subroutines. In 2019, the Google Quantum AI team performed a landmark experiment demonstrating quantum computational supremacy (Arute et al., 2019) where they performed a quantum computation that, at the time, could not be done on a classical supercomputer. This was remarkable because it was achieved by a processor with only 53 qubits, an observation that emerged from theoretical work which identified that quantum computers could have a massive advantage for certain specially designed benchmarking tasks (Boixo et al., 2018 Bremner et al., 2016).
Publisher: IEEE Conference Publications
Date: 2014
DOI: 10.7873/DATE2014.137
Publisher: American Physical Society (APS)
Date: 17-09-2008
Publisher: Pleiades Publishing Ltd
Date: 02-2010
Publisher: OSA
Date: 2013
Publisher: Springer International Publishing
Date: 2014
Publisher: IEEE
Date: 07-2006
Publisher: World Scientific Pub Co Pte Lt
Date: 02-2010
DOI: 10.1142/S021974991000637X
Abstract: Dedicated research into the design and construction of a large-scale Quantum Information Processing (QIP) system is a complicated task.The design of an experimentally feasible quantum processor must draw upon results in multiple fields from experimental efforts in system control and fabrication through to far more abstract areas such as quantum algorithms and error correction. Recently, the adaptation of topological coding models to physical systems in optics has illustrated a possible long-term pathway to truly large-scale QIP. As the topological model has well-defined protocols for Quantum Error Correction built in as part of its construction, a more grounded analysis of the classical processing requirements is possible. In this paper, we analyze the requirements for a classical processing system, designed specifically for the topological cluster state model. We demonstrate that via extensive parallelization, the construction of a classical "front-end" system capable of processing error correction data for a large topological computer is possible today.
Publisher: American Association for the Advancement of Science (AAAS)
Date: 03-02-2017
Abstract: Design to build a trapped ion quantum computer with modules connected by ion transport and voltage-driven quantum gate technology.
Publisher: Springer Science and Business Media LLC
Date: 14-10-2012
Publisher: SPIE
Date: 08-10-2014
DOI: 10.1117/12.2061182
Publisher: IEEE
Date: 11-2012
DOI: 10.1109/ATS.2012.52
Publisher: Springer Science and Business Media LLC
Date: 29-08-2010
Publisher: ACM
Date: 04-07-2012
Publisher: Springer Japan
Date: 2016
Publisher: American Physical Society (APS)
Date: 26-02-2018
Publisher: SPIE
Date: 08-09-2011
DOI: 10.1117/12.892918
Publisher: IEEE
Date: 06-2013
Publisher: Springer Science and Business Media LLC
Date: 24-05-2016
DOI: 10.1038/SREP26284
Abstract: In this article we present a simple repeater scheme based on the negatively-charged nitrogen vacancy centre in diamond. Each repeater node is built from modules comprising an optical cavity containing a single NV − , with one nuclear spin from 15 N as quantum memory. The module uses only deterministic processes and interactions to achieve high fidelity operations ( %) and modules are connected by optical fiber. In the repeater node architecture, the processes between modules by photons can be in principle deterministic, however current limitations on optical components lead the processes to be probabilistic but heralded. Our resource-modest repeater architecture contains two modules at each node and the repeater nodes are then connected by entangled photon pairs. We discuss the performance of such a quantum repeater network with modest resources and then incorporate more resource-intense strategies step by step. Our architecture should allow large-scale quantum information networks with existing or near future technology.
Publisher: American Physical Society (APS)
Date: 04-08-2014
Publisher: SPIE
Date: 08-09-2011
DOI: 10.1117/12.892883
Publisher: IOP Publishing
Date: 25-01-2017
Publisher: Springer Science and Business Media LLC
Date: 02-11-2016
DOI: 10.1038/SREP36163
Abstract: Networked entanglement is an essential component for a plethora of quantum computation and communication protocols. Direct transmission of quantum signals over long distances is prevented by fibre attenuation and the no-cloning theorem, motivating the development of quantum repeaters, designed to purify entanglement, extending its range. Quantum repeaters have been demonstrated over short distances, but error-corrected, global repeater networks with high bandwidth require new technology. Here we show that error corrected quantum memories installed in cargo containers and carried by ship can provide a exible connection between local networks, enabling low-latency, high-fidelity quantum communication across global distances at higher bandwidths than previously proposed. With demonstrations of technology with sufficient fidelity to enable topological error-correction, implementation of the quantum memories is within reach, and bandwidth increases with improvements in fabrication. Our approach to quantum networking avoids technological restrictions of repeater deployment, providing an alternate path to a worldwide Quantum Internet.
Publisher: IOP Publishing
Date: 12-04-2017
Start Date: 07-2021
End Date: 12-2023
Amount: $699,664.00
Funder: Australian Research Council
View Funded Activity