SearcharxivSearch

arXiv subjects

Turbasu Chatterjee

Publications and source records attributed to Turbasu Chatterjee.

8 recordsLinked to original sources

Symmetry Constraints Regularize Neural Quantum State Learning

Neural quantum states (NQS) offer highly expressive variational wavefunctions, but their optimization is frequently bottlenecked by redundant parameters and poorly conditioned landscapes. We demonstrate that embedding Hamiltonian symmetries directly into the variational parameterization geometrically regularizes this learning problem. For Boltzmann-family NQS, we enforce symmetries by tying local Pauli-$Z$ generators along physical geometric orbits, analytically collapsing the trainable coefficient space prior to optimization. To quantify the resulting optimization geometry, we introduce a geometric metric built on the Jacobian and Hessian of the optimization landscape. This framework evaluates the fraction of the physically accessible state space that corresponds to high-quality, low-energy solutions. Evaluating our approach on transverse-field Ising (TFIM) and XXZ spin chains shows that symmetry compilation excises the vast majority of parameters while maintaining ground-state accuracy within the resolution of the reported benchmarks. In large TFIM systems, strong spatial constraints compress thousands of parameters down to tens, delivering substantial runtime accelerations. Our geometric diagnostics indicate that symmetry produces a more favorable target-aware geometry by concentrating the reachable state space around low-energy solutions while retaining broad target basins. Together, our results indicate that symmetry compilation concentrates the expressive power of NQS on states relevant to the target problem, thereby reducing model size and training cost without sacrificing accuracy.

quant-ph

Modified security analysis of device-independent quantum key distribution with random key basis

Security analysis is a critical part in any cryptographic protocol, may it be classical or quantum. Without security analysis, one cannot ensure the secrecy of the distributed keys. To perform a conclusive security analysis, it is very often necessary to frame the problem as an optimization problem. However, solving such optimization problems is quite challenging. In this article, we focus on the security analysis of device-independent quantum key distribution (DIQKD) with random key basis protocol. We show that the optimization cost of the existing security analysis can be reduced without compromising the key rate. In particular, we reframe the entire security analysis of this protocol as a strongly convex optimization problem and demonstrate that unlike the original security proof, optimization of Bob's measurement angles for finding a lower bound on Eve's uncertainty about Alice's key generation basis can be done with lesser cost. We derive an explicit form of the pessimistic error that arises while optimizing the measurement angles of both the parties. We also clarify a few parts of the original security proof, making the analysis more rigorous and complete.

quant-ph

Fast classical simulation of qubit-qudit hybrid systems

Simulating quantum circuits is a computationally intensive task that relies heavily on tensor products and matrix multiplications, which can be inefficient. Recent advancements, eliminate the need for tensor products and matrix multiplications, offering significant improvements in efficiency and parallelization. Extending these optimizations, we adopt a block-simulation methodology applicable to qubit-qudit hybrid systems. This method interprets the statevector as a collection of blocks and applies gates without computing the entire circuit unitary. Our method, a spiritual successor of the simulator QuDiet \cite{Chatterjee_2023}, utilizes this block-simulation method, thereby gaining major improvements over the simulation methods used by its predecessor. We exhibit that the proposed method is approximately 10$\times$ to 1000$\times$ faster than the state-of-the-art simulator for simulating multi-level quantum systems with various benchmark circuits.

quant-ph

QuDiet: A Classical Simulation Platform for Qubit-Qudit Hybrid Quantum Systems

In the recent years, numerous research advancements have extended the limit of classical simulation of quantum algorithms. Although, most of the state-of-the-art classical simulators are only limited to binary quantum systems, which restrict the classical simulation of higher-dimensional quantum computing systems. Through recent developments in higher-dimensional quantum computing systems, it is realized that implementing qudits improves the overall performance of a quantum algorithm by increasing memory space and reducing the asymptotic complexity of a quantum circuit. Hence, in this article, we introduce \textbf{QuDiet}, a state-of-the-art user-friendly python-based higher-dimensional quantum computing simulator. \textbf{QuDiet} offers multi-valued logic operations by utilizing generalized quantum gates with an abstraction so that any naive user can simulate qudit systems with ease as compared to the existing ones. We simulate various benchmark quantum circuits in \textbf{QuDiet} and show the considerable speedup in simulation time as compared to the other simulators without loss in precision. Finally, \textbf{QuDiet} provides a full qubit-qudit hybrid quantum simulator package with quantum circuit templates of well-known quantum algorithms for fast prototyping and simulation. The complete code and packages of \textbf{QuDiet} is available at https://github.com/LegacYFTw/QuDiet so that other platforms can incorporate it as a classical simulation option for qubit-qudit hybrid systems to their platforms.

