Searcharxiv⌕ Search

arXiv subjects

Akshata Shenoy H.

Publications and source records attributed to Akshata Shenoy H..

14 recordsLinked to original sources

Three-qubit W state tomography via full and marginal state reconstructions on ibm_osaka

We present a three-qubit quantum state tomography scheme requiring a set of 17 measurement settings, significantly reducing the experimental overhead compared to the conventional 63 Pauli measurement settings. Using IBM's 127-qubit open-access quantum processor ibm osaka, we prepare the three-qubit W state and employ our tomography scheme to reconstruct it. Additionally, we implement a two-qubit tomography protocol, involving 7 measurement settings, on ibm osaka to reconstruct two of the two-qubit marginals of the W state. This serves as a {\em proof-of-principle} demonstration of the well-known theoretical result that any two of the two-qubit reduced density matrices can uniquely determine most of the whole three-qubit pure states. We show that the fidelity of the W-state reconstructed from its two-qubit subsystems is consistently larger than that obtained from the full three-qubit tomography, highlighting the practical advantage of the subsystem-based tomography approach.

quant-ph↗

Hacking quantum computers with row hammer attack

We demonstrate a hardware vulnerability in quantum computing systems by exploiting cross-talk effects on an available commercial quantum computer (IBM). Specifically, based on the cross-talk produced by certain quantum gates, we implement a row hammer attack that ultimately allows us to flip a qubit. Both single-qubit and two-qubit operations are performed and analyzed. Our findings reveal that two-qubit operations applied near the target qubit significantly influence it through cross-talk, effectively compromising its state.

quant-ph↗

Noise-Resilient Quantum Random Access Codes

A $n^d \xrightarrow{p} 1$ Quantum Random Access Code (QRAC) is a communication task where Alice encodes $n$ classical bits into quantum states of dimension $d$ and transmits them to Bob, who performs appropriate measurements to recover the required bit with probability $p$. In the presence of a noisy environment, the performance of a QRAC is degraded, losing the advantage over classical strategies. We propose a practical technique that enables noise tolerance in such scenarios, recovering the quantum advantage in retrieving the required bit. We perform a photonic implementation of a $2^2 \xrightarrow {\text{p}} 1$ QRAC using polarization-encoded qubits under an amplitude-damping channel, where simple operations allow for noise robustness showing the revival of the quantum advantage when the noisy channel degrades the performance of the QRAC. This revival can be observed by violating a suitable dimension witness, which is closely related to the average success probability of the QRAC. This technique can be extended to other applications in the so-called prepare-and-measure scenario, enhancing the semi-device-independent protocol implementations.

quant-ph↗

Applications of Quantum Machine Learning for Quantitative Finance

Machine learning and quantum machine learning (QML) have gained significant importance, as they offer powerful tools for tackling complex computational problems across various domains. This work gives an extensive overview of QML uses in quantitative finance, an important discipline in the financial industry. We examine the connection between quantum computing and machine learning in financial applications, spanning a range of use cases including fraud detection, underwriting, Value at Risk, stock market prediction, portfolio optimization, and option pricing by overviewing the corpus of literature concerning various financial subdomains.

quant-ph↗

Maximally nonlocal subspaces

A nonlocal subspace $\mathcal{H}_{NS}$ is a subspace within the Hilbert space $\mathcal{H}_n$ of a multi-particle system such that every state $ψ\in \mathcal{H}_{NS}$ violates a given Bell inequality $\mathcal{B}$. Subspace $\mathcal{H}_{NS}$ is maximally nonlocal if each such state $ψ$ violates $\mathcal{B}$ to its algebraic maximum. We propose ways by which states with a stabilizer structure of graph states can be used to construct maximally nonlocal subspaces, essentially as a degenerate eigenspace of Bell operators derived from the stabilizer generators. Two cryptographic applications-- to quantum information splitting and quantum subspace certification-- are discussed.

quant-ph↗

Quantum cryptography: key distribution and beyond

Uniquely among the sciences, quantum cryptography has driven both foundational research as well as practical real-life applications. We review the progress of quantum cryptography in the last decade, covering quantum key distribution and other applications.

quant-ph↗

Exploring the role of Leggett-Garg inequality for quantum cryptography

In the cryptographic context, an earlier unexplored application of the temporal version of the Bell-type inequality is shown here in the device-independent (DI) scenario. This is done by using the Leggett-Garg inequality (LGI) to demonstrate the security against eavesdropping in a quantum key distribution (QKD) scheme. This typically involves a higher dimensional attack against which the standard BB84 protocol is insecure. For this purpose, we invoke an appropriate form of LGI. While the key generation is done by the usual Bennett-Brassard 1984 (BB84) method, the security check against device attacks is provided by testing for the violation of the particular form of LGI used here.

