activity
20232026
most citedAn Expressive Ansatz for Low-Depth Quantum Approximate Optimisation

34 citations · 39 across the 10 of their papers we have counts for

collaborators

12 papers

quant-ph2026

Super-Exponential Advantage of Squeezed Light in Phase Estimation under Discrete Phase Randomisation

Lorcan O. Conlon, V Vijendran, Aritra Das +7

A paradigmatic task in quantum metrology is that of phase estimation. For this task it is commonly believed, under reasonable assumptions about prior information, that a quadratic…

quant-ph2026

Deciding the Attainability of the Multiparameter Quantum Fisher Information is NP-Hard

Lorcan O. Conlon, Laura Shou, V Vijendran +7

The quantum Fisher information (QFI) sets a fundamental bound on the attainable precision when estimating multiple parameters simultaneously. Incompatibility among the individually…

quant-ph2026

Beating three-parameter precision trade-offs with entangling collective measurements

Simon K. Yung, Wen-Zhe Yan, Lan-Tian Feng +10

Quantum-mechanical incompatibility, which precludes the simultaneous precise measurement of non-commuting observables, imposes fundamental limits on the rate at which classical inf…

quant-ph2026★ 1 cited

Precision Bounds for Characterising Quantum Measurements

Aritra Das, Simon K. Yung, Lorcan O. Conlon +6

Quantum measurements, alongside quantum states and processes, form a cornerstone of quantum information processing. However, unlike states and processes, their efficient characteri…

quant-ph2025

A unified optical platform for non-Gaussian and fault-tolerant Gottesman-Kitaev-Preskill states

Ozlem Erkilic, Aritra Das, Biveen Shajilal +3

Quantum technologies, encompassing communication, computation, and metrology, rely on the generation and control of non-Gaussian states of light. These states enable secure quantum…

quant-ph2025★ 1 cited

Utility of noiseless linear amplification and attenuation in single-rail discrete-variable quantum communications

Ozlem Erkilic, Aritra Das, Angela A. Baiju +3

Quantum communication offers many applications, with teleportation and superdense coding being two of the most fundamental. In these protocols, pre-shared entanglement enables eith…

quant-ph2025

Saturating the Quantum Cramér--Rao Bound in Prioritised Parameter Estimation

Simon K. Yung, Aritra Das, Jun Suzuki +4

Measurement incompatibility is a cornerstone of quantum mechanics. In the context of estimating multiple parameters of a quantum system, this manifests as a fundamental trade-off b…

quant-ph2025

Generalized collective quantum tomography: algorithm design, optimization, and validation

Shuixin Xiao, Yuanlong Wang, Zhibo Hou +6

Quantum tomography is a fundamental technique for characterizing, benchmarking, and verifying quantum states and devices. It plays a crucial role in advancing quantum technologies…

quant-ph2025★ 2 cited

Enhanced continuous-variable quantum key distribution protocol via adaptive signal processing

Ozlem Erkilic, Biveen Shajilal, Lorcan O. Conlon +7

Quantum key distribution (QKD) provides a promising approach to secure communications, with continuous-variable QKD (CV-QKD) offering compatibility with existing telecommunication…

quant-ph2024

Capacity-Achieving Entanglement Purification Protocol for Pauli Dephasing Channel

Ozlem Erkilic, Matthew S. Winnel, Aritra Das +4

Quantum communication enables secure information transmission and entanglement distribution, but these tasks are fundamentally limited by the capacities of quantum channels. While…

quant-ph2024★ 1 cited

Holevo Cramér-Rao bound: How close can we get without entangling measurements?

Aritra Das, Lorcán O. Conlon, Jun Suzuki +3

In multi-parameter quantum metrology, the resource of entanglement can lead to an increase in efficiency of the estimation process. Entanglement can be used in the state preparatio…

quant-ph2023★ 34 cited

An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation

V. Vijendran, Aritra Das, Dax Enshan Koh +2

The quantum approximate optimisation algorithm (QAOA) is a hybrid quantum-classical algorithm used to approximately solve combinatorial optimisation problems. It involves multiple…