arXiv subjects

Soumik Ghosh

Publications and source records attributed to Soumik Ghosh.

35 records · Page 2Linked to original sources

arXiv2025

The Hardness of Learning Quantum Circuits and its Cryptographic Applications

We show that concrete hardness assumptions about learning or cloning the output state of a random quantum circuit can be used as the foundation for secure quantum cryptography. In particular, under these assumptions we construct secure one-way state generators (OWSGs), digital signature schemes, quantum bit commitments, and private key encryption schemes. We also discuss evidence for these hardness assumptions by analyzing the best-known quantum learning algorithms, as well as proving black-box lower bounds for cloning and learning given state preparation oracles. Our random circuit-based constructions provide concrete instantiations of quantum cryptographic primitives whose security do not depend on the existence of one-way functions. The use of random circuits in our constructions also opens the door to NISQ-friendly quantum cryptography. We discuss noise tolerant versions of our OWSG and digital signature constructions which can potentially be implementable on noisy quantum computers connected by a quantum network. On the other hand, they are still secure against noiseless quantum adversaries, raising the intriguing possibility of a useful implementation of an end-to-end cryptographic protocol on near-term quantum computers. Finally, our explorations suggest that the rich interconnections between learning theory and cryptography in classical theoretical computer science also extend to the quantum setting.

quant-ph↗

arXiv2024

On the complexity of sampling from shallow Brownian circuits

While many statistical properties of deep random quantum circuits can be deduced, often rigorously and other times heuristically, by an approximation to global Haar-random unitaries, the statistics of constant-depth random quantum circuits are generally less well-understood due to a lack of amenable tools and techniques. We circumvent this barrier by considering a related constant-time Brownian circuit model which shares many similarities with constant-depth random quantum circuits but crucially allows for direct calculations of higher order moments of its output distribution. Using mean-field (large-n) techniques, we fully characterize the output distributions of Brownian circuits at shallow depths and show that they follow a Porter-Thomas distribution, just like in the case of deep circuits, but with a truncated Hilbert space. The access to higher order moments allows for studying the expected and typical Linear Cross-entropy (XEB) benchmark scores achieved by an ideal quantum computer versus the state-of-the-art classical spoofers for shallow Brownian circuits. We discover that for these circuits, while the quantum computer typically scores within a constant factor of the expected value, the classical spoofer suffers from an exponentially larger variance. Numerical evidence suggests that the same phenomenon also occurs in constant-depth discrete random quantum circuits, like those defined over the all-to-all architecture. We conjecture that the same phenomenon is also true for random brickwork circuits in high enough spatial dimension.

quant-ph↗

arXiv2024

Coarsening in the Long-range Ising Model with Conserved Dynamics

While the kinetics of domain growth, even for conserved order-parameter dynamics, is widely studied for short-range inter-particle interactions, systems having long-range interactions are receiving attention only recently. Here we present results, for such dynamics, from a Monte Carlo (MC) study of the two-dimensional long-range Ising model, with critical compositions of up and down spins. The order parameter in the MC simulations was conserved via the incorporation of the Kawasaki spin-exchange method. The simulation results for domain growth, following quenches of the homogeneous systems to temperatures below the critical values $T_c$, were analyzed via finite-size scaling and other advanced methods. The outcomes reveal that the growths follow power-laws, with the exponent having interesting dependence on the range of interaction. Quite interstingly, when the range is above a cut-off, the exponent, for any given range, changes from a larger value to a smaller one, during the evolution process. While the corresponding values at late times match with certain theoretical predictions for the conserved order-parameter dynamics, the ones at the early times appear surprisingly high, quite close to the theoretical values for the nonconserved case.

cond-mat.stat-mech↗

arXiv2024

Online learning of a panoply of quantum objects

In many quantum tasks, there is an unknown quantum object that one wishes to learn. An online strategy for this task involves adaptively refining a hypothesis to reproduce such an object or its measurement statistics. A common evaluation metric for such a strategy is its regret, or roughly the accumulated errors in hypothesis statistics. We prove a sublinear regret bound for learning over general subsets of positive semidefinite matrices via the regularized-follow-the-leader algorithm and apply it to various settings where one wishes to learn quantum objects. For concrete applications, we present a sublinear regret bound for learning quantum states, effects, channels, interactive measurements, strategies, co-strategies, and the collection of inner products of pure states. Our bound applies to many other quantum objects with compact, convex representations. In proving our regret bound, we establish various matrix analysis results useful in quantum information theory. This includes a generalization of Pinsker's inequality for arbitrary positive semidefinite operators with possibly different traces, which may be of independent interest and applicable to more general classes of divergences.