quant-ph

Intermediate Qutrit-based Improved Quantum Arithmetic Operations with Application on Financial Derivative Pricing

In some quantum algorithms, arithmetic operations are of utmost importance for resource estimation. In binary quantum systems, some efficient implementation of arithmetic operations like, addition/subtraction, multiplication/division, square root, exponential and arcsine etc. have been realized, where resources are reported as a number of Toffoli gates or T gates with ancilla. Recently it has been demonstrated that intermediate qutrits can be used in place of ancilla, allowing us to operate efficiently in the ancilla-free frontier zone. In this article, we have incorporated intermediate qutrit approach to realize efficient implementation of all the quantum arithmetic operations mentioned above with respect to gate count and circuit-depth without T gate and ancilla. Our resource estimates with intermediate qutrits could guide future research aimed at lowering costs considering arithmetic operations for computational problems. As an application of computational problems, related to finance, are poised to reap the benefit of quantum computers, in which quantum arithmetic circuits are going to play an important role. In particular, quantum arithmetic circuits of arcsine and square root are necessary for path loading using the re-parameterization method, as well as the payoff calculation for derivative pricing. Hence, the improvements are studied in the context of the core arithmetic circuits as well as the complete application of derivative pricing. Since our intermediate qutrit approach requires to access higher energy levels, making the design prone to errors, nevertheless, we show that the percentage decrease in the probability of error is significant owing to the fact that we achieve circuit robustness compared to qubit-only works.

quant-ph

Energy Landscape Structure of Small Graph Isomorphism Under Variational Optimization

We investigate a quadratic unconstrained binary optimization (QUBO) formulation of the graph isomorphism problem using the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE). For small graph instances, we observe that isomorphic pairs exhibit consistent clustering in variational energies, indicating that the Hamiltonian successfully encodes structural features. However, we demonstrate that low variational energy alone is an unreliable certifier of isomorphism due to the high probability of converging to infeasible states that violate bijection constraints. To address this, we analyze optimization trajectories rather than final energies; consistently outperform naive energy thresholding, though absolute performance remains limited. Our results characterize the current limits of variational algorithms for graph isomorphism, positioning energy landscape analysis as a diagnostic tool rather than a scalable decision procedure in the NISQ regime.

quant-ph

Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler

When working with algorithms on quantum devices, quantum memory becomes a crucial bottleneck due to low qubit count in NISQ-era devices. In this context, the concept of `divide and compute', wherein a quantum circuit is broken into several subcircuits and executed separately, while stitching the results of the circuits via classical post-processing, becomes a viable option, especially in NISQ-era devices. This paper introduces \textbf{Qurzon}, a proposed novel quantum compiler that incorporates the marriage of techniques of divide and compute with the state-of-the-art algorithms of optimal qubit placement for executing on real quantum devices. A scheduling algorithm is also introduced within the compiler that can explore the power of distributed quantum computing while paving the way for quantum parallelism for large algorithms. Several benchmark circuits have been executed using the compiler, thereby demonstrating the power of the divide and compute when working with real NISQ-era quantum devices.

quant-ph

A near-term quantum simulation of the transverse field Ising model hints at Glassy Dynamics

We demonstrate quantum circuit simulations of the transverse field Ising model with longitudinal fields, displaying salient features of glassy dynamics. The energy landscape and spin configurations of toy models are considered, using the Variational Quantum Eigensolver (VQE) to obtain the ground-state energies and corresponding eigenstates for a $6 \times 6$ Ising lattice using 36 qubits and a 1-dimensional Ising chain of length 25 using 25 qubits. The former showed disordered spin configurations for a specific mixture of values of the two fields. These insights mirror catalytic processes, where disorder within a catalyst can lead to inefficient reaction mechanisms. Results obtained from our proof-of-principle implementation make the case for kick-starting more concentrated efforts in harnessing existing quantum computational tools for computationally probing complex dynamical behaviour arising in quantum matter. Our aim is to leverage tools from quantum information processing to bring about a more nuanced understanding of the dynamics and structure of glassy systems, ultimately informing the development of novel materials and technology.

quant-ph