I can provide some information about the two scenarios you mentioned.
In the first scenario, you have a quantum computer with two qudits, each having 3513 states. In this case, the total number of possible states for the system would be the product of the number of states for each qudit, which is 3513 * 3513. This means the quantum computer would have a large state space capable of representing a vast amount of information.
In the second scenario, you have a quantum computer with 3513 qubits, each having two states (commonly denoted as 0 and 1). In this case, the total number of possible states for the system would be 2^3513, which is an astronomically large number. This exponential growth of the state space is one of the reasons why quantum computers have the potential to perform certain calculations much faster than classical computers.
Choosing between these two scenarios depends on the specific requirements of the quantum computation you want to perform. Different quantum algorithms and applications have different requirements in terms of the number and nature of quantum bits used. The choice between qudits and qubits is influenced by factors such as the specific quantum algorithm being implemented, the availability and stability of physical qubits or qudits, and the error rates associated with the quantum hardware.
It's worth noting that current quantum computers are still in the early stages of development, and the practical implementation of large-scale quantum systems with thousands of qubits or qudits is a significant technological challenge. Quantum computing research is actively exploring various approaches and technologies to build reliable and scalable quantum computers.