quant-ph↗

arXiv2024

Simulations of Mpemba Effect in WATER, Lennard-Jones and Ising Models: Metastability vs Critical Fluctuations

Via molecular dynamics simulations we study ICE formation in the TIP4P/Ice model that is known to describe structure and dynamics in various phases of WATER accurately. For this purpose well equilibrated configurations from different initial temperatures, Ts, belonging to the fluid phase, are quenched to a fixed subzero temperature. Our results on kinetics, for a wide range of Ts, following such quenches, show quicker crystallization of samples that are hotter at the beginning. This implies the presence of the puzzling Mpemba effect (ME). Via a similar study, we also identify ME in fluid to solid transitions in a Lennard-Jones (LJ) model. In the latter case, the ME appears purely as an outcome of the influence of critical fluctuations on the nonequilibrium growth process, for which we present interesting scaling results. For the TIP4P/Ice case, on the other hand, we show that delay in nucleation, due to metastability, can alone be a driving factor for the exhibition of ME. To substantiate the difference between the two cases, we also present LJ-like scaling results for ME in a magnetic transition. Our simulations indicate that in each of the systems the effect can be observed independent of the cooling rate that may vary when samples from different Ts are brought in contact with a heat reservoir working at a fixed lower temperature.

cond-mat.stat-mech↗

arXiv2024

Pseudomagic Quantum States

Notions of nonstabilizerness, or "magic", quantify how non-classical quantum states are in a precise sense: states exhibiting low nonstabilizerness preclude quantum advantage. We introduce 'pseudomagic' ensembles of quantum states that, despite low nonstabilizerness, are computationally indistinguishable from those with high nonstabilizerness. Previously, such computational indistinguishability has been studied with respect to entanglement, introducing the concept of pseudoentanglement. However, we demonstrate that pseudomagic neither follows from pseudoentanglement nor implies it. In terms of applications, the study of pseudomagic offers fresh insights into the theory of quantum scrambling: it uncovers states that, even though they originate from non-scrambling unitaries, remain indistinguishable from scrambled states to any physical observer. Additional applications include new lower bounds on state synthesis problems, property testing protocols, and implications for quantum cryptography. Our work is driven by the observation that only quantities measurable by a computationally bounded observer - intrinsically limited by finite-time computational constraints - hold physical significance. Ultimately, our findings suggest that nonstabilizerness is a 'hide-able' characteristic of quantum states: some states are much more magical than is apparent to a computationally bounded observer.

quant-ph↗

arXiv2024

Approximate t-designs in generic circuit architectures

Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate t-designs. Here we show that these bounds can be extended to any fixed architecture of Haar-random two-site gates. This is accomplished by relating the spectral gaps of such architectures to those of 1D brickwork architectures. Our bound depends on the details of the architecture only via the typical number of layers needed for a block of the circuit to form a connected graph over the sites. When this quantity is independent of width, the circuit forms an approximate t-design in linear depth. We also give an implicit bound for nondeterministic architectures in terms of properties of the corresponding distribution over fixed architectures.

quant-ph↗

arXiv2023

Public-key pseudoentanglement and the hardness of learning ground state entanglement structure

Given a local Hamiltonian, how difficult is it to determine the entanglement structure of its ground state? We show that this problem is computationally intractable even if one is only trying to decide if the ground state is volume-law vs near area-law entangled. We prove this by constructing strong forms of pseudoentanglement in a public-key setting, where the circuits used to prepare the states are public knowledge. In particular, we construct two families of quantum circuits which produce volume-law vs near area-law entangled states, but nonetheless the classical descriptions of the circuits are indistinguishable under the Learning with Errors (LWE) assumption. Indistinguishability of the circuits then allows us to translate our construction to Hamiltonians. Our work opens new directions in Hamiltonian complexity, for example whether it is difficult to learn certain phases of matter.