quant-ph↗

Counterfactual distribution of cat states

In the counterfactual cryptography scheme proposed by Noh (2009), the sender Alice probabilistically transmits classical information to the receiver Bob without the physical travel of a particle. Here we generalize this idea to the distribution of quantum entanglement. The key insight is to replace their classical input choices with quantum superpositions. We further show that the scheme can be generalized to counterfactually distribute multi-partite cat states.

quant-ph↗

Towards secure communication using intra-particle entanglement

We explore the use of the resource of intra-particle entanglement for secure quantum key distribution in the device-independent scenario. By virtue of the local nature of such entanglement, Bell tests must be implemented locally, which leads to a natural decoupling of device errors from channel errors. We consider a side channel attack on the sender's state preparation device, for which the intra-particle-entanglement based scheme is shown to be more secure than the one that uses separable states. Of practical relevance is the fact that such entanglement can be easily generated using linear optics.

quant-ph↗

The wave-function is real but nonphysical: A view from counterfactual quantum cryptography

Counterfactual quantum cryptography (CQC) is used here as a tool to assess the status of the quantum state: Is it real/ontic (an objective state of Nature) or epistemic (a state of the observer's knowledge)? In contrast to recent approaches to wave function ontology, that are based on realist models of quantum theory, here we recast the question as a problem of communication between a sender (Bob), who uses interaction-free measurements, and a receiver (Alice), who observes an interference pattern in a Mach-Zehnder set-up. An advantage of our approach is that it allows us to define the concept of "physical", apart from "real". In instances of counterfactual quantum communication, reality is ascribed to the interaction-freely measured wave function ($ψ$) because Alice deterministically infers Bob's measurement. On the other hand, $ψ$ does not correspond to the physical transmission of a particle because it produced no detection on Bob's apparatus. We therefore conclude that the wave function in this case (and by extension, generally) is real, but not physical. Characteristically for classical phenomena, the reality and physicality of objects are equivalent, whereas for quantum phenomena, the former is strictly weaker. As a concrete application of this idea, the nonphysical reality of the wavefunction is shown to be the basic nonclassical phenomenon that underlies the security of CQC.

quant-ph↗

Counterfactual quantum certificate authorization

We present a multi-partite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.

quant-ph↗

Semi-counterfactual Cryptography

In counterfactual quantum key distribution (QKD), two remote parties can securely share random polarization-encoded bits through the blocking rather than the transmission of particles. We propose a semi-counterfactual QKD, i.e., one where the secret bit is shared, and also encoded, based on the blocking or non-blocking of a particle. The scheme is thus semi-counterfactual and not based on polarization encoding. As with other counterfactual schemes and the Goldenberg-Vaidman protocol, but unlike BB84, the encoding states are orthogonal and security arises ultimately from single-particle non-locality. Unlike any of them, however, the secret bit generated is maximally indeterminate until the joint action of Alice and Bob. We prove the general security of the protocol, and study the most general photon-number-preserving incoherent attack in detail.

quant-ph↗

Quantum key distribution using intra-particle entanglement

We propose the use of intra-particle entanglement to enhance the security of a practical implementation of the Bennett-Brassard-1984 (BB84) quantum key distribution scheme. Intra-particle entanglement is an attractive resource since it can be easily generated using only linear optics. Security is studied under a simple model of incoherent attack for protocols involving two or all five mutually unbiased bases. In terms of efficiency of secret key generation and tolerable error rate, the latter is found to be superior to the former. We find that states that allow secrecy distillation are necessarily entangled, though they may be local. Since more powerful attacks by Eve obviously exist, our result implies that security is a strictly stronger condition than entanglement for these protocols.

quant-ph↗

Dual quantum information splitting with degenerate graph states

We propose a protocol for secret sharing, called dual quantum information splitting (DQIS), that reverses the roles of state and channel in standard quantum information splitting. In this method, a secret is shared via teleportation of a fiducial input state over an entangled state that encodes the secret in a graph state basis. By performing a test of violation of a Bell inequality on the encoded state, the legitimate parties determine if the violation is sufficiently high to permit distilling secret bits. Thus, the code space must be maximally and exclusively nonlocal. To this end, we propose two ways to obtain code words that are degenerate with respect to a Bell operator. The security of DQIS comes from monogamy of nonlocal correlations, which we illustrate by means of a simple single-qubit attack model. The nonlocal basis of security of our protocol makes it suitable for security in general monogamous theories and in the more stringent, device-independent cryptographic scenario.

quant-ph↗