Joydip Ghosh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Joydip Ghosh has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Michael R. Geller
University of Georgia
5 shared publications Malabika Roy
Center for Earth Observing and Space Research, College of Science, George Mason University, Fairfax, VA, 22030-4444, USA
2 shared publicationsMenas Kafatos
Center for Earth Observing and Space Research, College of Science, George Mason University, Fairfax, VA, 22030-4444, USA
2 shared publications- Sisir Roy
National Institute of Advanced Studies
2 shared publications - Austin G. Fowler
Department of Physics University of California 93106 Santa Barbara California USA
1 shared publication - Barry C. Sanders
Institute for Quantum Science and Technology, University of Calgary, Calgary, Canada
1 shared publication
Latest Publications
- Open Access
- 24 March 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Optimization-free recursive Quantum Approximate Optimization Algorithm for the binary paint shop problem
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for near-term quantum advantage, yet its practical impact is hindered by limited performance on symmetric local Hamiltonians and the costly optimization of variational parameters. The recursive-QAOA (RQAOA) introduced by Bravyi [] addresses the first limitation while also reducing circuit size, and parameter transfer techniques can be used to bypass the optimization loop effectively. In this work, we combine these two ideas to develop an optimization-free RQAOA and evaluate its performance on the binary paint shop problem (BPSP)—an optimization problem found in manufacturing where a sequence of cars must be painted under constraints while minimizing the number of color changes. The BPSP can be formulated as an Ising ground state problem with a symmetric local Hamiltonian in the form of MAX-CUT and properties well suited for the application of QAOA parameter transfer. We benchmark QAOA and RQAOA with parameter transfer against classical solvers and heuristics, and investigate their resilience to suboptimal parameters. For circuit optimization, we use reverse-causal cones and introduce a method of trimming outer two-qubit gates. To estimate the classical resources needed to simulate these quantum algorithms, we compute entanglement entropy and bond dimensions using matrix product state methods. We also compare circuit sizes and measurement counts across implementations. Our results show that RQAOA is inherently robust to parameter deviations, maintaining near-optimal solutions without noticeable degradation under parameter transfer while substantially reducing quantum resource requirements compared to QAOA. This highlights a viable route toward scalable quantum optimization without the overhead of the classical optimization loop and its challenges with barren plateaus.
- 24 March 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Open AccessOptimization-free recursive Quantum Approximate Optimization Algorithm for the binary paint shop problem
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for near-term quantum advantage, yet its practical impact is hindered by limited performance on symmetric local Hamiltonians and the costly optimization of variational parameters. The recursive-QAOA (RQAOA) introduced by Bravyi [] addresses the first limitation while also reducing circuit size, and parameter transfer techniques can be used to bypass the optimization loop effectively. In this work, we combine these two ideas to develop an optimization-free RQAOA and evaluate its performance on the binary paint shop problem (BPSP)—an optimization problem found in manufacturing where a sequence of cars must be painted under constraints while minimizing the number of color changes. The BPSP can be formulated as an Ising ground state problem with a symmetric local Hamiltonian in the form of MAX-CUT and properties well suited for the application of QAOA parameter transfer. We benchmark QAOA and RQAOA with parameter transfer against classical solvers and heuristics, and investigate their resilience to suboptimal parameters. For circuit optimization, we use reverse-causal cones and introduce a method of trimming outer two-qubit gates. To estimate the classical resources needed to simulate these quantum algorithms, we compute entanglement entropy and bond dimensions using matrix product state methods. We also compare circuit sizes and measurement counts across implementations. Our results show that RQAOA is inherently robust to parameter deviations, maintaining near-optimal solutions without noticeable degradation under parameter transfer while substantially reducing quantum resource requirements compared to QAOA. This highlights a viable route toward scalable quantum optimization without the overhead of the classical optimization loop and its challenges with barren plateaus.
- Open Access
- 1 November 2018
- Published by IOP Publishing in New Journal of Physics
- Vol. 20 (11) , 113009
Quantum control for high-fidelity multi-qubit gates
Quantum control for error correction is critical for the practical use of quantum computers. We address quantum optimal control for single-shot multi-qubit gates by framing it as a feasibility problem for the Hamiltonian model that is then solved with standard global optimization software. Our approach yields faster high-fidelity (>99.99%) single-shot three-qubit-gate control than obtained previously, and it has also enabled us to solve the quantum-control problem for a fast high-fidelity four-qubit gate.
- 1 November 2018
- Published by IOP Publishing in New Journal of Physics
- Vol. 20 (11) , 113009
Open AccessQuantum control for high-fidelity multi-qubit gates
Quantum control for error correction is critical for the practical use of quantum computers. We address quantum optimal control for single-shot multi-qubit gates by framing it as a feasibility problem for the Hamiltonian model that is then solved with standard global optimization software. Our approach yields faster high-fidelity (>99.99%) single-shot three-qubit-gate control than obtained previously, and it has also enabled us to solve the quantum-control problem for a fast high-fidelity four-qubit gate.
- Open Access
- 23 June 2017
- Published by Springer Nature in Nature Communications
- Vol. 8 (1) , 15923
A decoherence-free subspace in a charge quadrupole qubit
Quantum computing promises significant speed-up for certain types of computational problems. However, robust implementations of semiconducting qubits must overcome the effects of charge noise that currently limit coherence during gate operations. Here we describe a scheme for protecting solid-state qubits from uniform electric field fluctuations by generalizing the concept of a decoherence-free subspace for spins, and we propose a specific physical implementation: a quadrupole charge qubit formed in a triple quantum dot. The unique design of the quadrupole qubit enables a particularly simple pulse sequence for suppressing the effects of noise during gate operations. Simulations yield gate fidelities 10–1,000 times better than traditional charge qubits, depending on the magnitude of the environmental noise. Our results suggest that any qubit scheme employing Coulomb interactions (for example, encoded spin qubits or two-qubit gates) could benefit from such a quadrupolar design.
- 23 June 2017
- Published by Springer Nature in Nature Communications
- Vol. 8 (1) , 15923
Open AccessA decoherence-free subspace in a charge quadrupole qubit
Quantum computing promises significant speed-up for certain types of computational problems. However, robust implementations of semiconducting qubits must overcome the effects of charge noise that currently limit coherence during gate operations. Here we describe a scheme for protecting solid-state qubits from uniform electric field fluctuations by generalizing the concept of a decoherence-free subspace for spins, and we propose a specific physical implementation: a quadrupole charge qubit formed in a triple quantum dot. The unique design of the quadrupole qubit enables a particularly simple pulse sequence for suppressing the effects of noise during gate operations. Simulations yield gate fidelities 10–1,000 times better than traditional charge qubits, depending on the magnitude of the environmental noise. Our results suggest that any qubit scheme employing Coulomb interactions (for example, encoded spin qubits or two-qubit gates) could benefit from such a quadrupolar design.
- 19 December 2012
- Published by American Physical Society (APS) in Physical Review A
- Vol. 86 (6)
Surface code with decoherence: An analysis of three superconducting architectures
We consider realistic, multiparameter error models and investigate the performance of the surface code for three possible fault-tolerant superconducting quantum computer architectures. We map amplitude and phase damping to a diagonal Pauli ``depolarization'' channel via the Pauli twirl approximation, and obtain the logical error rate as a function of the qubit T1,2 and state preparation, gate, and readout errors. A numerical Monte Carlo simulation is performed to obtain the logical error rates, and a leading-order analytic formula is derived to estimate their behavior below threshold. Our results suggest that scalable fault-tolerant quantum computation should be possible with existing superconducting devices.
- 19 December 2012
- Published by American Physical Society (APS) in Physical Review A
- Vol. 86 (6)
Surface code with decoherence: An analysis of three superconducting architectures
We consider realistic, multiparameter error models and investigate the performance of the surface code for three possible fault-tolerant superconducting quantum computer architectures. We map amplitude and phase damping to a diagonal Pauli ``depolarization'' channel via the Pauli twirl approximation, and obtain the logical error rate as a function of the qubit T1,2 and state preparation, gate, and readout errors. A numerical Monte Carlo simulation is performed to obtain the logical error rates, and a leading-order analytic formula is derived to estimate their behavior below threshold. Our results suggest that scalable fault-tolerant quantum computation should be possible with existing superconducting devices.
- Open Access
A note on the measures of process fidelity for non-unitary quantum operations
Various fidelity measures can be defined between two quantum processes especially when at least one of them is non-unitary. In this paper we consider two such measures of state averaged process fidelity, put forward an efficient procedure to compute them and investigate their mathematical properties as well as their relationship.
Open AccessA note on the measures of process fidelity for non-unitary quantum operations
Various fidelity measures can be defined between two quantum processes especially when at least one of them is non-unitary. In this paper we consider two such measures of state averaged process fidelity, put forward an efficient procedure to compute them and investigate their mathematical properties as well as their relationship.
- Open Access
Controlled-NOT logic gate for phase qubits based on conditional spectroscopy
A controlled-NOT logic gate based on conditional spectroscopy has been demonstrated recently for a pair of superconducting flux qubits [Plantenberg et al., Nature 447, 836 (2007)]. Here we study the fidelity of this type of gate applied to a phase qubit coupled to a resonator (or a pair of capacitively coupled phase qubits). Our results show that an intrinsic fidelity of more than 99% is achievable in 45ns.
Open AccessControlled-NOT logic gate for phase qubits based on conditional spectroscopy
A controlled-NOT logic gate based on conditional spectroscopy has been demonstrated recently for a pair of superconducting flux qubits [Plantenberg et al., Nature 447, 836 (2007)]. Here we study the fidelity of this type of gate applied to a phase qubit coupled to a resonator (or a pair of capacitively coupled phase qubits). Our results show that an intrinsic fidelity of more than 99% is achievable in 45ns.
- 18 August 2011
- Published by Springer Nature in Quantum Information Processing
- Vol. 11 (6) , 1349-1357
Controlled-NOT logic gate for phase qubits based on conditional spectroscopy
- 18 August 2011
- Published by Springer Nature in Quantum Information Processing
- Vol. 11 (6) , 1349-1357
Controlled-NOT logic gate for phase qubits based on conditional spectroscopy
- 28 May 2010
- Published by American Physical Society (APS) in Physical Review A
- Vol. 81 (5)
Controlled-not gate with weakly coupled qubits: Dependence of fidelity on the form of interaction
An approach to the construction of the controlled-not quantum logic gate for a four-dimensional coupled-qubit model with weak but otherwise arbitrary coupling has been given recently [M. R. Geller et al., Phys. Rev. A 81, 012320 (2010)]. How does the resulting fidelity depend on the form of qubit-qubit coupling? In this paper we calculate intrinsic fidelity curves (fidelity in the absence of decoherence versus total gate time) for a variety of qubit-qubit interactions, including the commonly occurring isotropic Heisenberg and XY models, as well as randomly generated ones. For interactions not too close to that of the Ising model, we find that the fidelity curves do not significantly depend on the form of the interaction, and we calculate the resulting interaction-averaged fidelity curve for the non-Ising-like cases and a criterion for determining its applicability.
- 28 May 2010
- Published by American Physical Society (APS) in Physical Review A
- Vol. 81 (5)
Controlled-not gate with weakly coupled qubits: Dependence of fidelity on the form of interaction
An approach to the construction of the controlled-not quantum logic gate for a four-dimensional coupled-qubit model with weak but otherwise arbitrary coupling has been given recently [M. R. Geller et al., Phys. Rev. A 81, 012320 (2010)]. How does the resulting fidelity depend on the form of qubit-qubit coupling? In this paper we calculate intrinsic fidelity curves (fidelity in the absence of decoherence versus total gate time) for a variety of qubit-qubit interactions, including the commonly occurring isotropic Heisenberg and XY models, as well as randomly generated ones. For interactions not too close to that of the Ising model, we find that the fidelity curves do not significantly depend on the form of the interaction, and we calculate the resulting interaction-averaged fidelity curve for the non-Ising-like cases and a criterion for determining its applicability.
- Open Access
Controlled-NOT gate with weakly coupled qubits: Dependence of fidelity on the form of interaction
An approach to the construction of the CNOT quantum logic gate for a 4-dimensional coupled-qubit model with weak but otherwise arbitrary coupling has been given recently [M. R. Geller et al., Phys. Rev. A, 012320 (2010)]. How does the resulting fidelity depend on the form of qubit-qubit coupling? In this paper we calculate intrinsic fidelity curves (fidelity in the absence of decoherence versus total gate time) for a variety of qubit-qubit interactions, including the commonly occurring isotropic Heisenberg and XY models, as well as randomly generated ones. For interactions not too close to that of the Ising model, we find that the fidelity curves do not significantly depend on the form of the interaction, and we calculate the resulting interaction-averaged fidelity curve for the non-Ising-like cases and a criterion for determining its applicability.
Open AccessControlled-NOT gate with weakly coupled qubits: Dependence of fidelity on the form of interaction
An approach to the construction of the CNOT quantum logic gate for a 4-dimensional coupled-qubit model with weak but otherwise arbitrary coupling has been given recently [M. R. Geller et al., Phys. Rev. A, 012320 (2010)]. How does the resulting fidelity depend on the form of qubit-qubit coupling? In this paper we calculate intrinsic fidelity curves (fidelity in the absence of decoherence versus total gate time) for a variety of qubit-qubit interactions, including the commonly occurring isotropic Heisenberg and XY models, as well as randomly generated ones. For interactions not too close to that of the Ising model, we find that the fidelity curves do not significantly depend on the form of the interaction, and we calculate the resulting interaction-averaged fidelity curve for the non-Ising-like cases and a criterion for determining its applicability.
- 1 December 2007
- Published by World Scientific Pub Co Pte Ltd
- p. 90-98
STATISTICAL ANALYSIS OF QUASAR DATA AND VALIDITY OF THE HUBBLE LAW
- 1 December 2007
- Published by World Scientific Pub Co Pte Ltd
- p. 90-98
STATISTICAL ANALYSIS OF QUASAR DATA AND VALIDITY OF THE HUBBLE LAW