quant-ph↗

arXiv2023

Mpemba Effect and Superuniversality across Orders of Magnetic Phase Transition

The quicker freezing of hotter water, than a colder sample, when quenched to a common lower temperature, is referred to as the Mpemba effect (ME). While this counter-intuitive fact remains a surprize since long, efforts have begun to identify similar effect in other systems. Here we investigate the ME in a rather general context concerning magnetic phase transitions. From Monte Carlo simulations of model systems, viz., the $q$-state Potts model and the Ising model, with varying range of interaction and space dimension, we assert that hotter paramagnets undergo ferromagnetic ordering faster than the colder ones. The above conclusion we have arrived at following the analyses of the simulation results on decay of energy and growth in ordering following quenches from different starting temperatures, to fixed final temperatures below the Curie points. We have obtained a unique scaling picture, on the strength of the effect, with respect to the variation in spatial correlation in the initial states. These results are valid irrespective of the order of transition and relevant to the understanding of ME in other systems, including water.

cond-mat.stat-mech↗

arXiv2023

Effect of non-unital noise on random circuit sampling

In this work, drawing inspiration from the type of noise present in real hardware, we study the output distribution of random quantum circuits under practical non-unital noise sources with constant noise rates. We show that even in the presence of unital sources like the depolarizing channel, the distribution, under the combined noise channel, never resembles a maximally entropic distribution at any depth. To show this, we prove that the output distribution of such circuits never anticoncentrates $\unicode{x2014}$ meaning it is never too "flat" $\unicode{x2014}$ regardless of the depth of the circuit. This is in stark contrast to the behavior of noiseless random quantum circuits or those with only unital noise, both of which anticoncentrate at sufficiently large depths. As consequences, our results have interesting algorithmic implications on both the hardness and easiness of noisy random circuit sampling, since anticoncentration is a critical property exploited by both state-of-the-art classical hardness and easiness results.

quant-ph↗

arXiv2023

Aging during Phase Separation in Long-Range Ising Model

The kinetics of domain growth and aging in conserved order parameter systems, in the presence of short-range interaction, is widely studied. Due to technical difficulties and lack of resources, regarding computation, the dynamics is still not well established in the cases where long-range interactions are involved. Here we present related results from the Monte Carlo simulations of the two-dimensional long-range Ising model (LRIM). Random initial configurations, for $50:50$ compositions of up and down spins, mimicking high temperature equilibrium states, have been quenched to temperatures inside the coexistence curve. Our analysis of the simulation data, for such a protocol, shows interesting dependence of the aging exponent, $λ$, on $σ$, the parameter, within the Hamiltonian, that controls the range of interaction. To complement these results, we also discuss simulation outcomes for the growth exponent. The obtained values of $λ$ are compared with a well-known result for the lower bounds. For this purpose we have extracted interesting properties of the evolving structure.

cond-mat.stat-mech↗

arXiv2023

Quantum Pseudoentanglement

Entanglement is a quantum resource, in some ways analogous to randomness in classical computation. Inspired by recent work of Gheorghiu and Hoban, we define the notion of "pseudoentanglement'', a property exhibited by ensembles of efficiently constructible quantum states which are indistinguishable from quantum states with maximal entanglement. Our construction relies on the notion of quantum pseudorandom states -- first defined by Ji, Liu and Song -- which are efficiently constructible states indistinguishable from (maximally entangled) Haar-random states. Specifically, we give a construction of pseudoentangled states with entanglement entropy arbitrarily close to $\log n$ across every cut, a tight bound providing an exponential separation between computational vs information theoretic quantum pseudorandomness. We discuss applications of this result to Matrix Product State testing, entanglement distillation, and the complexity of the AdS/CFT correspondence. As compared with a previous version of this manuscript (arXiv:2211.00747v1) this version introduces a new pseudorandom state construction, has a simpler proof of correctness, and achieves a technically stronger result of low entanglement across all cuts simultaneously.

quant-ph↗

arXiv2022

Sharp complexity phase transitions generated by entanglement

