Madhav Krishnan Vijayan

Madhav Krishnan Vijayan

Auto-generated profile, based on publicly available information

Madhav Krishnan Vijayan

Centre for Quantum Software & Information (UTS:QSI), University of Technology Sydney, Sydney NSW, Australia

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
12 February 2024 in Quantum Science and Technology
Verified
Journal Article
Open access
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 tolerant implementations.

3 August 2020 in Quantum
Verified
Journal Article
Open access
PDF file
MVMadhav Krishnan Vijayan
Madhav Krishnan Vijayan
Austin Peter LundAustin Peter Lund
Austin Peter Lund
PRPeter P. Rohde
Peter P. Rohde
Error-detection and correction are necessary prerequisites for any scalable quantum computing architecture. Given the inevitability of unwanted physical noise in quantum systems and the propensity for errors to spread as computations proceed, computational outcomes can become substantially corrupted. This observation applies regardless of the choice of physical implementation. In the context of photonic quantum information processing, there has recently been much interest inpassivelinear optics quantum computing, which includes boson-sampling, as this model eliminates the highly-challenging requirements for feed-forward via fast, active control. That is, these systems arepassiveby definition. In usual scenarios, error detection and correction techniques are inherentlyactive, making them incompatible with this model, arousing suspicion that physical error processes may be an insurmountable obstacle. Here we explore a photonic error-detection technique, based on W-state encoding of photonic qubits, which is entirely passive, based on post-selection, and compatible with these near-term photonic architectures of interest. We show that this W-state redundant encoding techniques enables the suppression of dephasing noise on photonic qubits via simple fan-out style operations, implemented by optical Fourier transform networks, which can be readily realised today. The protocol effectively maps dephasing noise into heralding failures, with zero failure probability in the ideal no-noise limit. We present our scheme in the context of a single photonic qubit passing through a noisy communication or quantum memory channel, which has not been generalised to the more general context of full quantum computation.

14 September 2018 in Journal of Physics A: Mathematical and Theoretical
Verified
Journal Article
Closed access
PDF file
MVMadhav Krishnan Vijayan
Madhav Krishnan Vijayan
ECEric Chitambar
Eric Chitambar
MHMin-Hsiu Hsieh
Min-Hsiu Hsieh
We find one-shot bounds for concentration of maximally coherent states in the so called assisted scenario. In this setting, Bob is restricted to performing incoherent operations on his quantum system, however he is assisted by Alice, who holds a purification of Bob’s state and can send classical data to him. We further show that in the asymptotic limit our one-shot bounds recover the previously computed rate of asymptotic assisted concentration.

4 November 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MVMadhav Krishnan Vijayan
Madhav Krishnan Vijayan
Eric A ChitambarEric A Chitambar
Eric A Chitambar
MHMin-Hsiu Hsieh
Min-Hsiu Hsieh
We present bounds for distilling many copies of a pure state from an arbitrary initial state in a general quantum resource theory. Our bounds apply to operations that are able to generate no more than a δ amount of resource, where δ≥0 is a given parameter. To maximize applicability of our upper bound, we assume little structure on the set of free states under consideration besides a weak form of superadditivity of the function Gmin(ρ), which measures the overlap between ρ and the set of free states. Our bounds are given in terms of this function and the robustness of resource. Known results in coherence and entanglement theory are reproduced in this more general framework.

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.

1 January 2020
Verified
Conference Paper
Closed access
PDF file
RRRohit K. Ramakrishnan
Rohit K. Ramakrishnan
ARAravinth Balaji Ravichandran
Aravinth Balaji Ravichandran
STSrinivas Talabattula
Srinivas Talabattula
MVMadhav Krishnan Vijayan
Madhav Krishnan Vijayan
Austin Peter LundAustin Peter Lund
Austin Peter Lund
PRPeter P. Rohde
Peter P. Rohde
In this paper, we present a passive linear optics error correction scheme for qudits using W-state encoding, based on post selection, which reduces the effects of dephasing noise in photonic quantum communication.