ORCID Profile
0000-0003-4387-670X
Current Organisation
University of 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 | Theoretical Physics | Quantum Optics And Lasers | Quantum Information, Computation and Communication | Optical And Photonic Systems | Mathematical Aspects of Classical Mechanics, Quantum Mechanics and Quantum Information Theory | Quantum Optics | Electronic and Magnetic Properties of Condensed Matter; Superconductivity | Mathematics Not Elsewhere Classified | Optical Physics | Broadband Network Technology | Mathematical Physics | Condensed Matter Physics | Quantum Chemistry | Communications Technologies | Mathematical Aspects of Quantum and Conformal Field Theory, Quantum Gravity and String Theory | Group Theory And Generalisations (Incl. Topological Groups And Lie | Condensed Matter Modelling and Density Functional Theory | Optics And Opto-Electronic Physics | Speech Recognition
Physical sciences | Expanding Knowledge in the Physical Sciences | Expanding Knowledge in Engineering | Telecommunications | Measurement standards and calibration services not elsewhere classified | Emerging Defence Technologies | Higher education | Network switching equipment | Network transmission equipment | Chemical sciences | Mathematical sciences | Expanding Knowledge in Technology | Communication services not elsewhere classified |
Publisher: American Physical Society (APS)
Date: 23-09-2004
Publisher: American Physical Society (APS)
Date: 10-07-2009
Publisher: American Physical Society (APS)
Date: 17-02-2016
Publisher: American Physical Society (APS)
Date: 20-08-2020
Publisher: IOP Publishing
Date: 09-11-2012
Publisher: American Physical Society (APS)
Date: 11-08-2015
Publisher: American Physical Society (APS)
Date: 14-02-2002
Publisher: American Physical Society (APS)
Date: 23-11-2009
Publisher: American Physical Society (APS)
Date: 15-03-2023
Publisher: American Physical Society (APS)
Date: 03-05-2002
Publisher: American Physical Society (APS)
Date: 19-05-2014
Publisher: American Physical Society (APS)
Date: 04-12-2008
Publisher: IOP Publishing
Date: 17-03-2017
Publisher: American Physical Society (APS)
Date: 24-01-2007
Publisher: American Association for the Advancement of Science (AAAS)
Date: 20-05-2022
Abstract: Vast numbers of qubits will be needed for large-scale quantum computing because of the overheads associated with error correction. We present a scheme for low-overhead fault-tolerant quantum computation based on quantum low-density parity-check (LDPC) codes, where long-range interactions enable many logical qubits to be encoded with a modest number of physical qubits. In our approach, logic gates operate via logical Pauli measurements that preserve both the protection of the LDPC codes and the low overheads in terms of the required number of additional qubits. Compared with surface codes with the same code distance, we estimate order-of-magnitude improvements in the overheads for processing around 100 logical qubits using this approach. Given the high thresholds demonstrated by LDPC codes, our estimates suggest that fault-tolerant quantum computation at this scale may be achievable with a few thousand physical qubits at comparable error rates to what is needed for current approaches.
Publisher: American Physical Society (APS)
Date: 10-08-2015
Publisher: Springer Science and Business Media LLC
Date: 21-12-2010
DOI: 10.1038/NCOMMS1147
Abstract: Quantum state tomography--deducing quantum states from measured data--is the gold standard for verification and benchmarking of quantum devices. It has been realized in systems with few components, but for larger systems it becomes unfeasible because the number of measurements and the amount of computation required to process them grows exponentially in the system size. Here, we present two tomography schemes that scale much more favourably than direct tomography with system size. One of them requires unitary operations on a constant number of subsystems, whereas the other requires only local measurements together with more elaborate post-processing. Both rely only on a linear number of experimental operations and post-processing that is polynomial in the system size. These schemes can be applied to a wide range of quantum states, in particular those that are well approximated by matrix product states. The accuracy of the reconstructed states can be rigorously certified without any a priori assumptions.
Publisher: Canadian Science Publishing
Date: 03-2009
DOI: 10.1139/P08-112
Abstract: In measurement-based quantum computation (MBQC), local adaptive measurements are performed on the quantum state of a lattice of qubits. Quantum gates are associated with a particular measurement sequence, and one way of viewing MBQC is that such a measurement sequence prepares a resource state suitable for “gate teleportation”. We demonstrate how to quantify the performance of quantum gates in MBQC by using correlation functions on the pre-measurement resource state.
Publisher: American Physical Society (APS)
Date: 10-06-2005
Publisher: IOP Publishing
Date: 21-08-2013
Publisher: American Physical Society (APS)
Date: 18-07-2005
Publisher: American Physical Society (APS)
Date: 23-11-2005
Publisher: Springer Science and Business Media LLC
Date: 08-10-2014
DOI: 10.1038/NCOMMS6156
Abstract: Unwanted interaction between a quantum system and its fluctuating environment leads to decoherence and is the primary obstacle to establishing a scalable quantum information processing architecture. Strategies such as environmental and materials engineering, quantum error correction and dynamical decoupling can mitigate decoherence, but generally increase experimental complexity. Here we improve coherence in a qubit using real-time Hamiltonian parameter estimation. Using a rapidly converging Bayesian approach, we precisely measure the splitting in a singlet-triplet spin qubit faster than the surrounding nuclear bath fluctuates. We continuously adjust qubit control parameters based on this information, thereby improving the inhomogenously broadened coherence time "Equation missing" from tens of nanoseconds to μs. Because the technique demonstrated here is compatible with arbitrary qubit operations, it is a natural complement to quantum error correction and can be used to improve the performance of a wide variety of qubits in both meteorological and quantum information processing applications.
Publisher: American Physical Society (APS)
Date: 14-12-2017
Publisher: Springer Science and Business Media LLC
Date: 09-2013
Abstract: Quantum-dot spin qubits characteristically use oscillating magnetic or electric fields, or quasi-static Zeeman field gradients, to realize full qubit control. For the case of three confined electrons, exchange interaction between two pairs allows qubit rotation around two axes, hence full control, using only electrostatic gates. Here, we report initialization, full control, and single-shot readout of a three-electron exchange-driven spin qubit. Control via the exchange interaction is fast, yielding a demonstrated 75 qubit rotations in less than 2 ns. Measurement and state tomography are performed using a maximum-likelihood estimator method, allowing decoherence, leakage out of the qubit state space, and measurement fidelity to be quantified. The methods developed here are generally applicable to systems with state leakage, noisy measurements and non-orthogonal control axes.
Publisher: American Physical Society (APS)
Date: 17-03-2003
Publisher: American Physical Society (APS)
Date: 12-08-2009
Publisher: American Physical Society (APS)
Date: 05-09-2017
Publisher: American Physical Society (APS)
Date: 26-08-2003
Publisher: American Physical Society (APS)
Date: 31-01-2018
Publisher: Springer Science and Business Media LLC
Date: 17-04-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2009
Publisher: American Physical Society (APS)
Date: 04-02-2022
Publisher: American Physical Society (APS)
Date: 24-04-2015
Publisher: American Physical Society (APS)
Date: 20-12-2006
Publisher: American Physical Society (APS)
Date: 06-08-2020
Publisher: IOP Publishing
Date: 09-07-2014
Publisher: American Physical Society (APS)
Date: 25-02-2022
Publisher: American Physical Society (APS)
Date: 10-09-2004
Publisher: American Physical Society (APS)
Date: 07-06-2018
Publisher: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
Date: 13-01-2020
DOI: 10.22331/Q-2020-01-13-223
Abstract: Investigating the classical simulability of quantum circuits provides a promising avenue towards understanding the computational power of quantum systems. Whether a class of quantum circuits can be efficiently simulated with a probabilistic classical computer, or is provably hard to simulate, depends quite critically on the precise notion of ``classical simulation'' and in particular on the required accuracy. We argue that a notion of classical simulation, which we call EPSILON-simulation (or ϵ -simulation for short), captures the essence of possessing ``equivalent computational power'' as the quantum system it simulates: It is statistically impossible to distinguish an agent with access to an ϵ -simulator from one possessing the simulated quantum system. We relate ϵ -simulation to various alternative notions of simulation predominantly focusing on a simulator we call a poly-box . A poly-box outputs 1 / p o l y precision additive estimates of Born probabilities and marginals. This notion of simulation has gained prominence through a number of recent simulability results. Accepting some plausible computational theoretic assumptions, we show that ϵ -simulation is strictly stronger than a poly-box by showing that IQP circuits and unconditioned magic-state injected Clifford circuits are both hard to ϵ -simulate and yet admit a poly-box. In contrast, we also show that these two notions are equivalent under an additional assumption on the sparsity of the output distribution ( poly-sparsity ).
Publisher: Springer Science and Business Media LLC
Date: 05-07-2021
DOI: 10.1038/S41467-021-24371-7
Abstract: A fault-tolerant quantum processor may be configured using stationary qubits interacting only with their nearest neighbours, but at the cost of significant overheads in physical qubits per logical qubit. Such overheads could be reduced by coherently transporting qubits across the chip, allowing connectivity beyond immediate neighbours. Here we demonstrate high-fidelity coherent transport of an electron spin qubit between quantum dots in isotopically-enriched silicon. We observe qubit precession in the inter-site tunnelling regime and assess the impact of qubit transport using Ramsey interferometry and quantum state tomography techniques. We report a polarization transfer fidelity of 99.97% and an average coherent transfer fidelity of 99.4%. Our results provide key elements for high-fidelity, on-chip quantum information distribution, as long envisaged, reinforcing the scaling prospects of silicon-based spin qubits.
Publisher: IOP Publishing
Date: 09-07-2009
Publisher: IOP Publishing
Date: 10-2023
Publisher: American Physical Society (APS)
Date: 26-07-2010
Publisher: American Physical Society (APS)
Date: 21-03-2018
Publisher: Research Square Platform LLC
Date: 23-10-2020
DOI: 10.21203/RS.3.RS-90087/V1
Abstract: We show that a variant of the surface code—the XZZX code—offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel it is the first explicit code shown to have this universal property. We present numerical evidence that the threshold even exceeds this hashing bound for an experimentally relevant range of noise parameters. Focusing on the common situation where qubit dephasing is the dominant noise, we show that this code has a practical, high-performance decoder and surpasses all previously known thresholds in the realistic setting where syndrome measurements are unreliable. We go on to demonstrate the favorable sub-threshold resource scaling that can be obtained by specializing a code to exploit structure in the noise. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation. We finally suggest some small-scale experiments that could exploit noise bias to reduce qubit overhead in two-dimensional architectures
Publisher: IOP Publishing
Date: 19-04-2006
Publisher: American Physical Society (APS)
Date: 24-01-2018
Publisher: IOP Publishing
Date: 10-10-2018
Publisher: American Physical Society (APS)
Date: 12-05-2004
Publisher: American Physical Society (APS)
Date: 26-02-2010
Publisher: American Physical Society (APS)
Date: 19-03-2004
Publisher: Springer Science and Business Media LLC
Date: 12-04-2021
DOI: 10.1038/S41467-021-22274-1
Abstract: Performing large calculations with a quantum computer will likely require a fault-tolerant architecture based on quantum error-correcting codes. The challenge is to design practical quantum error-correcting codes that perform well against realistic noise using modest resources. Here we show that a variant of the surface code—the XZZX code—offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel it is the first explicit code shown to have this universal property. We present numerical evidence that the threshold even exceeds this hashing bound for an experimentally relevant range of noise parameters. Focusing on the common situation where qubit dephasing is the dominant noise, we show that this code has a practical, high-performance decoder and surpasses all previously known thresholds in the realistic setting where syndrome measurements are unreliable. We go on to demonstrate the favourable sub-threshold resource scaling that can be obtained by specialising a code to exploit structure in the noise. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation.
Publisher: American Physical Society (APS)
Date: 18-03-2002
Publisher: American Physical Society (APS)
Date: 30-10-2002
Publisher: American Physical Society (APS)
Date: 30-03-2020
Publisher: Springer Science and Business Media LLC
Date: 13-03-2019
DOI: 10.1038/S41467-019-09194-X
Abstract: Scalable quantum processors require tunable two-qubit gates that are fast, coherent and long-range. The Heisenberg exchange interaction offers fast and coherent couplings for spin qubits, but is intrinsically short-ranged. Here, we demonstrate that its range can be increased by employing a multielectron quantum dot as a mediator, while preserving speed and coherence of the resulting spin-spin coupling. We do this by placing a large quantum dot with 50–100 electrons between a pair of two-electron double quantum dots that can be operated and measured simultaneously. Two-spin correlations identify coherent spin-exchange processes across the multielectron quantum dot. We further show that different physical regimes of the mediated exchange interaction allow a reduced susceptibility to charge noise at sweet spots, as well as positive and negative coupling strengths up to several gigahertz. These properties make multielectron dots attractive as scalable, voltage-controlled coherent coupling elements.
Publisher: American Physical Society (APS)
Date: 23-06-2022
Publisher: American Physical Society (APS)
Date: 03-10-2005
Publisher: American Physical Society (APS)
Date: 17-05-2011
Publisher: American Physical Society (APS)
Date: 15-11-2011
Publisher: American Physical Society (APS)
Date: 31-01-2006
Publisher: Springer Science and Business Media LLC
Date: 27-08-2019
DOI: 10.1038/S41524-019-0224-X
Abstract: Topologically ordered materials may serve as a platform for new quantum technologies, such as fault-tolerant quantum computers. To fulfil this promise, efficient and general methods are needed to discover and classify new topological phases of matter. We demonstrate that deep neural networks augmented with external memory can use the density profiles formed in quantum walks to efficiently identify properties of a topological phase as well as phase transitions. On a trial topological ordered model, our method’s accuracy of topological phase identification reaches 97.4%, and is shown to be robust to noise on the data. Furthermore, we demonstrate that our trained DNN is able to identify topological phases of a perturbed model, and predict the corresponding shift of topological phase transitions without learning any information about the perturbations in advance. These results demonstrate that our approach is generally applicable and may be used to identify a variety of quantum topological materials.
Publisher: American Physical Society (APS)
Date: 10-09-2010
Publisher: IOP Publishing
Date: 28-06-2002
Publisher: IOP Publishing
Date: 28-06-2002
Publisher: American Physical Society (APS)
Date: 06-12-2017
Publisher: IOP Publishing
Date: 14-02-2013
Publisher: American Physical Society (APS)
Date: 21-03-2001
Publisher: American Physical Society (APS)
Date: 15-01-2001
Publisher: Springer Science and Business Media LLC
Date: 03-03-2012
Publisher: American Physical Society (APS)
Date: 10-11-2020
Publisher: American Physical Society (APS)
Date: 26-06-2012
Publisher: Springer Science and Business Media LLC
Date: 15-04-2019
Publisher: Springer Science and Business Media LLC
Date: 15-11-2007
DOI: 10.1038/NATURE06257
Abstract: Measurement underpins all quantitative science. A key ex le is the measurement of optical phase, used in length metrology and many other applications. Advances in precision measurement have consistently led to important scientific discoveries. At the fundamental level, measurement precision is limited by the number N of quantum resources (such as photons) that are used. Standard measurement schemes, using each resource independently, lead to a phase uncertainty that scales as 1/square root N-known as the standard quantum limit. However, it has long been conjectured that it should be possible to achieve a precision limited only by the Heisenberg uncertainty principle, dramatically improving the scaling to 1/N (ref. 3). It is commonly thought that achieving this improvement requires the use of exotic quantum entangled states, such as the NOON state. These states are extremely difficult to generate. Measurement schemes with counted photons or ions have been performed with N < or = 6 (refs 6-15), but few have surpassed the standard quantum limit and none have shown Heisenberg-limited scaling. Here we demonstrate experimentally a Heisenberg-limited phase estimation procedure. We replace entangled input states with multiple applications of the phase shift on unentangled single-photon states. We generalize Kitaev's phase estimation algorithm using adaptive measurement theory to achieve a standard deviation scaling at the Heisenberg limit. For the largest number of resources used (N = 378), we estimate an unknown phase with a variance more than 10 dB below the standard quantum limit achieving this variance would require more than 4,000 resources using standard interferometry. Our results represent a drastic reduction in the complexity of achieving quantum-enhanced measurement precision.
Publisher: American Physical Society (APS)
Date: 03-12-2015
Publisher: American Physical Society (APS)
Date: 21-01-2016
Publisher: IOP Publishing
Date: 14-07-2015
Publisher: IOP Publishing
Date: 20-05-2011
Publisher: American Physical Society (APS)
Date: 07-07-2003
Publisher: IOP Publishing
Date: 13-01-2012
Publisher: American Physical Society (APS)
Date: 03-02-2006
Publisher: AIP Publishing
Date: 03-2008
DOI: 10.1063/1.2884583
Abstract: We give a convenient representation for any map that is covariant with respect to an irreducible representation of SU(2), and use this representation to analyze the evolution of a quantum directional reference frame when it is exploited as a resource for performing quantum operations. We introduce the moments of a quantum reference frame, which serve as a complete description of its properties as a frame, and investigate how many times a quantum directional reference frame represented by a spin-j system can be used to perform a certain quantum operation with a given probability of success. We provide a considerable generalization of previous results on the degradation of a reference frame, from which follows a classification of the dynamics of spin-j system under the repeated action of any covariant map with respect to SU(2).
Publisher: American Physical Society (APS)
Date: 30-12-2004
Publisher: Springer Science and Business Media LLC
Date: 17-10-2010
DOI: 10.1038/NPHYS1777
Publisher: American Physical Society (APS)
Date: 07-08-2017
Publisher: IOP Publishing
Date: 14-05-2015
Publisher: American Physical Society (APS)
Date: 06-02-2012
Publisher: American Physical Society (APS)
Date: 15-08-2013
Publisher: Springer Science and Business Media LLC
Date: 14-11-2022
Publisher: American Physical Society (APS)
Date: 26-07-2004
Publisher: No publisher found
Date: 2002
Publisher: IOP Publishing
Date: 29-12-2018
Publisher: American Physical Society (APS)
Date: 29-10-2002
Publisher: IOP Publishing
Date: 29-01-2003
Publisher: IOP Publishing
Date: 2023
Abstract: For certain restricted computational tasks, quantum mechanics provides a provable advantage over any possible classical implementation. Several of these results have been proven using the framework of measurement-based quantum computation (MBQC), where nonlocality and more generally contextuality have been identified as necessary resources for certain quantum computations. Here, we consider the computational power of MBQC in more detail by refining its resource requirements, both on the allowed operations and the number of accessible qubits. More precisely, we identify which Boolean functions can be computed in non-adaptive MBQC, with local operations contained within a finite level in the Clifford hierarchy. Moreover, for non-adaptive MBQC restricted to certain subtheories such as stabiliser MBQC, we compute the minimal number of qubits required to compute a given Boolean function. Our results point towards hierarchies of resources that more sharply characterise the power of MBQC beyond the binary of contextuality vs non-contextuality.
Publisher: American Physical Society (APS)
Date: 15-06-2012
Publisher: Springer Science and Business Media LLC
Date: 06-05-2021
DOI: 10.1038/S41534-021-00403-4
Abstract: Electron spins in semiconductor quantum dots have been intensively studied for implementing quantum computation and high-fidelity single- and two-qubit operations have recently been achieved. Quantum teleportation is a three-qubit protocol exploiting quantum entanglement and it serves as an essential primitive for more sophisticated quantum algorithms. Here we demonstrate a scheme for quantum teleportation based on direct Bell measurement for a single-electron spin qubit in a triple quantum dot utilizing the Pauli exclusion principle to create and detect maximally entangled states. The single spin polarization is teleported from the input qubit to the output qubit. We find this fidelity is primarily limited by singlet–triplet mixing, which can be improved by optimizing the device parameters. Our results may be extended to quantum algorithms with a larger number of semiconductor spin qubits.
Publisher: American Physical Society (APS)
Date: 29-10-2015
Publisher: American Physical Society (APS)
Date: 23-08-2013
Publisher: Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften
Date: 22-09-2022
DOI: 10.22331/Q-2022-09-22-815
Abstract: We propose an extension to the Pauli stabiliser formalism that includes fractional 2 & #x03C0 / N rotations around the Z axis for some integer N . The resulting generalised stabiliser formalism – denoted the XP stabiliser formalism – allows for a wider range of states and codespaces to be represented. We describe the states which arise in the formalism, and demonstrate an equivalence between XP stabiliser states and 'weighted hypergraph states' – a generalisation of both hypergraph and weighted graph states. Given an arbitrary set of XP operators, we present algorithms for determining the codespace and logical operators for an XP code. Finally, we consider whether measurements of XP operators on XP codes can be classically simulated.
Publisher: American Physical Society (APS)
Date: 28-02-2011
Publisher: Springer Science and Business Media LLC
Date: 15-08-2022
DOI: 10.1038/S41467-022-32236-W
Abstract: Coupling qubits to a superconducting resonator provides a mechanism to enable long-distance entangling operations in a quantum computer based on spins in semiconducting materials. Here, we demonstrate a controllable spin-photon coupling based on a longitudinal interaction between a spin qubit and a resonator. We show that coupling a singlet-triplet qubit to a high-impedance superconducting resonator can produce the desired longitudinal coupling when the qubit is driven near the resonator’s frequency. We measure the energy splitting of the qubit as a function of the drive litude and frequency of a microwave signal applied near the resonator antinode, revealing pronounced effects close to the resonator frequency due to longitudinal coupling. By tuning the litude of the drive, we reach a regime with longitudinal coupling exceeding 1 MHz. This mechanism for qubit-resonator coupling represents a stepping stone towards producing high-fidelity two-qubit gates mediated by a superconducting resonator.
Publisher: American Physical Society (APS)
Date: 12-11-2019
Publisher: Elsevier BV
Date: 2000
Publisher: American Physical Society (APS)
Date: 09-04-2018
Publisher: American Physical Society (APS)
Date: 04-01-2005
Publisher: IOP Publishing
Date: 22-12-2014
Publisher: American Physical Society (APS)
Date: 26-11-2013
Publisher: American Physical Society (APS)
Date: 27-12-2022
Publisher: American Physical Society (APS)
Date: 24-11-2009
Publisher: American Physical Society (APS)
Date: 28-02-2003
Publisher: American Physical Society (APS)
Date: 25-07-2023
Publisher: American Physical Society (APS)
Date: 09-2016
Publisher: American Physical Society (APS)
Date: 24-10-2003
Publisher: American Physical Society (APS)
Date: 04-04-2003
Start Date: 2003
End Date: 2003
Funder: Australian Research Council
View Funded ActivityStart Date: 2005
End Date: 2007
Funder: Australian Research Council
View Funded ActivityStart Date: 2011
End Date: 2017
Funder: Australian Research Council
View Funded ActivityStart Date: 2013
End Date: 2015
Funder: Australian Research Council
View Funded ActivityStart Date: 2005
End Date: 2007
Funder: Australian Research Council
View Funded ActivityStart Date: 2009
End Date: 2011
Funder: Australian Research Council
View Funded ActivityStart Date: 2004
End Date: 2009
Funder: Australian Research Council
View Funded ActivityStart Date: 2003
End Date: 2003
Funder: Australian Research Council
View Funded ActivityStart Date: 09-2003
End Date: 01-2004
Amount: $208,035.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2013
End Date: 12-2017
Amount: $270,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2005
End Date: 01-2009
Amount: $300,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 08-2004
End Date: 08-2008
Amount: $30,500.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2017
End Date: 12-2019
Amount: $285,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2009
End Date: 12-2012
Amount: $410,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 04-2022
End Date: 04-2025
Amount: $435,092.00
Funder: Australian Research Council
View Funded ActivityStart Date: 12-2003
End Date: 12-2004
Amount: $30,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2004
End Date: 12-2004
Amount: $10,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 2018
End Date: 06-2025
Amount: $31,900,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 06-2011
End Date: 12-2017
Amount: $24,500,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 12-2004
End Date: 01-2011
Amount: $1,500,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 03-2008
End Date: 12-2011
Amount: $317,000.00
Funder: Australian Research Council
View Funded Activity