Entanglement is one of the physical properties of quantum systems responsible for the computational hardness of simulating quantum systems. But while the runtime of specific algorithms, notably tensor network algorithms, explicitly depends on the amount of entanglement in the system, it is unknown whether this connection runs deeper and entanglement can also cause inherent, algorithm-independent complexity. In this work, we quantitatively connect the entanglement present in certain quantum systems to the computational complexity of simulating those systems. Moreover, we completely characterize the entanglement and complexity as a function of a system parameter. Specifically, we consider the task of simulating single-qubit measurements of $k$--regular graph states on $n$ qubits. We show that, as the regularity parameter is increased from $1$ to $n-1$, there is a sharp transition from an easy regime with low entanglement to a hard regime with high entanglement at $k=3$, and a transition back to easy and low entanglement at $k=n-3$. As a key technical result, we prove a duality for the simulation complexity of regular graph states between low and high regularity.

quant-ph↗

arXiv2022

Determinants Of Migration: Linear regression Analysis in Indian Context

Environmental degradation, global pandemic and severing natural resource related problems cater to increase demand resulting from migration is nightmare for all of us. Huge flocks of people are rushing towards to earn, to live and to lead a better life. This they do for their own development often ignoring the environmental cost. With existing model, this paper looks at out migration (interstate) within India focusing on the various proximate and fundamental causes relating to migration. The author deploys OLS to see those fundamental causes. Obviously, these are not exhaustive cause, but definitely plays a role in migration decision of individual. Finally, this paper advocates for some policy prescription to cope with this problem.

econ.GN↗

arXiv2020

Complexity limitations on one-turn quantum refereed games

This paper studies complexity theoretic aspects of quantum refereed games, which are abstract games between two competing players that send quantum states to a referee, who performs an efficiently implementable joint measurement on the two states to determine which of the player wins. The complexity class $\mathrm{QRG}(1)$ contains those decision problems for which one of the players can always win with high probability on yes-instances and the other player can always win with high probability on no-instances, regardless of the opposing player's strategy. This class trivially contains $\mathrm{QMA} \cup \text{co-}\mathrm{QMA}$ and is known to be contained in $\mathrm{PSPACE}$. We prove stronger containments on two restricted variants of this class. Specifically, if one of the players is limited to sending a classical (probabilistic) state rather than a quantum state, the resulting complexity class $\mathrm{CQRG}(1)$ is contained in $\exists\cdot\mathrm{PP}$ (the nondeterministic polynomial-time operator applied to $\mathrm{PP}$); while if both players send quantum states but the referee is forced to measure one of the states first, and incorporates the classical outcome of this measurement into a measurement of the second state, the resulting class $\mathrm{MQRG}(1)$ is contained in $\mathrm{P}\cdot\mathrm{PP}$ (the unbounded-error probabilistic polynomial-time operator applied to $\mathrm{PP}$).

cs.CC↗

arXiv2019

Revisiting Integer Factorization using Closed Timelike Curves

Closed Timelike Curves are relativistically valid objects allowing time travel to the past. Treating them as computational objects opens the door to a wide range of results which cannot be achieved using non relativistic quantum mechanics. Recently, research in classical and quantum computation has focused on effectively harnessing the power of these curves. In particular, Brun (Found. Phys. Lett., 2003) has shown that CTCs can be utilized to efficiently solve problems like factoring and QSAT (Quantified Satisfiability Problem). In this paper, we find a flaw in Brun's algorithm and propose a modified algorithm to circumvent the flaw.

quant-ph↗

arXiv2018

Quantum Signaling to the Past Using P-CTCS

Closed Timelike Curves (CTCs) are intriguing relativistic objects that allow for time travel to the past and can be used as computational resources. In Deutschian Closed Timelike Curves (D-CTCs), due to the monogamy of entanglement, non-local correlations between entangled states are destroyed. In contrast, for Postselected Closed Timelike Curves (P-CTCs), a second variant of CTCs, the non-local correlations are preserved. P-CTCs can be harnessed for the signaling of non-orthogonal states to the past without a disruption of causality. In this paper, we take up signaling to the past and show a method of sending four non-orthogonal states to the past using P-CTCs. After constructing our signaling protocol, we study the causality violations that our protocol results in and put forward two consistency relations to prevent them.

quant-ph↗