v1.0.0 - First Stable Release of Quantum-Inspired MaxCut API

What's New

This is the initial release of the Quantum-Inspired MaxCut Optimization API. It provides a simple yet effective way to solve the MaxCut problem using a quantum-inspired algorithm (QAOA) simulated on a classical computer.

Key Features:

• Implements the Quantum Approximate Optimization Algorithm (QAOA) for the MaxCut problem.
• Uses Qiskit for quantum circuit simulation.
• Provides a RESTful API using FastAPI, making it easy to integrate into other applications.
• Includes input validation to ensure correct usage.
• Clear documentation and examples in the README.

Technical Details:

• Uses a classical simulator for QAOA execution (Aer from Qiskit).
• Problem instances are converted to Quadratic Unconstrained Binary Optimization (QUBO) format for compatibility with QAOA.
• API endpoint: /max_cut
• Accepts JSON payloads with the graph's adjacency matrix and the number of QAOA layers (p).

Known Issues:

• Performance is limited by classical simulation. For large graphs, execution time can be significant. (This is important to mention as it's a limitation of simulating quantum algorithms classically)

Future Improvements:

• Explore approximate QAOA variants for improved scalability.
• Implement other optimization problems (e.g., Traveling Salesperson Problem).
• Add support for different quantum backends or simulators.

We welcome contributions and feedback! Please feel free to open issues or pull requests on GitHub.