output
20082026
most citedObservation of Gravitational Waves from a Binary Black Hole Merger

14.2k citations

Showing 2024 · quant-phShow all

9 papers · 2 filters

quant-ph2024

Efficient Classical Simulation of the DQC1 Circuit with Zero Discord

Shalin Jose, Akshay Kannan Sairam, Anil Shaji

A path for efficient classical simulation of the DQC1 circuit that estimates the trace of an implementable unitary under the zero discord condition [Phys. Rev. Lett. 105, 190502 (2…

quant-ph2024★ 3 cited

Single-shot Distinguishability and Anti-distinguishability of Quantum Measurements

Satyaki Manna, Sneha Suresh, Manan Singh Kachhawaha +1

Among the surprising features of quantum measurements, the problem of distinguishing and antidistinguishing general quantum measurements is fundamentally appealing. Unlike classica…

quant-ph2024★ 2 cited

Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities

Soumyabrata Hazra, Debashis Saha, Anubhav Chaturvedi +2

Finding a set of empirical criteria fulfilled by any theory satisfying the generalized notion of noncontextuality is a challenging task of both operational and foundational importa…

quant-ph2024★ 1 cited

Non-classical correlations between a quantum probe and complex quantum systems in presence of noise

Bijoy John Mathew, Sanchit Srivastava, Anil Shaji

Non-classical correlations generated within a quantum probe system when it interacts with a large, macroscopic system can signal the presence of quantum features in the latter. The…

quant-ph2024★ 11 cited

Single system based generation of certified randomness using Leggett-Garg inequality

Pingal Pratyush Nath, Debashis Saha, Dipankar Home +1

We theoretically formulate and experimentally demonstrate a secure scheme for semi-device-independent quantum random number generation by utilizing Leggett-Garg inequality violatio…

quant-ph2024★ 1 cited

Failure of epistemic models to explain the antidistinguishability of quantum mixed preparations

Sagnik Ray, Visweshwaran R, Debashis Saha

We investigate the limits of epistemic models in reproducing the empirical predictions of general quantum preparations. This involves comparing the common quantum overlap determine…

quant-ph2024★ 8 cited

Unbounded quantum advantage in communication complexity measured by distinguishability

Satyaki Manna, Anubhav Chaturvedi, Debashis Saha

Communication complexity is a fundamental aspect of information science, concerned with the amount of communication required to solve a problem distributed among multiple parties.…

quant-ph2024★ 2 cited

Simulating quantum field theories on gate-based quantum computers

Gayathree M. Vinod, Anil Shaji

We implement a simulation of a quantum field theory in 1+1 space-time dimensions on a gate-based quantum computer using the light front formulation of the theory. The nonperturbati…

quant-ph2024

Classifying Measurement Incompatibility under Classical Pre- and Post-Processing Operations

Arun Kumar Das, Saheli Mukherjee, Debashis Saha +2

Measurement incompatibility has proved to be an important resource for quantum information processing. In this work, we present an operational approach that leverages classical ope…